The union of moving polygonal pseudodiscs -- combinatorial bounds and applications

DOI10.1016/S0925-7721(98)00020-0zbMATH Open0911.68199OpenAlexW2004979970MaRDI QIDQ1272309FDOQ1272309

Authors: Hazel Everett, Mark de Berg, Leonidas 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

Recommendations

• Item:QQ2391707
• scientific article; zbMATH DE number 1786523
• Item:QQ2391707
• The Union of Convex Polyhedra in Three Dimensions
• On the union of Jordan regions and collision-free translational motion amidst polygonal obstacles

zbMATH Keywords

polygonal pseudodiscs

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Cites Work

• Title not available (Why is that?)
• On the union of Jordan regions and collision-free translational motion amidst polygonal obstacles
• Sharp upper and lower bounds on the length of general Davenport-Schinzel sequences
• The union of moving polygonal pseudodiscs -- combinatorial bounds and applications
• On lines missing polyhedral sets in 3-space
• Lines in space: Combinatorics and algorithms
• On Translational Motion Planning of a Convex Polyhedron in 3-Space
• On the number of critical free contacts of a convex polygonal object moving in two-dimensional polygonal space
• Combinatorial complexity of translating a box in polyhedral 3-space

Cited In (2)

• 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

This page was built for publication: The union of moving polygonal pseudodiscs -- combinatorial bounds and applications

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1272309)