Intersecting quadrics: an efficient and exact implementation
From MaRDI portal
Publication:2507161
DOI10.1016/J.COMGEO.2005.10.004zbMATH Open1103.65021OpenAlexW2210410641MaRDI QIDQ2507161FDOQ2507161
Luis Peñaranda, Sylvain Petitjean, Sylvain Lazard
Publication date: 10 October 2006
Published in: Computational Geometry (Search for Journal in Brave)
Full work available at URL: https://hal.inria.fr/inria-00104003/file/SoCG_final.pdf
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Efficient isolation of polynomial's real roots.
- Computing quadric surface intersections based on an analysis of plane cubic curves
- ON THE DISTANCE BETWEEN ROOTS OF INTEGER POLYNOMIALS
- The computational geometry algorithms library CGAL
- Simultaneous block diagonalization of two real symmetric matrices
- Enhancing Levin's method for computing quadric-surface intersections
- A parametric algorithm for drawing pictures of solid objects composed of quadric surfaces
- Quadric-surface intersection curves: Shape and structure
- Automatic parsing of degenerate quadric-surface intersections
- Near-optimal parameterization of the intersection of quadrics
- An exact, complete and efficient implementation for computing planar maps of quadric intersection curves
- On the computation of an arrangement of quadrics in 3D
- Computing a 3-dimensional cell in an arrangement of quadrics
Cited In (11)
- Enumerating the morphologies of non-degenerate Darboux cyclides
- Intersecting quadrics
- Computing the Voronoi cells of planes, spheres and cylinders in \(\mathbb{R}^3\)
- A complete, exact and efficient implementation for computing the edge-adjacency graph of an arrangement of quadrics
- New properties about the intersection of rotational quadratic surfaces and their applications in architecture
- Topological classification of the intersection curves of two quadrics using a set of discriminants
- Tools for analyzing the intersection curve between two quadrics through projection and lifting
- Computing the intersections of three conics according to their Jacobian curve
- 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
Uses Software
Recommendations
- A complete and efficient algorithm for the intersection of a general and a convex polyhedron 👍 👎
- Enhancing Levin's method for computing quadric-surface intersections 👍 👎
- Near-optimal parameterization of the intersection of quadrics. I. The generic algorithm 👍 👎
- Near-optimal parameterization of the intersection of quadrics. III. Parameterizing singular intersections 👍 👎
- Near-optimal parameterization of the intersection of quadrics 👍 👎
- Intersecting quadrics 👍 👎
- An exact, complete and efficient implementation for computing planar maps of quadric intersection curves 👍 👎
- A robust algorithm for finding the real intersections of three quadric surfaces 👍 👎
This page was built for publication: Intersecting quadrics: an efficient and exact implementation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2507161)
