Intersecting quadrics: an efficient and exact implementation
From MaRDI portal
Publication:2507161
Recommendations
- Intersecting quadrics
- 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
Cites work
- A parametric algorithm for drawing pictures of solid objects composed of quadric surfaces
- An exact, complete and efficient implementation for computing planar maps of quadric intersection curves: exploiting a little more geometry and a little less algebra
- Automatic parsing of degenerate quadric-surface intersections
- Computing a 3-dimensional cell in an arrangement of quadrics: exactly and actually!
- Computing quadric surface intersections based on an analysis of plane cubic curves
- Efficient isolation of polynomial's real roots.
- Enhancing Levin's method for computing quadric-surface intersections
- scientific article; zbMATH DE number 621810 (Why is no real title available?)
- scientific article; zbMATH DE number 802334 (Why is no real title available?)
- scientific article; zbMATH DE number 3409447 (Why is no real title available?)
- Near-optimal parameterization of the intersection of quadrics
- On the computation of an arrangement of quadrics in 3D
- ON THE DISTANCE BETWEEN ROOTS OF INTEGER POLYNOMIALS
- Quadric-surface intersection curves: Shape and structure
- Simultaneous block diagonalization of two real symmetric matrices
- The computational geometry algorithms library CGAL
Cited in
(15)- Enumerating the morphologies of non-degenerate Darboux cyclides
- Tools for analyzing the intersection curve between two quadrics through projection and lifting
- New properties about the intersection of rotational quadratic surfaces and their applications in architecture
- Computing the intersections of three conics according to their Jacobian curve
- Near-optimal parameterization of the intersection of quadrics
- Intersecting 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
- Topological classification of the intersection curves of two quadrics using a set of discriminants
- 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
- Topologically correct intersection curves of two trimmed quadrics with tolerance control
- On arrangements of quadrics in decomposing the parameter space of 3D digitized rigid motions
- 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
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)
