Near-optimal parameterization of the intersection of quadrics

DOI10.1145/777792.777830zbMath1375.68124OpenAlexW2062605698MaRDI QIDQ5361630

Laurent Dupont, Sylvain Petitjean, Sylvain Lazard, Daniel Lazard

Publication date: 29 September 2017

Published in: Proceedings of the nineteenth annual symposium on Computational geometry (Search for Journal in Brave)

Full work available at URL: https://hal.inria.fr/inria-00099789/file/SoCG03.pdf

zbMATH Keywords

quadric surface intersectionrobustness of geometric computations

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Computational aspects of algebraic curves (14Q05)

Related Items (10)

Real algebraic numbers and polynomial systems of small degree ⋮ Using signature sequences to classify intersection curves of two quadrics ⋮ Near-optimal parameterization of the intersection of quadrics. I. The generic algorithm ⋮ Face-guarding polyhedra ⋮ Enumerating the morphologies of non-degenerate Darboux cyclides ⋮ On the computation of an arrangement of quadrics in 3D ⋮ Intersecting quadrics: an efficient and exact implementation ⋮ A robust algorithm for finding the real intersections of three quadric surfaces ⋮ An exact and efficient approach for computing a cell in an arrangement of quadrics ⋮ Reprint of: Face-guarding polyhedra

This page was built for publication: Near-optimal parameterization of the intersection of quadrics