On the complexity of the union of geometric objects

DOI10.1007/3-540-47738-1_28MaRDI QIDQ4547818zbMATH OpenFDO

Authors János Pach

Publication date 21 August 2002

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2098/20980292

Mathematics Subject Classification ID

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

Recommendations

• State of the union (of geometric objects)
• On the complexity of the union of fat convex objects in the plane
• Better bounds on the union complexity of locally fat objects
• FSTTCS 2005: Foundations of Software Technology and Theoretical Computer Science
• Improved bounds on the union complexity of fat objects

Cited in

(8)

• The union of moving polygonal pseudodiscs -- combinatorial bounds and applications
• Speeding up the incremental construction of the union of geometric objects in practice.
• On the union complexity of families of axis-parallel rectangles with a low packing number
• On the union of \(\kappa\)-curved objects
• State of the union (of geometric objects)
• On the union of -round objects
• On the union of cylinders in three dimensions
• On the union of -round objects in three and four dimensions

This page was built for publication: On the complexity of the union of geometric objects

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