On the computation of an arrangement of quadrics in 3D

DOI10.1016/J.COMGEO.2004.05.003zbMath1063.65018OpenAlexW2065117466MaRDI QIDQ705551

Jean-Pierre Técourt, Monique Teillaud, Mourrain, Bernard

Publication date: 31 January 2005

Published in: Computational Geometry (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.comgeo.2004.05.003

zbMATH Keywords

Sturm sequencesAlgebraic numberSubdivisionComputer aided geometric designArrangementCertified computationImplicit surfaceMultivariate polynomial systemQuadricRational univariate representationSweeping algorithm

Mathematics Subject Classification ID

Numerical computation of solutions to systems of equations (65H10) Computer-aided design (modeling of curves and surfaces) (65D17) Algorithms with automatic result verification (65G20)

Related Items (16)

Computing polynomial univariate representations of zero-dimensional ideals by Gröbner basis ⋮ Using signature sequences to classify intersection curves of two quadrics ⋮ A generic and flexible framework for the geometrical and topological analysis of (algebraic) surfaces ⋮ Topological classification of the intersection curves of two quadrics using a set of discriminants ⋮ A complete, exact and efficient implementation for computing the edge-adjacency graph of an arrangement of quadrics ⋮ Design of the CGAL 3D spherical kernel and application to arrangements of circles on a sphere ⋮ Near-optimal parameterization of the intersection of quadrics. I. The generic algorithm ⋮ Enumerating the morphologies of non-degenerate Darboux cyclides ⋮ Tools for analyzing the intersection curve between two quadrics through projection and lifting ⋮ A Subdivision Method for Arrangement Computation of Semi-Algebraic Curves ⋮ Intersecting quadrics: an efficient and exact implementation ⋮ Topology and arrangement computation of semi-algebraic planar curves ⋮ Triangulations of Line Segment Sets in the Plane ⋮ The Voronoi diagram of three lines ⋮ Quadric Arrangement in Classifying Rigid Motions of a 3D Digital Image ⋮ An exact and efficient approach for computing a cell in an arrangement of quadrics

Uses Software

• ISOLATE

Cites Work

• On the complexity of isolating real roots and computing with certainty the topological degree
• A singly exponential stratification scheme for real semi-algebraic varieties and its applications
• Computing the isolated roots by matrix methods
• Solving zero-dimensional systems through the rational univariate representation
• Efficient isolation of polynomial's real roots.
• Dynamic Trees and Dynamic Point Location
• Improved construction of vertical decompositions of three-dimensional arrangements
• Infimaximal Frames: A Technique for Making Lines Look Like Segments
• Computing a 3-dimensional cell in an arrangement of quadrics
• Near-optimal parameterization of the intersection of quadrics
• Complete, exact, and efficient computations with cubic curves
• Intersecting quadrics
• Algorithms in real algebraic geometry
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On the computation of an arrangement of quadrics in 3D