scientific article; zbMATH DE number 7205027
From MaRDI portal
Publication:5111738
DOI10.4230/LIPIcs.ESA.2017.49zbMath1442.68251MaRDI QIDQ5111738
Neeraj Kumar, Subhash Suri, J. E. Hershberger
Publication date: 27 May 2020
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Analysis of algorithms and problem complexity (68Q25) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)
Related Items (5)
Shortest paths among transient obstacles ⋮ Shortest paths in the plane with obstacle violations ⋮ Improved approximation bounds for the minimum constraint removal problem ⋮ Approximate Shortest Paths in Polygons with Violations ⋮ Computing Shortest Paths in the Plane with Removable Obstacles
Cites Work
- Unnamed Item
- Unnamed Item
- 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
- Geometric path problems with violations
- 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
- 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
This page was built for publication:
