Approximation Schemes for Partitioning: Convex Decomposition and Surface Approximation
classification
💻 cs.CG
keywords
approximationconvexdecompositiongeometricpartitioningproblemssurfacealgorithms
read the original abstract
We revisit two NP-hard geometric partitioning problems - convex decomposition and surface approximation. Building on recent developments in geometric separators, we present quasi-polynomial time algorithms for these problems with improved approximation guarantees.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.