Computing a 3-dimensional cell in an arrangement of quadrics
From MaRDI portal
Publication:5361588
DOI10.1145/378583.378689zbMath1375.68137OpenAlexW2011974560MaRDI QIDQ5361588
Nicola Geismann, Michael Hemmer, Elmar Schömer
Publication date: 29 September 2017
Published in: Proceedings of the seventeenth annual symposium on Computational geometry (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/378583.378689
Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Computational aspects of algebraic curves (14Q05)
Related Items (8)
Boolean operations on 3D selective Nef complexes: data structure, algorithms, optimized implementation and experiments ⋮ Topological classification of the intersection curves of two quadrics using a set of discriminants ⋮ On the computation of an arrangement of quadrics in 3D ⋮ Tools for analyzing the intersection curve between two quadrics through projection and lifting ⋮ Intersecting quadrics: an efficient and exact implementation ⋮ A robust algorithm for finding the real intersections of three quadric surfaces ⋮ The predicates of the Apollonius diagram: algorithmic analysis and implementation ⋮ An exact and efficient approach for computing a cell in an arrangement of quadrics
This page was built for publication: Computing a 3-dimensional cell in an arrangement of quadrics
