Computing convex hull in a floating point arithmetic
From MaRDI portal
Publication:1337401
DOI10.1016/0925-7721(94)00017-4zbMath0809.65148MaRDI 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
68U05: Computer graphics; computational geometry (digital and algorithmic aspects)
65D18: Numerical aspects of computer graphics, image analysis, and computational geometry
52A10: Convex sets in (2) dimensions (including convex curves)
Related Items
EXACT AND OPTIMAL CONVEX HULLS IN 2D, Voronoi Diagram and Delaunay Triangulation with Independent and Dependent Geometric Uncertainties, Why does information-based complexity use the real number model?, Exact computation of the sign of a finite sum, Euclidean minimum spanning trees with independent and dependent geometric uncertainties, Classroom examples of robustness problems in geometric computations, FLOATING-POINT ARITHMETIC FOR COMPUTATIONAL GEOMETRY PROBLEMS WITH UNCERTAIN DATA
Cites Work