A Complete, Exact and Efficient Implementation for Computing the Edge-Adjacency Graph of an Arrangement of Quadrics - Archive ouverte HAL Access content directly
Journal Articles Journal of Symbolic Computation Year : 2011

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

(1) , (2) , (2) , (3)
1
2
3

Abstract

We present a complete, exact and efficient implementation to compute the edge-adjacency graph of an arrangement of quadrics, i.e. surfaces of algebraic degree 2. This is a major step towards the computation of the full 3D arrangement. We enhanced an implementation for an exact parameterization of the intersection curves of two quadrics, such that we can compute the exact parameter value for intersection points and from that the edge-adjacency graph of the arrangement. Our implementation is complete in the sense that it can handle all kinds of inputs including all degenerate ones, i.e. singularities or tangential intersection points. It is exact in that it always computes the mathematically correct result. It is efficient measured in running times, i.e. it compares favorably to the only previous implementation.

Dates and versions

inria-00537592 , version 1 (18-11-2010)

Identifiers

Cite

Michael Hemmer, Laurent Dupont, Sylvain Petitjean, Elmar Schömer. A Complete, Exact and Efficient Implementation for Computing the Edge-Adjacency Graph of an Arrangement of Quadrics. Journal of Symbolic Computation, 2011, 46 (4), pp.467-494. ⟨10.1016/j.jsc.2010.11.002⟩. ⟨inria-00537592⟩
247 View
0 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More