 |
 |
|
|
Input Description: A polygon or polyhedron \(P\).
Problem: How can \(P\) be partitioned into a small number of simple (typically convex) pieces?
Excerpt from The Algorithm Design Manual: Polygon partitioning is an important preprocessing step for many geometric algorithms, because most geometric problems are simpler and faster on convex objects than on nonconvex ones. We are better off whenever we can partition a nonconvex object into a small number of convex pieces, because it is easier to work with the pieces independently than with the original object.
| GEOMPACK (rating 8) |
CGAL (rating 7) |
| polypartition (rating 5) |
poly-decomp.js (rating 5) |
| ParMetis (rating 4) |
  Set Cover |
  Triangulation |
As an Amazon affiliate, I earn from qualifying purchases if you buy from links on this website.
Computational Geometry : Algorithms and Applications by Mark De Berg, Marc Van Kreveld, Mark Overmars, and O. Schwartskopf
Computational Geometry in C by Joseph O'Rourke
Art Gallery Theorems and Algorithms by J. O'Rourke