Planar spanners and approximate shortest path queries among obstacles in the plane
Authors:
- 1 January 1996
- book chapter
- Published by Springer Nature
- p. 514-528
Abstract
No abstract availableKeywords
This publication has 20 references indexed in Scilit:
- Euclidean spanners1995
- Shortest path queries among weighted obstacles in the rectilinear plane1995
- On-line and dynamic algorithms for shortest path problems1995
- On parallel rectilinear obstacle- avoiding pathsComputational Geometry, 1993
- Parallel rectilinear shortest paths with rectangular obstaclesComputational Geometry, 1991
- Delaunay graphs are almost as good as complete graphsDiscrete & Computational Geometry, 1990
- There are planar graphs almost as good as the complete graphJournal of Computer and System Sciences, 1989
- Constrained delaunay triangulationsAlgorithmica, 1989
- Approximation algorithms for shortest path motion planning1987
- Voronoi diagrams based on convex distance functions1985