Abstract
We consider shortest path queries in a polygonal domain P having n vertices and h holes. A skeleton graph is a subgraph of a Voronoi diagram of P. Our novel algorithm utilizes a reduced skeleton graph of P to compute a tessellation of P. It builds a data structure of size O(n 2) in O(n 2logn) time to support distance queries for any pair of query points in P in O(hlogn) time. © 2008 Springer-Verlag Berlin Heidelberg.
Cite
CITATION STYLE
Guo, H., Maheshwari, A., & Sack, J. R. (2008). Shortest path queries in polygonal domains. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5034 LNCS, pp. 200–211). https://doi.org/10.1007/978-3-540-68880-8_20
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
