Using CGAL to partition a non-simple polygon -



Using CGAL to partition a non-simple polygon -

suppose have non-simple polygon, how cgal can help me partition set of simple polygons?

for example, give polygon represented sequence of 2d points:

(1, 1) (1, -1) (-1, 1) (-1, -1)

i wish acquire 2 polygons;

(1, 1) (1, -1) (0, 0)

and

(0, 0) (-1, 1) (-1, -1)

is doable cgal?

cgal

Comments

Popular posts from this blog

php - Android app custom user registration and login with cookie using facebook sdk -

django - Access session in user model .save() -

php - .htaccess Multiple Rewrite Rules / Prioritizing -