An exact and efficient approach for computing a cell in an arrangement of quadrics
DOI10.22028/D291-25753zbMATH Open1090.65028OpenAlexW2104167753MaRDI QIDQ2575587FDOQ2575587
Publication date: 5 December 2005
Published in: Computational Geometry (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.comgeo.2004.02.007
computational geometryalgebraic geometrytangential intersectionintersectionquadric surfaceJacobi curveSolid modelling
Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Numerical aspects of computer graphics, image analysis, and computational geometry (65D18)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Resultants and Chow forms via exterior syzygies
- Algorithms for Reporting and Counting Geometric Intersections
- Modern computer algebra
- On Euclid's Algorithm and the Theory of Subresultants
- Singular points of algebraic curves
- An Output-Sensitive Convex Hull Algorithm for Planar Objects
- A polynomial-time algorithm for the topological type of real algebraic curve
- Algebraic decomposition of regular curves
- The topological configuration of a real algebraic curve
- Cylindrical Algebraic Decomposition I: The Basic Algorithm
- Computational geometry in a curved world
- Algorithms - ESA 2003
- A parametric algorithm for drawing pictures of solid objects composed of quadric surfaces
- Complete, exact, and efficient computations with cubic curves
- Automatic parsing of degenerate quadric-surface 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
- Algorithms – ESA 2004
- On the computation of an arrangement of quadrics in 3D
- Towards and open curved kernel
- Convex hulls of objects bounded by algebraic curves
- An adjacency algorithm for cylindrical algebraic decompositions of three- dimensional space
- A singly exponential stratification scheme for real semi-algebraic varieties and its applications
- Computing a 3-dimensional cell in an arrangement of quadrics
- On Approximations and Incidence in Cylindrical Algebraic Decompositions
- Robust Plane Sweep for Intersecting Segments
- Vertical decomposition of a single cell in a three-dimensional arrangement of surfaces
- A fast planar partition algorithm, II
- Using multivariate resultants to find the intersection of three quadric surfaces
- Reporting curve segment intersections using restricted predicates
- Algebraic methods and arithmetic filtering for exact predicates on circle arcs
Cited In (12)
- Title not available (Why is that?)
- On the optimality of the ideal right-angled 24-cell
- Exact, efficient, and complete arrangement computation for cubic curves
- Triangulations of Line Segment Sets in the Plane
- The Voronoi diagram of three lines
- Finding the topology of implicitly defined two algebraic plane curves
- A complete, exact and efficient implementation for computing the edge-adjacency graph of an arrangement of quadrics
- 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
- AN APPROXIMATE ARRANGEMENT ALGORITHM FOR SEMI-ALGEBRAIC CURVES
- Adaptive isotopic approximation of nonsingular curves: The parameterizability and nonlocal isotopy approach
- Near-optimal parameterization of the intersection of quadrics. I. The generic algorithm
Uses Software
Recommendations
- Computing a 3-dimensional cell in an arrangement of quadrics 👍 👎
- 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 👍 👎
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)