Voronoi-based splinegon decomposition and shortest-path tree computation
From MaRDI portal
Publication:6563938
DOI10.1016/J.CAGD.2024.102316MaRDI QIDQ6563938FDOQ6563938
Authors: Xiyu Bao, Meng Qi, Chenglei Yang, Wei Gai 
Publication date: 28 June 2024
Published in: Computer Aided Geometric Design (Search for Journal in Brave)
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
- Title not available (Why is that?)
- On the computational geometry of pocket machining
- On de Casteljau's algorithm
- Linear-time algorithms for visibility and shortest path problems inside triangulated simple polygons
- Visibility Algorithms in the Plane
- Discrete and computational geometry
- Degenerate point/curve and curve/curve bisectors arising in medial axis computations for planar domains with curved boundaries
- Decomposition and intersection of simple splinegons
- Computational geometry in a curved world
- Shortest Paths Help Solve Geometric Optimization Problems in Planar Regions
- COMPUTING THE HAUSDORFF DISTANCE BETWEEN CURVED OBJECTS
- Algorithms for the decomposition of a polygon into convex polygons
- Fair partitions of polygons: an elementary introduction
- Algorithms for fair partitioning of convex polygons
- Shortest path planning for a tethered robot
- Computing an \(L_1\) shortest path among splinegonal obstacles in the plane
- Computing shortest paths among curved obstacles in the plane
- Computing a rectilinear shortest path amid splinegons in plane
- Minimizing Distance-to-Sight in Polygonal Domains
- Title not available (Why is that?)
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)
