Improved combinatorial bounds and efficient techniques for certain motion planning problems with three degrees of freedom
From MaRDI portal
Publication:1194309
DOI10.1016/0925-7721(92)90008-GzbMath0769.68123OpenAlexW1979711565MaRDI QIDQ1194309
Publication date: 27 September 1992
Published in: Computational Geometry (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0925-7721(92)90008-g
arrangementssurfacestime complexitycombinatorial complexitycellsdegrees of freedomobstaclesmotion planning problemscombinatorial boundssurface patch3-dimensional spacetwo-dimensional arrangements
Related Items (2)
Robot motion planning and the single cell problem in arrangements ⋮ On the complexity of a single cell in certain arrangements of surfaces related to motion planning
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The complexity and construction of many faces in arrangements of lines and of segments
- Combinatorial complexity bounds for arrangements of curves and spheres
- \(\epsilon\)-nets and simplex range queries
- A new efficient motion-planning algorithm for a rod in two-dimensional polygonal space
- The number of edges of many faces in a line segment arrangement
- On the general motion-planning problem with two degrees of freedom
- An efficient motion-planning algorithm for a convex polygonal object in two-dimensional polygonal space
- Castles in the air revisited
- Applications of random sampling in computational geometry. II
- On extremal problems of graphs and generalized graphs
- Triangles in space or building (and analyzing) castles in the air
- An efficient and simple motion planning algorithm for a ladder amidst polygonal barriers
- Efficient Motion Planning for an L-Shaped Object
This page was built for publication: Improved combinatorial bounds and efficient techniques for certain motion planning problems with three degrees of freedom
