FLOATING-POINT ARITHMETIC FOR COMPUTATIONAL GEOMETRY PROBLEMS WITH UNCERTAIN DATA
From MaRDI portal
Publication:3401892
DOI10.1142/S0218195909003015zbMath1183.65020MaRDI QIDQ3401892
Publication date: 1 February 2010
Published in: International Journal of Computational Geometry & Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1142/s0218195909003015
algorithm; stability; uncertain data; computational geometry; solid modeling; floating-point arithmetic; backward error analysis; planar convex hull; robustness in geometric computation
65D18: Numerical aspects of computer graphics, image analysis, and computational geometry
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Computing convex hull in a floating point arithmetic
- A new approach to the surface intersection problem
- Selfintersection of composite curves and surfaces
- Linear perturbation methods for topologically consistent representations of free-form surface intersections
- An efficient algorithm for determining the convex hull of a finite planar set
- NUMERICAL STABILITY OF ALGORITHMS FOR 2D DELAUNAY TRIANGULATIONS
- Error Analysis for Operations in Solid Modeling in the Presence of Uncertainty
- Accuracy and semantics in shape-interrogation applications