An exact, complete and efficient implementation for computing planar maps of quadric intersection curves: exploiting a little more geometry and a little less algebra
DOI10.1145/1064092.1064110zbMATH Open1387.68237OpenAlexW2086644813MaRDI QIDQ5370601FDOQ5370601
Authors: Eric Berberich, Michael Hemmer, Lutz Kettner, Elmar Schömer, Nicola Wolpert 
Publication date: 20 October 2017
Published in: Proceedings of the twenty-first annual symposium on Computational geometry (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/1064092.1064110
Recommendations
- A complete, exact and efficient implementation for computing the edge-adjacency graph of an arrangement of quadrics
- Intersecting quadrics: an efficient and exact implementation
- Intersecting quadrics
- Complete, Exact and Efficient Implementation for Computing the Adjacency Graph of an Arrangement of Quadrics
- An exact and efficient approach for computing a cell in an arrangement of quadrics
arrangementsrobustnesscomputational geometryalgebraic surfacesalgebraic curvesexact geometric computation
Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Computational aspects of algebraic curves (14Q05)
Cited In (19)
- Boolean operations on 3D selective Nef complexes: data structure, algorithms, optimized implementation and experiments
- An efficient algorithm for the stratification and triangulation of an algebraic surface
- An exact and efficient approach for computing a cell in an arrangement of quadrics
- Intersecting quadrics: an efficient and exact implementation
- Complete, Exact and Efficient Implementation for Computing the Adjacency Graph of an Arrangement of Quadrics
- Intersecting quadrics
- A generic and flexible framework for the geometrical and topological analysis of (algebraic) surfaces
- Computing the Voronoi cells of planes, spheres and cylinders in \(\mathbb{R}^3\)
- The Voronoi diagram of three lines
- 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
- Topological classification of the intersection curves of two quadrics using a set of discriminants
- Arrangements on parametric surfaces. I: General framework and infrastructure
- The design and implementation of panar maps in CGAL
- Tools for analyzing the intersection curve between two quadrics through projection and lifting
- Design of the CGAL 3D spherical kernel and application to arrangements of circles on a sphere
- Using signature sequences to classify intersection curves of two quadrics
- Near-optimal parameterization of the intersection of quadrics. I. The generic algorithm
- Advanced programming techniques applied to CGAL's arrangement package
Uses Software
This page was built for publication: An exact, complete and efficient implementation for computing planar maps of quadric intersection curves: exploiting a little more geometry and a little less algebra
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5370601)
