Robustness of numerical methods in geometric computation when problem data is uncertain
DOI10.1016/0010-4485(93)90070-5zbMATH Open0779.65097OpenAlexW2006234597MaRDI QIDQ687967FDOQ687967
Authors: H. Desaulniers, N. F. Stewart 
Publication date: 19 January 1994
Published in: CAD. Computer-Aided Design (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0010-4485(93)90070-5
Recommendations
robustnessgeometric computationbackward error analysisuncertain datafloating-point arithmeticround-off errorstolerances
Roundoff error (65G50) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Numerical aspects of computer graphics, image analysis, and computational geometry (65D18)
Cited In (12)
- Applications of unbiased perturbations towards quantifying robustness with pragmatic geometric methods
- Largest and smallest convex hulls for imprecise points
- On the reliability of error indication methods for problems with uncertain data
- Computability of partial Delaunay triangulation and Voronoi diagram (extended abstract)
- The influence of interval arithmetic on the shape of uncertainly defined domains modelled by closed curves
- Existence and computation of tours through imprecise points
- Approximating largest convex hulls for imprecise points
- Algorithms – ESA 2004
- Robustness and Randomness
- Foundation of a computable solid modelling.
- Title not available (Why is that?)
- Backward Error Analysis in Computational Geometry
This page was built for publication: Robustness of numerical methods in geometric computation when problem data is uncertain
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q687967)
