Triangulating a nonconvex polytope
- 1 October 1990
- journal article
- Published by Springer Nature in Discrete & Computational Geometry
- Vol. 5 (5) , 505-526
- https://doi.org/10.1007/bf02187807
Abstract
No abstract availableKeywords
This publication has 25 references indexed in Scilit:
- A singly-exponential stratification scheme for real semi-algebraic varieties and its applicationsPublished by Springer Nature ,1989
- On Approximations and Incidence in Cylindrical Algebraic DecompositionsSIAM Journal on Computing, 1986
- Primitives for the manipulation of general subdivisions and the computation of VoronoiACM Transactions on Graphics, 1985
- The power of geometric dualityBIT Numerical Mathematics, 1985
- Convex Partitions of Polyhedra: A Lower Bound and Worst-Case Optimal AlgorithmSIAM Journal on Computing, 1984
- On the “piano movers” problem. II. General techniques for computing topological properties of real algebraic manifoldsAdvances in Applied Mathematics, 1983
- Optimal Search in Planar SubdivisionsSIAM Journal on Computing, 1983
- The power of non-rectilinear holesPublished by Springer Nature ,1982
- Finding the intersection of two convex polyhedraTheoretical Computer Science, 1978
- Elementary Structure of Real Algebraic VarietiesAnnals of Mathematics, 1957