Querying approximate shortest paths in anisotropic regions

DOI10.1145/1247069.1247082zbMATH Open1221.68070OpenAlexW2043285556MaRDI QIDQ3602857FDOQ3602857

Authors: Siu-Wing Cheng, Hyeon-Suk Na, Antoine Vigneron, Yajun Wang 

Publication date: 12 February 2009

Published in: Proceedings of the twenty-third annual symposium on Computational geometry - SCG '07 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/1247069.1247082

Recommendations

• Querying Approximate Shortest Paths in Anisotropic Regions
• Approximate shortest paths in anisotropic regions
• Approximate Shortest Paths in Anisotropic Regions
• Constructing Approximate Shortest Path Maps in Three Dimensions
• Shortest path queries in planar graphs

Mathematics Subject Classification ID

Data structures (68P05) Other finite incidence structures (geometric aspects) (51E30)

Cited In (9)

• Fast query structures in anisotropic media
• Approximate Shortest Path Queries Using Voronoi Duals
• Algorithms for approximate shortest path queries on weighted polyhedral surfaces
• Line facility location in weighted regions
• Line Segment Facility Location in Weighted Subdivisions
• Querying Approximate Shortest Paths in Anisotropic Regions
• Approximate shortest paths in anisotropic regions
• Approximate Shortest Paths in Anisotropic Regions
• Shortest Gently Descending Paths

This page was built for publication: Querying approximate shortest paths in anisotropic regions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3602857)