Querying Approximate Shortest Paths in Anisotropic Regions

DOI10.1137/080742166MaRDI QIDQ3053153zbMATH OpenOpenAlexFDO

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

Publication date 4 November 2010

Published in SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/080742166

zbMATH Keywords

approximation algorithmsshortest pathconvex distance functionsanisotropic regions

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Approximation algorithms (68W25)

Recommendations

• Querying approximate shortest paths in anisotropic regions
• Approximate Shortest Paths in Anisotropic Regions
• Approximate shortest paths in anisotropic regions
• Approximate Shortest Path Queries Using Voronoi Duals
• Shortest Path Queries in Polygonal Domains
• SHORTEST PATH QUERIES IN RECTILINEAR WORLDS
• Efficient approximate shortest-path queries among isothetic rectangular obstacles
• Shortest-Path Queries in Geometric Networks
• Approximate Shortest Path Queries on Weighted Polyhedral Surfaces

Cited in

(7)

• Fast query structures in anisotropic media
• Approximate Shortest Path Queries Using Voronoi Duals
• Pasting gauges. I: Shortest paths across a hyperplane
• Approximate shortest paths in anisotropic regions
• Approximate Shortest Paths in Anisotropic Regions
• Querying approximate shortest paths in anisotropic regions
• Navigating weighted regions with scattered skinny tetrahedra

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 Q3053153)