Using interval arithmetic for determining the structure of convex hulls

DOI10.1023/B:NUMA.0000049470.99748.8DMaRDI QIDQ2387769zbMATH OpenOpenAlexFDO

Authors Stefanie Krivsky, Bruno Lang

Publication date 5 September 2005

Published in Numerical Algorithms (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1023/b:numa.0000049470.99748.8d

zbMATH Keywords

algorithmsconvex hullinterval arithmeticlinear systemsnumerical examplesverified computation

Mathematics Subject Classification ID

Numerical aspects of computer graphics, image analysis, and computational geometry (65D18) Algorithms with automatic result verification (65G20) Interval and finite arithmetic (65G30)

Recommendations

• EXACT AND OPTIMAL CONVEX HULLS IN 2D
• Computing convex hull in a floating point arithmetic
• A CONVEX HULL ALGORITHM FOR POINTS WITH APPROXIMATELY KNOWN POSITIONS
• COMPUTING CONVEX HULLS BY AUTOMATA ITERATION
• The quickhull algorithm for convex hulls

Cited in

(2)

• Computing Two-Dimensional Integer Hulls
• Convex Polyhedral Enclosures of Interval-Based Hierarchical Object Representations

This page was built for publication: Using interval arithmetic for determining the structure of convex hulls

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