Shortest paths in the plane with obstacle violations
From MaRDI portal
Publication:5111738
DOI10.4230/LIPICS.ESA.2017.49zbMATH Open1442.68251MaRDI QIDQ5111738FDOQ5111738
Authors: Neeraj Kumar, John Hershberger, Subhash Suri 
Publication date: 27 May 2020
Recommendations
Analysis of algorithms and problem complexity (68Q25) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)
Cites Work
- Network flows. Theory, algorithms, and applications.
- Optimal Search in Planar Subdivisions
- An Output-Sensitive Algorithm for Computing Visibility Graphs
- Linear-time algorithms for visibility and shortest path problems inside triangulated simple polygons
- On geometric optimization with few violated constraints
- Optimal Point Location in a Monotone Subdivision
- An Optimal Algorithm for Euclidean Shortest Paths in the Plane
- SHORTEST PATHS AMONG OBSTACLES IN THE PLANE
- Euclidean shortest paths in the presence of rectilinear barriers
- The weighted region problem
- \(k\)-violation linear programming
- Low-Dimensional Linear Programming with Violations
- Augmenting the connectivity of geometric graphs
- Shortest paths in the plane with convex polygonal obstacles
- Visibility of disjoint polygons
- Improving the Stretch Factor of a Geometric Network by Edge Augmentation
- Title not available (Why is that?)
- Computing minimum length paths of a given homotopy class
- Shortest paths in the plane with polygonal obstacles
- A new algorithm for shortest paths among obstacles in the plane
- Algorithms and Computation
- A near-optimal algorithm for shortest paths among curved obstacles in the plane
- Geometric path problems with violations
- Geometric k Shortest Paths
- Computing Shortest Paths among Curved Obstacles in the Plane
Cited In (8)
- k-th shortest collision-free path planning
- Computing Shortest Paths in the Plane with Removable Obstacles
- Shortest paths among transient obstacles
- Approximate Shortest Paths in Polygons with Violations
- SHORTEST PATHS AMONG OBSTACLES IN THE PLANE
- Title not available (Why is that?)
- Shortest paths in the plane with obstacle violations
- Improved approximation bounds for the minimum constraint removal problem
This page was built for publication: Shortest paths in the plane with obstacle violations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5111738)
