Intersecting quadrics

DOI10.1145/997817.997880MaRDI QIDQ5361697zbMATH OpenOpenAlexFDO

Authors Sylvain Lazard, Sylvain Petitjean, Luis Peñaranda

Publication date 29 September 2017

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

Full work available at URL https://doi.org/10.1145/997817.997880

zbMATH Keywords

C++ implementationexperimental analysisintersection of quadrics

Mathematics Subject Classification ID

Software, source code, etc. for problems pertaining to algebraic geometry (14-04) Computational aspects of algebraic curves (14Q05) Symbolic computation and algebraic computation (68W30)

Recommendations

• Intersecting quadrics: an efficient and exact implementation
• Near-optimal parameterization of the intersection of quadrics
• Near-optimal parameterization of the intersection of quadrics. I. The generic algorithm
• An exact, complete and efficient implementation for computing planar maps of quadric intersection curves: exploiting a little more geometry and a little less algebra
• Enhancing Levin's method for computing quadric-surface intersections
• A robust algorithm for finding the real intersections of three quadric surfaces
• Near-optimal parameterization of the intersection of quadrics. III. Parameterizing singular intersections
• A complete and efficient algorithm for the intersection of a general and a convex polyhedron

Cited in

(11)

• Intersecting quadrics: an efficient and exact implementation
• An exact and efficient approach for computing a cell in an arrangement of quadrics
• Quadric decomposition for computing the intersections of surfaces of revolution
• Near-optimal parameterization of the intersection of quadrics
• An exact, complete and efficient implementation for computing planar maps of quadric intersection curves: exploiting a little more geometry and a little less algebra
• Using signature sequences to classify intersection curves of two quadrics
• A complete, exact and efficient implementation for computing the edge-adjacency graph of an arrangement of quadrics
• On the computation of an arrangement of quadrics in 3D
• Near-optimal parameterization of the intersection of quadrics. I. The generic algorithm
• Near-optimal parameterization of the intersection of quadrics. II. A classification of pencils
• Near-optimal parameterization of the intersection of quadrics. III. Parameterizing singular intersections

Describes a project that uses

Uses Software

• MuPAD

This page was built for publication: Intersecting quadrics

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5361697)