Intersecting Quadrics: An Efficient and Exact Implementation - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2004

Intersecting Quadrics: An Efficient and Exact Implementation


We present the first complete, exact and efficient C++ implementation of a method for parameterizing the intersection of two implicit quadrics with integer coefficients of arbitrary size. It is based on the near-optimal algorithm recently introduced by Dupont et al.~\cite{dupont03a}. Unlike existing implementations, it correctly identifies and parameterizes all the connected components of the intersection in all the possible cases, returning parameterizations with rational functions whenever such parameterizations exist. In addition, the coefficient field of the parameterizations is either minimal or involves one possibly unneeded square root.
Fichier principal
Vignette du fichier
SoCG_final.pdf (288.41 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

inria-00104003 , version 1 (07-11-2007)



Sylvain Lazard, Luis Peñaranda, Sylvain Petitjean. Intersecting Quadrics: An Efficient and Exact Implementation. Symposium on Computational Geometry - SoCG'2004, Jun 2004, Brooklyn, NY, United States. pp.419 - 428, ⟨10.1145/997817.997880⟩. ⟨inria-00104003⟩
291 View
214 Download



Gmail Facebook Twitter LinkedIn More