| HAL-Inria | Publications, software ... of Inria's scientists |
Journal articles
A Complete, Exact and Efficient Implementation for Computing the Edge-Adjacency Graph of an Arrangement of Quadrics
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.
https://hal.inria.fr/inria-00537592
Contributor : Sylvain Petitjean Connect in order to contact the contributor
Submitted on : Thursday, November 18, 2010 - 5:06:29 PM
Last modification on : Friday, February 26, 2021 - 3:28:08 PM
Contributor : Sylvain Petitjean Connect in order to contact the contributor
Submitted on : Thursday, November 18, 2010 - 5:06:29 PM
Last modification on : Friday, February 26, 2021 - 3:28:08 PM
Links full text
