Floating-point arithmetic for computational geometry problems with uncertain data
From MaRDI portal
(Redirected from Publication:3401892)
Recommendations
Cites work
- A new approach to the surface intersection problem
- Accuracy and semantics in shape-interrogation applications
- An efficient algorithm for determining the convex hull of a finite planar set
- Computing convex hull in a floating point arithmetic
- Error Analysis for Operations in Solid Modeling in the Presence of Uncertainty
- scientific article; zbMATH DE number 1716506 (Why is no real title available?)
- scientific article; zbMATH DE number 54251 (Why is no real title available?)
- scientific article; zbMATH DE number 3408799 (Why is no real title available?)
- Linear perturbation methods for topologically consistent representations of free-form surface intersections
- NUMERICAL STABILITY OF ALGORITHMS FOR 2D DELAUNAY TRIANGULATIONS
- Selfintersection of composite curves and surfaces
Cited in
(9)- Computing convex hull in a floating point arithmetic
- Fast and accurate floating point summation with application to computational geometry
- Classroom examples of robustness problems in geometric computations
- Of What Use Is Floating-Point Arithmetic in Computational Geometry?
- Backward Error Analysis in Computational Geometry
- Reply to “Backward Error Analysis ...”
- Controlled Perturbation for Certified Geometric Computing with Fixed-Precision Arithmetic
- A Provably Robust Algorithm for Triangle-triangle Intersections in Floating-point Arithmetic
- Robustness of numerical methods in geometric computation when problem data is uncertain
This page was built for publication: Floating-point arithmetic for computational geometry problems with uncertain data
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3401892)