Speeding up the incremental construction of the union of geometric objects in practice.

DOI10.1016/j.comgeo.2003.07.006zbMath1039.65019OpenAlexW2002581612MaRDI QIDQ1421031

Dan Halperin, Eti Ezra, Micha Sharir

Publication date: 23 January 2004

Published in: Computational Geometry (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.comgeo.2003.07.006

zbMATH Keywords

arrangementsnumerical examplesrandomizationrandomized incremental constructionalgorithmic engineeringdisjoint-cover algorithmexact computingUnion of geometric objects

Mathematics Subject Classification ID

Numerical aspects of computer graphics, image analysis, and computational geometry (65D18)

Related Items

Approximating the k-Level in Three-Dimensional Plane Arrangements ⋮ Limits of local search: quality and efficiency

Uses Software

• LEDA

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the union of Jordan regions and collision-free translational motion amidst polygonal obstacles
• On a class of \(O(n^ 2)\) problems in computational geometry
• Fat Triangles Determine Linearly Many Holes

This page was built for publication: Speeding up the incremental construction of the union of geometric objects in practice.