Next: Sets and Partitions
Previous: MINIMUM LENGTH TRIANGULATION
A family of disjoint polygons
A separating subdivision, i.e., a family of k polygons
with pairwise disjoint boundaries such that, for each i,
The size of the subdivision, i.e., the total number of edges of the polygons
- Good News:
Approximable within 7 .
The problem of separating a family of three-dimensional convex polyhedra is
while the problem of separating two
d-dimensional convex polyhedra is approximable within
denotes the number of facets in the input family.