Approximate Shortest Paths in Polygons with Violations
From MaRDI portal
Publication:5149572
DOI10.1142/S0218195920500041zbMath1458.68266OpenAlexW3082252350MaRDI QIDQ5149572
Publication date: 11 February 2021
Published in: International Journal of Computational Geometry & Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1142/s0218195920500041
Computational aspects related to convexity (52B55) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Approximation algorithms (68W25)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Shortest paths in the plane with convex polygonal obstacles
- Linear-time algorithms for visibility and shortest path problems inside triangulated simple polygons
- Triangulating a simple polygon in linear time
- Computing minimum length paths of a given homotopy class
- A new algorithm for shortest paths among obstacles in the plane
- Practical methods for approximating shortest paths on a convex polytope in \(\mathbb{R}^3\)
- Geometric path problems with violations
- The Erdős--Nagy theorem and its ramifications
- Euclidean Shortest Paths
- Approximate Shortest Paths in Anisotropic Regions
- An Output-Sensitive Algorithm for Computing Visibility Graphs
- An Optimal Algorithm for Euclidean Shortest Paths in the Plane
- Shortest paths in the plane with polygonal obstacles
- An ε — Approximation algorithm for weighted shortest paths on polyhedral surfaces
- Computing Shortest Paths in the Plane with Removable Obstacles
- Visibility Algorithms in the Plane
- Approximate Shortest Descending Paths
- SHORTEST PATHS AMONG OBSTACLES IN THE PLANE
- Approximating shortest paths on weighted polyhedral surfaces
