Minimum Convex Partitions and Maximum Empty Polytopes

DOI10.1007/978-3-642-31155-0_19zbMath1357.68292arXiv1112.1124OpenAlexW1778352006MaRDI QIDQ2904557

Adrian Dumitrescu, Csaba D. Tóth, Sariel Har-Peled

Publication date: 14 August 2012

Published in: Algorithm Theory – SWAT 2012 (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Computational aspects related to convexity (52B55) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Approximation algorithms (68W25) Tilings in (n) dimensions (aspects of discrete geometry) (52C22)

This page was built for publication: Minimum Convex Partitions and Maximum Empty Polytopes