Much Ado about Zero

DOI10.1007/978-3-642-03456-5_27zbMath1258.68177OpenAlexW2161041230MaRDI QIDQ3644735

Stefan Schirra

Publication date: 12 November 2009

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-03456-5_27

zbMATH Keywords

exact geometric computation paradigmreal algebraic number computationzero separation bound

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Numerical aspects of computer graphics, image analysis, and computational geometry (65D18)

Related Items (1)

On design and implementation of a generic number type for real algebraic number computations based on expression dags

Uses Software

• LEDA
• LOOK

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Towards exact geometric computation
• Constructive root bound for \(k\)-ary rational input numbers
• Constructing roadmaps of semi-algebraic sets. I: Completeness
• Adaptive precision floating-point arithmetic and fast robust geometric predicates
• LOOK: A lazy object-oriented kernel design for geometric computation
• A strong and easily computable separation bound for arithmetic expressions involving radicals
• Classroom examples of robustness problems in geometric computations
• When Close Enough is Close Enough
• Fast Probabilistic Algorithms for Verification of Polynomial Identities
• Identification of algebraic numbers

This page was built for publication: Much Ado about Zero