Computational geometry column 39

This column is devoted to partitions of point-sets into convex subsets with interior-disjoint convex hulls. We review some partitioning problems and corresponding algorithms. At the end we list some open problems. For simplicity, in most cases we remain ...

Can a simple spherical polygon always be triangulated? The answer depends on the definitions of "polygon" and "triangulate".

Define a spherical polygon to be a simple, closed curve on a sphere S composed of a finite number of great circle arcs (also ...