We conclude, in this third part, the presentation of an algorithm for computing an exact and proper parameterization of the intersection of two quadrics. The coordinate functions of the parameterizations in projective space are polynomial, whenever it is possible. They are also near-optimal in the sense that the number of distinct square roots appearing in the coefficients of these functions is minimal except in a small number of cases (characterized by the real type of the intersection) where there may be an extra square root. Our algorithm builds on the classification of pencils of quadrics of $\mpr^3(\mathbb{R})$ over the reals presented in Part~II and the type-detection algorithm that we deduced from this classification. Moreover, since the algorithm presented in Part~I is near-optimal when the intersection is a non-singular quartic, we focus here on the case where the intersection is singular and present, for all possible real types of intersection, algorithms for computing near-optimal rational parameterizations. We also give examples covering all the possible situations, in terms of both the real type of intersection and the number and depth of square roots appearing in the coefficients of the parameterizations.

EXPLOR_STEP=$WICRI_ROOT/Wicri/Lorraine/explor/InforLorV4/Data/Hal/Checkpoint

HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 003591 | SxmlIndent | more

HfdSelect -h $EXPLOR_AREA/Data/Hal/Checkpoint/biblio.hfd -nk 003591 | SxmlIndent | more

{{Explor lien
   |wiki=    Wicri/Lorraine
   |area=    InforLorV4
   |flux=    Hal
   |étape=   Checkpoint
   |type=    RBID
   |clé=     Hal:inria-00186091
   |texte=   Near-Optimal Parameterization of the Intersection of Quadrics: III. Parameterizing Singular Intersections
}}