A complete, exact and efficient implementation for computing the edge-adjacency graph of an arrangement of quadrics
From MaRDI portal
Publication:629354
DOI10.1016/j.jsc.2010.11.002zbMath1210.65059OpenAlexW2171198234MaRDI QIDQ629354
Michael Hemmer, Sylvain Petitjean, Laurent Dupont, Elmar Schömer
Publication date: 9 March 2011
Published in: Journal of Symbolic Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jsc.2010.11.002
algorithmnumerical examplesquadricsarrangementintersection of surfacescurve parameterizationpencils of quadrics
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The computation of polynomial greatest common divisors over an algebraic number field
- On the computation of an arrangement of quadrics in 3D
- A sweep-plane algorithm for computing the volume of polyhedra represented in Boolean form
- Near-optimal parameterization of the intersection of quadrics. III. Parameterizing singular intersections
- Local box adjacency algorithms for cylindrical algebraic decompositions
- Computing GCDs of polynomials over algebraic number fields
- Exact computation of the medial axis of a polyhedron
- Exact, efficient, and complete arrangement computation for cubic curves
- An exact and efficient approach for computing a cell in an arrangement of quadrics
- Algorithms for Reporting and Counting Geometric Intersections
- Exact geometric-topological analysis of algebraic surfaces
- The Subresultant PRS Algorithm
- Quadratic interval refinement for real roots
- Intersecting quadrics
- An exact, complete and efficient implementation for computing planar maps of quadric intersection curves
- The design and implementation of panar maps in CGAL
- Algorithms – ESA 2005
- Computer Algebra in Scientific Computing
- Algorithms - ESA 2003
