Computing convex hull in a floating point arithmetic

DOI10.1016/0925-7721(94)00017-4zbMATH Open0809.65148OpenAlexW2082233487MaRDI QIDQ1337401FDOQ1337401

Authors: Jerzy W. Jaromczyk, Grzegorz W. Wasilkowski 

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

Recommendations

• The quickhull algorithm for convex hulls
• Floating-point arithmetic for computational geometry problems with uncertain data
• An efficient and numerically correct algorithm for the 2D convex hull problem
• A CONVEX HULL ALGORITHM FOR POINTS WITH APPROXIMATELY KNOWN POSITIONS

zbMATH Keywords

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

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Numerical stability of a convex hull algorithm for simple polygons

Cited In (17)

• Euclidean minimum spanning trees with independent and dependent geometric uncertainties
• Fast and accurate floating point summation with application to computational geometry
• Error control in polytope computations
• Robust gift wrapping for the three-dimensional convex hull
• Constructing strongly convex hulls using exact or rounded arithmetic
• A Provably Robust Algorithm for Triangle-triangle Intersections in Floating-point Arithmetic
• Numerical stability of a convex hull algorithm for simple polygons
• Exact computation of the sign of a finite sum
• Computing Two-Dimensional Integer Hulls
• Floating-point arithmetic for computational geometry problems with uncertain data
• A CONVEX HULL ALGORITHM FOR POINTS WITH APPROXIMATELY KNOWN POSITIONS
• EXACT AND OPTIMAL CONVEX HULLS IN 2D
• Using interval arithmetic for determining the structure of convex hulls
• Classroom examples of robustness problems in geometric computations
• Construction of the convex hull of a finite set of points when the computations are approximate
• Voronoi Diagram and Delaunay Triangulation with Independent and Dependent Geometric Uncertainties
• Why does information-based complexity use the real number model?

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

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