Convex Partitions of Polyhedra: A Lower Bound and Worst-Case Optimal Algorithm
- 1 August 1984
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Computing
- Vol. 13 (3) , 488-507
- https://doi.org/10.1137/0213031
Abstract
No abstract availableThis publication has 4 references indexed in Scilit:
- Some NP-hard polygon decomposition problemsIEEE Transactions on Information Theory, 1983
- The power of non-rectilinear holesPublished by Springer Nature ,1982
- A New Approach to Planar Point LocationSIAM Journal on Computing, 1981
- Triangulating a simple polygonInformation Processing Letters, 1978