Path refinement in weighted regions

DOI10.1007/s00453-018-0414-9zbMath1400.68249OpenAlexW2794083468MaRDI QIDQ1799222

Jörg-Rüdiger Sack, Amin Gheibi, Christian Scheffer, Anil Maheshwari

Publication date: 18 October 2018

Published in: Algorithmica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00453-018-0414-9

zbMATH Keywords

shortest pathcomputational geometryrefinementweighted regions

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Cites Work

• Unnamed Item
• A note on the unsolvability of the weighted region shortest path problem
• Approximation algorithms for geometric shortest path problems
• Determining approximate shortest paths on weighted polyhedral surfaces
• An Experimental Study of Weighted k-Link Shortest Path Algorithms
• The weighted region problem
• Statistics for Spatial Data
• On finding approximate optimal paths in weighted regions
• Approximating shortest paths on weighted polyhedral surfaces

This page was built for publication: Path refinement in weighted regions