Controlled Perturbation for Certified Geometric Computing with Fixed-Precision Arithmetic
From MaRDI portal
Recommendations
- Reliable and Efficient Computational Geometry Via Controlled Perturbation
- Verifiable implementations of geometric algorithms using finite precision arithmetic
- Floating-point arithmetic for computational geometry problems with uncertain data
- scientific article; zbMATH DE number 1008329
- Adaptive precision floating-point arithmetic and fast robust geometric predicates
- Towards exact geometric computation
- Formally certified floating-point filters for homogeneous geometric predicates
- scientific article; zbMATH DE number 1424302
- Robust and error-free geometric computing
- The nature and meaning of perturbations in geometric computing
Cited in
(9)- The nature and meaning of perturbations in geometric computing
- Controlled perturbation for Delaunay triangulations
- Reliable and Efficient Geometric Computing
- A probabilistic approach to reducing algebraic complexity of Delaunay triangulations
- Efficient Predicate Evaluation Using Randomized Degeneracy Detection
- Table based detection of degenerate predicates in free space construction
- Fast detection of degenerate predicates in free space construction
- Controlled perturbation of sets of line segments in \(\mathbb R^2\) with smart processing order
- A general approach to the analysis of controlled perturbation algorithms
This page was built for publication: Controlled Perturbation for Certified Geometric Computing with Fixed-Precision Arithmetic
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5747867)