Approximation Schemes for Partitioning: Convex Decomposition and Surface Approximation
Computational Geometry
2014-04-16 v1
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.
Cite
@article{arxiv.1404.3776,
title = {Approximation Schemes for Partitioning: Convex Decomposition and Surface Approximation},
author = {Sayan Bandyapadhyay and Santanu Bhowmick and Kasturi Varadarajan},
journal= {arXiv preprint arXiv:1404.3776},
year = {2014}
}
Comments
21 pages, 6 figures