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

DOI10.1007/978-3-540-75520-3_57MaRDI QIDQ3527254zbMATH OpenOpenAlexFDO

Authors Eric Berberich, Efi Fogel, K. 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)

Recommendations

• Arrangements on parametric surfaces. I: General framework and infrastructure
• Arrangements on parametric surfaces. II: Concretizations and applications
• scientific article; zbMATH DE number 66691
• Exact, efficient, and complete arrangement computation for cubic curves
• Topologically sweeping an arrangement

Cited in

(6)

• A subdivision method for arrangement computation of semi-algebraic curves
• 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
• Exact Minkowksi sums of polyhedra and exact and efficient decomposition of polyhedra into convex pieces
• Design of the CGAL 3D spherical kernel and application to arrangements of circles on a sphere

Describes a project that uses

Uses Software

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

This page was built for publication: Sweeping and Maintaining Two-Dimensional Arrangements on Surfaces: A First Step

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