Approximate motion planning and the complexity of the boundary of the union of simple geometric figures
From MaRDI portal
(Redirected from Publication:1201745)
Recommendations
- A near-quadratic algorithm for planning the motion of a polygon in a polygonal environment
- An efficient motion-planning algorithm for a convex polygonal object in two-dimensional polygonal space
- scientific article; zbMATH DE number 3945381
- Improved combinatorial bounds and efficient techniques for certain motion planning problems with three degrees of freedom
- Motion planning in the presence of moving obstacles
Cites work
- An efficient motion-planning algorithm for a convex polygonal object in two-dimensional polygonal space
- On the general motion-planning problem with two degrees of freedom
- On the union of Jordan regions and collision-free translational motion amidst polygonal obstacles
- Optimal Point Location in a Monotone Subdivision
- Planning a purely translational motion of a convex object in two- dimensional space using generalized Voronoi diagrams
Cited in
(23)- Models and motion planning
- Visibility of rectagular objects inL1metric
- Generalized disk graphs
- An optimal-time algorithm for shortest paths on realistic polyhedra
- On realistic terrains
- On the union of Jordan regions and collision-free translational motion amidst polygonal obstacles
- Two- and three- dimensional point location in rectangular subdivisions
- Dynamic data structures for fat objects and their applications
- Models and motion planning
- Improved bounds on the union complexity of fat objects
- On the union complexity of families of axis-parallel rectangles with a low packing number
- Computing depth orders for fat objects and related problems
- Geometric eccentricity and the complexity of manipulation plans
- The complexity of the free space for a robot moving amidst fat obstacles
- Computing depth orders and related problems
- 3-D vertical ray shooting and 2-D point enclosure, range searching, and arc shooting amidst convex fat objects
- On fat partitioning, fat covering and the union size of polygons
- The complexity of the free space for motion planning amidst fat obstacles
- On \(k\)-sets in arrangements of curves and surfaces
- On complexity and motion planning for co-rank one sub-Riemannian metrics
- Simultaneous inner and outer approximation of shapes
- Improved combinatorial bounds and efficient techniques for certain motion planning problems with three degrees of freedom
- On the flatness of Minkowski sums
This page was built for publication: Approximate motion planning and the complexity of the boundary of the union of simple geometric figures
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1201745)
