Shortest Path Queries in Polygonal Domains

Authors:
Hua Guo;Anil Maheshwari;Jörg-Rüdiger Sack
Affiliations:
School of Computer Science, Carleton University, Ottawa, Canada K1S 5B6;School of Computer Science, Carleton University, Ottawa, Canada K1S 5B6;School of Computer Science, Carleton University, Ottawa, Canada K1S 5B6
Venue:
AAIM '08 Proceedings of the 4th international conference on Algorithmic Aspects in Information and Management
Year:
2008

Citing 5
Cited 2

Voronoi diagram for multiply-connected polygonal domains 1: algorithm

IBM Journal of Research and Development
Optimal shortest path queries in a simple polygon

Journal of Computer and System Sciences
Two-point Euclidean shortest path queries in the plane

Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
An Optimal Algorithm for Euclidean Shortest Paths in the Plane

SIAM Journal on Computing
On Geometric Path Query Problems

WADS '97 Proceedings of the 5th International Workshop on Algorithms and Data Structures

The geodesic diameter of polygonal domains

ESA'10 Proceedings of the 18th annual European conference on Algorithms: Part I
Querying two boundary points for shortest paths in a polygonal domain

Computational Geometry: Theory and Applications

Quantified Score

Hi-index	0.00

Visualization

Abstract

We consider shortest path queries in a polygonal domain Phaving nvertices and hholes. A skeleton graph is a subgraph of a Voronoi diagram of P. Our novel algorithm utilizes a reduced skeleton graph of Pto compute a tessellation of P. It builds a data structure of size O(n2) in O(n2logn) time to support distance queries for any pair of query points in Pin O(hlogn) time.