Reliable and Efficient Geometric Computing
From MaRDI portal
Recommendations
- Reliable and Efficient Computational Geometry Via Controlled Perturbation
- Controlled Perturbation for Certified Geometric Computing with Fixed-Precision Arithmetic
- Reliable geometric computing
- Controlled perturbation for Delaunay triangulations
- A general approach to the analysis of controlled perturbation algorithms
Cited in
(18)- Topological sweep of the complete graph
- An axiomatic approach to robust geometric programs
- Efficient perturbations for handling geometric degeneracies
- The nature and meaning of perturbations in geometric computing
- Realistic input models for geometric algorithms
- Controlled perturbation for Delaunay triangulations
- Degree-driven design for correct geometric algorithms
- Reliable and Efficient Computational Geometry Via Controlled Perturbation
- scientific article; zbMATH DE number 1206058 (Why is no real title available?)
- scientific article; zbMATH DE number 1003230 (Why is no real title available?)
- scientific article; zbMATH DE number 1008329 (Why is no real title available?)
- scientific article; zbMATH DE number 1182928 (Why is no real title available?)
- EXACT GEOMETRIC COMPUTATION USING CASCADING
- Numerical Software with Result Verification
- Reliable geometric computing
- Reliable and Efficient Geometric Computing
- Reliable and efficient geometric computing
- A general approach to the analysis of controlled perturbation algorithms
This page was built for publication: Reliable and Efficient Geometric Computing
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3434535)
