FLOATING-POINT ARITHMETIC FOR COMPUTATIONAL GEOMETRY PROBLEMS WITH UNCERTAIN DATA

DOI10.1142/S0218195909003015zbMath1183.65020OpenAlexW2149041248MaRDI QIDQ3401892

N. F. Stewart, Di Jiang

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

zbMATH Keywords

algorithmstabilityuncertain datacomputational geometrysolid modelingfloating-point arithmeticbackward error analysisplanar convex hullrobustness in geometric computation

Mathematics Subject Classification ID

Numerical aspects of computer graphics, image analysis, and computational geometry (65D18)

Cites Work

• 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
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: FLOATING-POINT ARITHMETIC FOR COMPUTATIONAL GEOMETRY PROBLEMS WITH UNCERTAIN DATA