Approximate Shortest Path Queries on Weighted Polyhedral Surfaces

DOI10.1007/11821069_9MaRDI QIDQ5756700zbMATH OpenOpenAlexFDO

Authors Lyudmil Aleksandrov, Hristo N. Djidjev, Hua Guo, Anil Maheshwari, Doron Nussbaum, Jörg-Rüdiger Sack

Publication date 5 September 2007

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/11821069_9

Mathematics Subject Classification ID

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

Recommendations

• Algorithms for approximate shortest path queries on weighted polyhedral surfaces
• Approximate distance queries for weighted polyhedral surfaces
• Determining approximate shortest paths on weighted polyhedral surfaces
• An ε — Approximation algorithm for weighted shortest paths on polyhedral surfaces
• Fundamentals of Computation Theory

Cited in

(10)

• Approximate Shortest Path Queries Using Voronoi Duals
• Querying Approximate Shortest Paths in Anisotropic Regions
• Approximate distance queries for weighted polyhedral surfaces
• Shortest Path Problems on a Polyhedral Surface
• Fréchet distance problems in weighted regions
• Line Segment Facility Location in Weighted Subdivisions
• Approximating generalized distance functions on weighted triangulated surfaces with applications
• Shortest path problems on a polyhedral surface
• Algorithms for approximate shortest path queries on weighted polyhedral surfaces
• Efficiently determining a locally exact shortest path on polyhedral surfaces

This page was built for publication: Approximate Shortest Path Queries on Weighted Polyhedral Surfaces

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