On approximating shortest paths in weighted triangular tessellations

DOI10.1007/978-3-030-96731-4_33OpenAlexW3215715196MaRDI QIDQ2154121FDOQ2154121

Prosenjit Bose, Rodrigo I. Silveira, David Orden, Guillermo Esteban

Publication date: 13 July 2022

Full work available at URL: https://arxiv.org/abs/2111.13912

zbMATH Keywords

tessellationshortest pathweighted region problem

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Cites Work

• Detecting Weakly Simple Polygons
• The weighted region problem
• Approximation algorithms for geometric shortest path problems
• Determining approximate shortest paths on weighted polyhedral surfaces
• Path Planning in 0/1/∞ Weighted Regions with Applications
• An ε — Approximation algorithm for weighted shortest paths on polyhedral surfaces
• Shortest Path Queries Among Weighted Obstacles in the Rectilinear Plane
• A note on the unsolvability of the weighted region shortest path problem
• Triangulation Refinement and Approximate Shortest Paths in Weighted Regions

Cited In (2)

• Walking in a Planar Poisson–Delaunay Triangulation: Shortcuts in the Voronoi Path
• Number of Shortest Paths in Triangular Grid for 1- and 2-Neighborhoods

This page was built for publication: On approximating shortest paths in weighted triangular tessellations

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