Combinatorial complexity of translating a box in polyhedral 3-space
From MaRDI portal
Publication:1384201
DOI10.1016/S0925-7721(97)00030-8zbMath0894.68154OpenAlexW2213025670MaRDI QIDQ1384201
Publication date: 30 August 1998
Published in: Computational Geometry (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0925-7721(97)00030-8
Related Items (2)
The union of moving polygonal pseudodiscs -- combinatorial bounds and applications ⋮ Translating a convex polyhedron over monotone polyhedra
Cites Work
- Unnamed Item
- On critical orientations in the Kedem-Sharir motion planning algorithm
- A convex polygon among polygonal obstacle: Placement and high-clearance motion
- On the union of Jordan regions and collision-free translational motion amidst polygonal obstacles
- Nonlinearity of Davenport-Schinzel sequences and of generalized path compression schemes
- 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
- On the number of critical free contacts of a convex polygonal object moving in two-dimensional polygonal space
- Almost tight upper bounds for the single cell and zone problems in the three dimensions
- The Union of Convex Polyhedra in Three Dimensions
This page was built for publication: Combinatorial complexity of translating a box in polyhedral 3-space
