Computing depth orders for fat objects and related problems
Open Access
- 1 November 1995
- journal article
- Published by Elsevier in Computational Geometry
- Vol. 5 (4) , 187-206
- https://doi.org/10.1016/0925-7721(95)00005-8
Abstract
No abstract availableKeywords
This publication has 20 references indexed in Scilit:
- Applications of Parametric Searching in Geometric OptimizationJournal of Algorithms, 1994
- Ray shooting in polygons using geodesic triangulationsAlgorithmica, 1994
- On range searching with semialgebraic setsDiscrete & Computational Geometry, 1994
- Algorithms for bichromatic line-segment problems and polyhedral terrainsAlgorithmica, 1994
- Circle Shooting in a Simple PolygonJournal of Algorithms, 1993
- Approximate motion planning and the complexity of the boundary of the union of simple geometric figuresAlgorithmica, 1992
- Euclidean minimum spanning trees and bichromatic closest pairsDiscrete & Computational Geometry, 1991
- An optimal algorithm for the boundary of a cell in a union of raysAlgorithmica, 1990
- Red-Blue Intersection Detection Algorithms, with Applications to Motion Planning and Collision DetectionSIAM Journal on Computing, 1990
- Visibility and intersection problems in plane geometryDiscrete & Computational Geometry, 1989