Towards the Robust Intersection of Implicit Quadrics - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Book Sections Year : 2002

Towards the Robust Intersection of Implicit Quadrics


We are interested in efficiently and robustly computing a parametric form of the intersection of two implicit quadrics with rational coefficients. Our method is similar in spirit to the general method introduced by J. Levin for computing an explicit representation of the intersection of two quadrics, but extends it in several directions. Combining results from the theory of quadratic forms, a projective formalism and new theorems characterizing the intersection of two quadratic surfaces, we show how to obtain parametric representations that are both ``simple'' (the size of the coefficients is small) and ``as rational as possible''.
Fichier principal
Vignette du fichier
sheffield_09_2001.pdf (211.7 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

inria-00100878 , version 1 (15-12-2009)


  • HAL Id : inria-00100878 , version 1


Laurent Dupont, Daniel Lazard, Sylvain Lazard, Sylvain Petitjean. Towards the Robust Intersection of Implicit Quadrics. J. Winkler and M. Niranjan. Uncertainty in Geometric Computations, Kluwer Academic Publishers, pp.59-68, 2002, International Series in Engineering and Computer Science. ⟨inria-00100878⟩
132 View
108 Download


Gmail Facebook Twitter LinkedIn More