An exact, complete and efficient implementation for computing planar maps of quadric intersection curves
From MaRDI portal
Publication:5370601
DOI10.1145/1064092.1064110zbMath1387.68237OpenAlexW2086644813MaRDI QIDQ5370601
Eric Berberich, Michael Hemmer, Elmar Schömer, Lutz Kettner, 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
arrangementsrobustnessalgebraic surfacesalgebraic curvescomputational geometryexact geometric computation
Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Computational aspects of algebraic curves (14Q05)
Related Items
Advanced programming techniques applied to CGAL's arrangement package ⋮ Boolean operations on 3D selective Nef complexes: data structure, algorithms, optimized implementation and experiments ⋮ Using signature sequences to classify intersection curves of two 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\) ⋮ Arrangements on parametric surfaces. I: General framework and infrastructure ⋮ Arrangements on parametric surfaces. II: Concretizations and applications ⋮ 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 ⋮ Design of the CGAL 3D spherical kernel and application to arrangements of circles on a sphere ⋮ Near-optimal parameterization of the intersection of quadrics. I. The generic algorithm ⋮ Tools for analyzing the intersection curve between two quadrics through projection and lifting ⋮ Intersecting quadrics: an efficient and exact implementation ⋮ The Voronoi diagram of three lines ⋮ 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
Uses Software
