Of What Use Is Floating-Point Arithmetic in Computational Geometry?
From MaRDI portal
Publication:3644731
DOI10.1007/978-3-642-03456-5_23zbMath1258.68172OpenAlexW1516628198MaRDI QIDQ3644731
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_23
Related Items (2)
On the complexity of the Plantinga-Vegter algorithm ⋮ T-count optimized quantum circuit for floating point addition and multiplication
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Verifiable implementations of geometric algorithms using finite precision arithmetic
- A perturbation scheme for spherical arrangements with application to molecular modeling
- Vertex-rounding a three-dimensional polyhedral subdivision
- Classroom examples of robustness problems in geometric computations
- Reliable and Efficient Computational Geometry Via Controlled Perturbation
- Interval arithmetic yields efficient dynamic filters for computational geometry
This page was built for publication: Of What Use Is Floating-Point Arithmetic in Computational Geometry?