scientific article; zbMATH DE number 1302178
From MaRDI portal
Publication:4247445
The newly-developed algorithmic paradigms for processing geometric shortest path queries and some related problems are discuss in dhe paper. Section 1 is for the planar settings that have poligonal obstacles. Section 2 presents a general paradigm, called the gateway paradigm. In section 3 it is applied to several problems of processing exact geometric shortest path queries. Section 4 applies this paradigm in approximate g.sh.p.q. Section 5 discusses some open problems. For the entire collection see [Zbl 0914.90001].
Recommendations
Cited in
(11)- Searching shortest paths on a set of geometric objects
- Efficient computation of geodesic shortest paths
- Approximation algorithms for geometric shortest path problems
- Efficient Algorithms for Geometric Graph Search Problems
- Approximating geometric bottleneck shortest paths
- ON GEOMETRIC PATH QUERY PROBLEMS
- On geometric path query problems
- Geometric k Shortest Paths
- Fundamentals of Computation Theory
- Space-efficient algorithms for reachability in directed geometric graphs
- Evaluating geometric queries using few arithmetic operations
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4247445)