Complete, Exact and Efficient Implementation for Computing the Adjacency Graph of an Arrangement of Quadrics

DOI10.1007/978-3-540-75520-3_56zbMath1151.68703OpenAlexW1792162505MaRDI QIDQ3527253

Michael Hemmer, Elmar Schömer, Laurent Dupont, Sylvain Petitjean

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_56

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05) Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Uses Software

• CGAL
• EXACUS

This page was built for publication: Complete, Exact and Efficient Implementation for Computing the Adjacency Graph of an Arrangement of Quadrics