Approximation Schemes for Partitioning: Convex Decomposition and Surface Approximation
From MaRDI portal
Publication:5363011
DOI10.1137/1.9781611973730.96zbMath1372.68249arXiv1404.3776OpenAlexW2949853069MaRDI QIDQ5363011
Sayan Bandyapadhyay, Santanu Bhowmick, Kasturi R. 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
Analysis of algorithms and problem complexity (68Q25) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Approximation algorithms (68W25)
This page was built for publication: Approximation Schemes for Partitioning: Convex Decomposition and Surface Approximation