The union of moving polygonal pseudodiscs -- combinatorial bounds and applications
From MaRDI portal
Publication:1272309
DOI10.1016/S0925-7721(98)00020-0zbMath0911.68199OpenAlexW2004979970MaRDI QIDQ1272309
Hazel Everett, Mark T. de Berg, Leonidas J. Guibas
Publication date: 17 May 1999
Published in: Computational Geometry (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0925-7721(98)00020-0
Related Items
On the complexity of sets of free lines and line segments among balls in three dimensions ⋮ The union of moving polygonal pseudodiscs -- combinatorial bounds and applications
Cites Work
- Unnamed Item
- Sharp upper and lower bounds on the length of general Davenport-Schinzel sequences
- On the union of Jordan regions and collision-free translational motion amidst polygonal obstacles
- The union of moving polygonal pseudodiscs -- combinatorial bounds and applications
- On lines missing polyhedral sets in 3-space
- Combinatorial complexity of translating a box in polyhedral 3-space
- On the number of critical free contacts of a convex polygonal object moving in two-dimensional polygonal space
- Lines in space: Combinatorics and algorithms
- On Translational Motion Planning of a Convex Polyhedron in 3-Space
