Computing convex hull in a floating point arithmetic

DOI10.1016/0925-7721(94)00017-4zbMath0809.65148OpenAlexW2082233487MaRDI QIDQ1337401

Grzegorz W. Wasilkowski, Jerzy W. Jaromczyk

Publication date: 30 November 1994

Published in: Computational Geometry (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0925-7721(94)00017-4

zbMATH Keywords

convex hullsfloating point algorithmalgorithm \({\mathbf{Convex}}\)

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Numerical aspects of computer graphics, image analysis, and computational geometry (65D18) Convex sets in (2) dimensions (including convex curves) (52A10)

Related Items (7)

Voronoi Diagram and Delaunay Triangulation with Independent and Dependent Geometric Uncertainties ⋮ Euclidean minimum spanning trees with independent and dependent geometric uncertainties ⋮ Classroom examples of robustness problems in geometric computations ⋮ EXACT AND OPTIMAL CONVEX HULLS IN 2D ⋮ FLOATING-POINT ARITHMETIC FOR COMPUTATIONAL GEOMETRY PROBLEMS WITH UNCERTAIN DATA ⋮ Why does information-based complexity use the real number model? ⋮ Exact computation of the sign of a finite sum

Cites Work

• Numerical stability of a convex hull algorithm for simple polygons
• Unnamed Item
• Unnamed Item

This page was built for publication: Computing convex hull in a floating point arithmetic