Sweeping and Maintaining Two-Dimensional Arrangements on Surfaces: A First Step

DOI10.1007/978-3-540-75520-3_57zbMath1151.68700OpenAlexW1753196520MaRDI QIDQ3527254

Eric Berberich, Efi Fogel, Kurt Mehlhorn, Ron Wein, Dan Halperin

Publication date: 25 September 2008

Published in: Algorithms – ESA 2007 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-75520-3_57

Mathematics Subject Classification ID

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

Related Items

Exact Minkowksi sums of polyhedra and exact and efficient decomposition of polyhedra into convex pieces, A generic and flexible framework for the geometrical and topological analysis of (algebraic) surfaces, Arrangements on parametric surfaces. I: General framework and infrastructure, Arrangements on parametric surfaces. II: Concretizations and applications, Design of the CGAL 3D spherical kernel and application to arrangements of circles on a sphere, A Subdivision Method for Arrangement Computation of Semi-Algebraic Curves

Uses Software

• CGAL
• EXACUS
• 2D Arrangement
• 2D Regularized Boolean Set-Operations