Voronoi-based splinegon decomposition and shortest-path tree computation
From MaRDI portal
Publication:6563938
Recommendations
- Computing shortest paths among curved obstacles in the plane
- Computing a rectilinear shortest path amid splinegons in plane
- Voronoi diagrams with barriers and on polyhedra for minimal path planning
- Computing an \(L_1\) shortest path among splinegonal obstacles in the plane
- Optimal mesh algorithms for the Voronoi diagram of line segments and motion planning in the plane
Cites work
- scientific article; zbMATH DE number 7559233 (Why is no real title available?)
- scientific article; zbMATH DE number 6776481 (Why is no real title available?)
- Algorithms for fair partitioning of convex polygons
- Algorithms for the decomposition of a polygon into convex polygons
- COMPUTING THE HAUSDORFF DISTANCE BETWEEN CURVED OBJECTS
- Computational geometry in a curved world
- Computing a rectilinear shortest path amid splinegons in plane
- Computing an \(L_1\) shortest path among splinegonal obstacles in the plane
- Computing shortest paths among curved obstacles in the plane
- Decomposition and intersection of simple splinegons
- Degenerate point/curve and curve/curve bisectors arising in medial axis computations for planar domains with curved boundaries
- Discrete and computational geometry
- Fair partitions of polygons: an elementary introduction
- Linear-time algorithms for visibility and shortest path problems inside triangulated simple polygons
- Minimizing Distance-to-Sight in Polygonal Domains
- On de Casteljau's algorithm
- On the computational geometry of pocket machining
- Shortest Paths Help Solve Geometric Optimization Problems in Planar Regions
- Shortest path planning for a tethered robot
- Visibility Algorithms in the Plane
This page was built for publication: Voronoi-based splinegon decomposition and shortest-path tree computation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6563938)
