Storing the subdivision of a polyhedral surface
- 1 June 1987
- journal article
- Published by Springer Nature in Discrete & Computational Geometry
- Vol. 2 (2), 153-174
- https://doi.org/10.1007/bf02187877
Abstract
No abstract availableKeywords
This publication has 15 references indexed in Scilit:
- The Discrete Geodesic ProblemSIAM Journal on Computing, 1987
- On Shortest Paths in Polyhedral SpacesSIAM Journal on Computing, 1986
- Efficient uses of the pastJournal of Algorithms, 1985
- Intersection and Closest-Pair Problems for a Set of Planar DiscsSIAM Journal on Computing, 1985
- Primitives for the manipulation of general subdivisions and the computation of VoronoiACM Transactions on Graphics, 1985
- Fast detection of polyhedral intersectionTheoretical Computer Science, 1983
- Optimal Search in Planar SubdivisionsSIAM Journal on Computing, 1983
- A linear 5-coloring algorithm of planar graphsJournal of Algorithms, 1981
- A New Approach to Planar Point LocationSIAM Journal on Computing, 1981
- Finding the intersection of two convex polyhedraTheoretical Computer Science, 1978