A convex polygon among polygonal obstacle: Placement and high-clearance motion
From MaRDI portal
Publication:685605
DOI10.1016/0925-7721(93)90001-MzbMath0779.68087MaRDI QIDQ685605
Publication date: 19 January 1994
Published in: Computational Geometry (Search for Journal in Brave)
Analysis of algorithms and problem complexity (68Q25) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)
Related Items (8)
Extremal polygon containment problems ⋮ Maximum-area and maximum-perimeter rectangles in polygons ⋮ A near-quadratic algorithm for planning the motion of a polygon in a polygonal environment ⋮ Combinatorial complexity of translating a box in polyhedral 3-space ⋮ Empty squares in arbitrary orientation among points ⋮ Near-quadratic bounds for the \(L_ 1\) Voronoi diagram of moving points ⋮ Mathematical modeling of interactions of primary geometric 3D objects ⋮ Constrained Minkowski sums: A geometric framework for solving interval problems in computational biology efficiently
Cites Work
- Unnamed Item
- Unnamed Item
- Sharp upper and lower bounds on the length of general Davenport-Schinzel sequences
- Some dynamic computational geometry problems
- On the union of Jordan regions and collision-free translational motion amidst polygonal obstacles
- Generalized Delaunay triangulation for planar graphs
- Planning a purely translational motion of a convex object in two- dimensional space using generalized Voronoi diagrams
- An O(n log n) algorithm for the Voronoi diagram of a set of simple curve segments
- Generalized Voronoi diagrams for a ladder. II: Efficient construction of the diagram
- Nonlinearity of Davenport-Schinzel sequences and of generalized path compression schemes
- A sweepline algorithm for Voronoi diagrams
- Constrained Delaunay triangulations
- 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
- On the number of critical free contacts of a convex polygonal object moving in two-dimensional polygonal space
- A “retraction” method for planning the motion of a disc
- Generalized voronoi diagrams for moving a ladder. I: Topological analysis
This page was built for publication: A convex polygon among polygonal obstacle: Placement and high-clearance motion
