Approximation schemes for partitioning: convex decomposition and surface approximation

DOI10.1137/1.9781611973730.96MaRDI QIDQ5363011zbMATH OpenOpenAlexFDO

Authors Sayan Bandyapadhyay, Santanu Bhowmick, Kasturi Varadarajan

Publication date 5 October 2017

Published in Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1404.3776

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Approximation algorithms (68W25)

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.

Recommendations

• Quasi-polynomial time approximation schemes for packing and covering problems in planar graphs
• Quasi-Polynomial Time Approximation Scheme for Weighted Geometric Set Cover on Pseudodisks and Halfspaces
• A QPTAS for maximum weight independent set of polygons with polylogarithmically many vertices
• Approximation schemes for independent set and sparse subsets of polygons
• Separation and approximation of polyhedral objects

Cited in

(3)

• Approximation algorithms for partitioning a rectangle with interior points
• Smoothed Analysis of Partitioning Algorithms for Euclidean Functionals
• A decision procedure for optimal polyhedron partitioning

This page was built for publication: Approximation schemes for partitioning: convex decomposition and surface approximation

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5363011)