Approximate Shortest Path Queries on Weighted Polyhedral Surfaces
From MaRDI portal
Publication:5756700
DOI10.1007/11821069_9zbMath1132.68789OpenAlexW1507556857MaRDI QIDQ5756700
Hua Guo, Hristo N. Djidjev, Jörg-Rüdiger Sack, Doron Nussbaum, Lyudmil Aleksandrov, Anil Maheshwari
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
Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Approximation algorithms (68W25)
Related Items (5)
Shortest Path Problems on a Polyhedral Surface ⋮ Algorithms for approximate shortest path queries on weighted polyhedral surfaces ⋮ Shortest path problems on a polyhedral surface ⋮ FRÉCHET DISTANCE PROBLEMS IN WEIGHTED REGIONS ⋮ Line Segment Facility Location in Weighted Subdivisions
This page was built for publication: Approximate Shortest Path Queries on Weighted Polyhedral Surfaces
