On the flatness of Minkowski sums

DOI10.1016/S0020-0190(01)00233-2zbMath1047.68147OpenAlexW2006114064MaRDI QIDQ1847384

Mark T. de Berg, A. Frank van der Stappen

Publication date: 24 June 2003

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0020-0190(01)00233-2

Mathematics Subject Classification ID

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

Cites Work

• Approximate motion planning and the complexity of the boundary of the union of simple geometric figures
• On fat partitioning, fat covering and the union size of polygons
• The complexity of the free space for motion planning amidst fat obstacles
• Computing depth orders for fat objects and related problems
• Fat Triangles Determine Linearly Many Holes
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On the flatness of Minkowski sums