Another Classroom Example of Robustness Problems in Planar Convex Hull Computation

DOI10.1007/978-3-319-32859-1_38zbMATH Open1462.65028OpenAlexW2460762125MaRDI QIDQ2807866FDOQ2807866

Authors: Marc Mörig 

Publication date: 25 May 2016

Published in: Mathematical Aspects of Computer and Information Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-32859-1_38

Recommendations

• Classroom examples of robustness problems in geometric computations
• Algorithms – ESA 2004
• Computing \(D\)-convex hulls in the plane
• Convex Decomposition of Polyhedra and Robustness
• scientific article; zbMATH DE number 4051000
• Publication:4733405
• A new algorithm for computing the convex hull of a planar point set
• A paradigm for robust geometric algorithms
• An Output-Sensitive Convex Hull Algorithm for Planar Objects
• Robustness of \(k\)-gon Voronoi diagram construction

zbMATH Keywords

implementationnumerical robustness problemsfloating-point geometry

Mathematics Subject Classification ID

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

Cited In (3)

• Reply to “Backward Error Analysis ...”
• Classroom examples of robustness problems in geometric computations
• Algorithms – ESA 2004

This page was built for publication: Another Classroom Example of Robustness Problems in Planar Convex Hull Computation

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2807866)