Approximate Shortest Path Queries Using Voronoi Duals

DOI10.1007/978-3-642-16007-3_2MaRDI QIDQ3052756zbMATH OpenOpenAlexFDO

Authors Shinichi Honiden, C. Sommer, Martin Wolff, Michael E. Houle

Publication date 2 November 2010

Published in Transactions on Computational Science IX (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-16007-3_2

Mathematics Subject Classification ID

Signed and weighted graphs (05C22) Paths and cycles (05C38) Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Recommendations

• Shortest Path Queries in Polygonal Domains
• Short paths on the Voronoi graph and closest vector problem with preprocessing
• Optimal shortest path queries in a simple polygon
• Approximate Shortest Path Queries on Weighted Polyhedral Surfaces
• Algorithms for approximate shortest path queries on weighted polyhedral surfaces
• Computing approximate shortest paths on convex polytopes
• Shortest-Path Queries in Geometric Networks
• Querying Approximate Shortest Paths in Anisotropic Regions
• Querying approximate shortest paths in anisotropic regions
• Approximate shortest paths in simple polyhedra

Cited in

(5)

• Querying Approximate Shortest Paths in Anisotropic Regions
• Boosting the exploration of huge dynamic graphs
• Shortest-path queries in static networks
• High-fugacity expansion and crystallization in non-sliding hard-core lattice particle models without a tiling constraint
• Analysis of farthest point sampling for approximating geodesics in a graph

This page was built for publication: Approximate Shortest Path Queries Using Voronoi Duals

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