Shortest paths in the plane with obstacle violations
From MaRDI portal
Publication:2182089
DOI10.1007/s00453-020-00673-yzbMath1441.68265OpenAlexW3002890992WikidataQ126330371 ScholiaQ126330371MaRDI QIDQ2182089
Subhash Suri, Neeraj Kumar, J. E. Hershberger
Publication date: 21 May 2020
Published in: Algorithmica (Search for Journal in Brave)
Full work available at URL: https://drops.dagstuhl.de/opus/volltexte/2017/7841/
Analysis of algorithms and problem complexity (68Q25) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)
Cites Work
- Augmenting the connectivity of geometric graphs
- Shortest paths in the plane with convex polygonal obstacles
- Visibility of disjoint polygons
- Linear-time algorithms for visibility and shortest path problems inside triangulated simple polygons
- Computing minimum length paths of a given homotopy class
- \(k\)-violation linear programming
- A new algorithm for shortest paths among obstacles in the plane
- On geometric optimization with few violated constraints
- Euclidean shortest paths in the presence of rectilinear barriers
- Improving the Stretch Factor of a Geometric Network by Edge Augmentation
- Optimal Point Location in a Monotone Subdivision
- Optimal Search in Planar Subdivisions
- An Output-Sensitive Algorithm for Computing Visibility Graphs
- An Optimal Algorithm for Euclidean Shortest Paths in the Plane
- The weighted region problem
- Shortest paths in the plane with polygonal obstacles
- Computing Shortest Paths among Curved Obstacles in the Plane
- Computing Shortest Paths in the Plane with Removable Obstacles
- A near-optimal algorithm for shortest paths among curved obstacles in the plane
- Low-Dimensional Linear Programming with Violations
- Geometric k Shortest Paths
- SHORTEST PATHS AMONG OBSTACLES IN THE PLANE
- Algorithms and Computation
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Shortest paths in the plane with obstacle violations
