Fast and accurate intersections on a sphere
From MaRDI portal
Cites work
- A floating-point technique for extending the available precision
- Accuracy and Stability of Numerical Algorithms
- Accurate calculation of Euclidean norms using double-word arithmetic
- Accurate Floating-Point Product and Exponentiation
- Accurate Sum and Dot Product
- Adaptive precision floating-point arithmetic and fast robust geometric predicates
- Arrangements on parametric surfaces. II: Concretizations and applications
- Conservative interpolation between unstructured meshes via supermesh construction
- Efficient calculations of faithfully rounded l₂-norms of n-vectors
- Fast and accurate computation of the Euclidean norm of a vector
- Further analysis of Kahan's algorithm for the accurate computation of \(2\times 2\) determinants
- Handbook of floating-point arithmetic
- scientific article; zbMATH DE number 1178976 (Why is no real title available?)
- scientific article; zbMATH DE number 2079354 (Why is no real title available?)
- Inaccuracy in quasi-Newton methods: Local improvement theorems
- MPFR
- Simulation of simplicity: a technique to cope with degenerate cases in geometric algorithms
This page was built for publication: Fast and accurate intersections on a sphere
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7228462)