The design and implementation of panar maps in CGAL

DOI10.1145/351827.384255zbMath1071.68556OpenAlexW2077689027MaRDI QIDQ5463410

Eyal Flato, Iddo Hanniel, Oren Nechushtan, Eti Ezra, Dan Halperin

Publication date: 4 August 2005

Published in: ACM Journal of Experimental Algorithmics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/351827.384255

zbMATH Keywords

computational geometry

Mathematics Subject Classification ID

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

Related Items

Advanced programming techniques applied to CGAL's arrangement package ⋮ Optimal randomized incremental construction for guaranteed logarithmic planar point location ⋮ A complete, exact and efficient implementation for computing the edge-adjacency graph of an arrangement of quadrics ⋮ Improving the topology computation of an arrangement of cubics ⋮ Exact, efficient, and complete arrangement computation for cubic curves ⋮ Computing the topology of an arrangement of implicitly defined real algebraic plane curves

Uses Software

• CGAL
• LEDA
• MAPC
• Traits