An exact and efficient approach for computing a cell in an arrangement of quadrics
From MaRDI portal
Publication:2575587
DOI10.1016/j.comgeo.2004.02.007zbMath1090.65028OpenAlexW2104167753MaRDI QIDQ2575587
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 geometryintersectiontangential intersectionquadric surfaceJacobi curveSolid modelling
Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Numerical aspects of computer graphics, image analysis, and computational geometry (65D18)
Related Items
AN APPROXIMATE ARRANGEMENT ALGORITHM FOR SEMI-ALGEBRAIC CURVES, Topological classification of the intersection curves of two quadrics using a set of discriminants, A complete, exact and efficient implementation for computing the edge-adjacency graph of an arrangement of quadrics, Finding the topology of implicitly defined two algebraic plane curves, Near-optimal parameterization of the intersection of quadrics. I. The generic algorithm, Adaptive isotopic approximation of nonsingular curves: The parameterizability and nonlocal isotopy approach, Tools for analyzing the intersection curve between two quadrics through projection and lifting, Exact, efficient, and complete arrangement computation for cubic curves, Triangulations of Line Segment Sets in the Plane, The Voronoi diagram of three lines
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the computation of an arrangement of quadrics in 3D
- Convex hulls of objects bounded by algebraic curves
- Computational geometry in a curved world
- Singular points of algebraic curves
- An adjacency algorithm for cylindrical algebraic decompositions of three- dimensional space
- A polynomial-time algorithm for the topological type of real algebraic curve
- Algebraic decomposition of regular curves
- A singly exponential stratification scheme for real semi-algebraic varieties and its applications
- Vertical decomposition of a single cell in a three-dimensional arrangement of surfaces
- Reporting curve segment intersections using restricted predicates
- Algorithms for Reporting and Counting Geometric Intersections
- The topological configuration of a real algebraic curve
- On Approximations and Incidence in Cylindrical Algebraic Decompositions
- Using multivariate resultants to find the intersection of three quadric surfaces
- Automatic parsing of degenerate quadric-surface intersections
- A parametric algorithm for drawing pictures of solid objects composed of quadric surfaces
- A fast planar partition algorithm, II
- An Output-Sensitive Convex Hull Algorithm for Planar Objects
- Resultants and Chow forms via exterior syzygies
- Robust Plane Sweep for Intersecting Segments
- Cylindrical Algebraic Decomposition I: The Basic Algorithm
- Algebraic methods and arithmetic filtering for exact predicates on circle arcs
- Computing a 3-dimensional cell in an arrangement of quadrics
- Near-optimal parameterization of the intersection of quadrics
- Complete, exact, and efficient computations with cubic curves
- Intersecting quadrics
- Towards and open curved kernel
- An exact, complete and efficient implementation for computing planar maps of quadric intersection curves
- Algorithms – ESA 2004
- On Euclid's Algorithm and the Theory of Subresultants
- Algorithms - ESA 2003
