An exact and efficient approach for computing a cell in an arrangement of quadrics
From MaRDI portal
Publication:2575587
The method for computing the mathematical correct topology of a 3-dimensional connected region (cell) in an arrangement of quadrics surfaces is presented in the article. The suggested method uses exact algebraic computation and provides the correct mathematical result in every case, even in a degenerated one. The solution is based on transformation of the spatial problem to the planar one by projection. For each quadric surface of arrangement, all its intersection curves with the other quadrics as well as its silhouette are projected into the plane. The main contribution of the suggested method is the determination of all event points in resulting planar arrangement, including tangential intersections and singular points. The determination of nonsingular tangential intersection by introducing an auxiliary curve (so called Jacobi curve) is described, too. Results obtained in this work can be useful in many areas of computer science.
Recommendations
- Computing a 3-dimensional cell in an arrangement of quadrics: exactly and actually!
- On the computation of an arrangement of quadrics in 3D
- Complete, Exact and Efficient Implementation for Computing the Adjacency Graph of an Arrangement of Quadrics
- A complete, exact and efficient implementation for computing the edge-adjacency graph of an arrangement 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
Cites work
- A fast planar partition algorithm, II
- A parametric algorithm for drawing pictures of solid objects composed of quadric surfaces
- A polynomial-time algorithm for the topological type of real algebraic curve
- A singly exponential stratification scheme for real semi-algebraic varieties and its applications
- Algebraic decomposition of regular curves
- Algebraic methods and arithmetic filtering for exact predicates on circle arcs
- Algorithms for Reporting and Counting Geometric Intersections
- Algorithms – ESA 2004
- An adjacency algorithm for cylindrical algebraic decompositions of three- dimensional space
- An exact, complete and efficient implementation for computing planar maps of quadric intersection curves: exploiting a little more geometry and a little less algebra
- An Output-Sensitive Convex Hull Algorithm for Planar Objects
- Automatic parsing of degenerate quadric-surface intersections
- Complete, exact, and efficient computations with cubic curves
- Computational geometry in a curved world
- Computing a 3-dimensional cell in an arrangement of quadrics: exactly and actually!
- Convex hulls of objects bounded by algebraic curves
- Cylindrical Algebraic Decomposition I: The Basic Algorithm
- scientific article; zbMATH DE number 3846864 (Why is no real title available?)
- scientific article; zbMATH DE number 43279 (Why is no real title available?)
- scientific article; zbMATH DE number 66691 (Why is no real title available?)
- scientific article; zbMATH DE number 108109 (Why is no real title available?)
- scientific article; zbMATH DE number 177885 (Why is no real title available?)
- scientific article; zbMATH DE number 3497890 (Why is no real title available?)
- scientific article; zbMATH DE number 1947391 (Why is no real title available?)
- scientific article; zbMATH DE number 1947448 (Why is no real title available?)
- scientific article; zbMATH DE number 1368469 (Why is no real title available?)
- scientific article; zbMATH DE number 802334 (Why is no real title available?)
- scientific article; zbMATH DE number 1424290 (Why is no real title available?)
- scientific article; zbMATH DE number 1446863 (Why is no real title available?)
- scientific article; zbMATH DE number 3068536 (Why is no real title available?)
- Intersecting quadrics
- Jacobi curves: computing the exact topology of arrangements of non-singular algebraic curves
- Modern computer algebra
- Near-optimal parameterization of the intersection of quadrics
- On Approximations and Incidence in Cylindrical Algebraic Decompositions
- On Euclid's Algorithm and the Theory of Subresultants
- On the computation of an arrangement of quadrics in 3D
- Reporting curve segment intersections using restricted predicates
- Resultants and Chow forms via exterior syzygies
- Robust Plane Sweep for Intersecting Segments
- Singular points of algebraic curves
- The topological configuration of a real algebraic curve
- Towards and open curved kernel
- Using multivariate resultants to find the intersection of three quadric surfaces
- Vertical decomposition of a single cell in a three-dimensional arrangement of surfaces
Cited in
(19)- The Voronoi diagram of three lines
- Tools for analyzing the intersection curve between two quadrics through projection and lifting
- Exact, efficient, and complete arrangement computation for cubic curves
- scientific article; zbMATH DE number 5131003 (Why is no real title available?)
- AN APPROXIMATE ARRANGEMENT ALGORITHM FOR SEMI-ALGEBRAIC CURVES
- Complete, Exact and Efficient Implementation for Computing the Adjacency Graph of an Arrangement of Quadrics
- Finding the topology of implicitly defined two algebraic plane curves
- Computing a 3-dimensional cell in an arrangement of quadrics: exactly and actually!
- An exact, complete and efficient implementation for computing planar maps of quadric intersection curves: exploiting a little more geometry and a little less algebra
- Adaptive isotopic approximation of nonsingular curves: The parameterizability and nonlocal isotopy approach
- Triangulations of Line Segment Sets in the Plane
- Topological classification of the intersection curves of two quadrics using a set of discriminants
- Arrangements on parametric surfaces. II: Concretizations and applications
- A complete, exact and efficient implementation for computing the edge-adjacency graph of an arrangement of quadrics
- On the optimality of the ideal right-angled 24-cell
- Topologically correct intersection curves of two trimmed quadrics with tolerance control
- On the computation of an arrangement of quadrics in 3D
- Tools for analyzing the intersection curve between a torus and a quadric through projection and lifting
- Near-optimal parameterization of the intersection of quadrics. I. The generic algorithm
This page was built for publication: An exact and efficient approach for computing a cell in an arrangement of quadrics
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2575587)
