EXACT AND OPTIMAL CONVEX HULLS IN 2D

DOI10.1142/S0218195900000085zbMath1074.68649MaRDI QIDQ4682192

H. Ratschek, Jon G. Rokne

Publication date: 10 June 2005

Published in: International Journal of Computational Geometry & Applications (Search for Journal in Brave)

zbMATH Keywords

interval arithmeticConvex hullsexact computationsGraham scan

Mathematics Subject Classification ID

Software, source code, etc. for problems pertaining to convex and discrete geometry (52-04) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) General methods in interval analysis (65G40)

Cites Work

• An efficient and numerically correct algorithm for the 2D convex hull problem
• Another efficient algorithm for convex hulls in two dimensions
• A fast convex hull algorithm
• Exact computation of the sign of a finite sum
• Numerical stability of a convex hull algorithm for simple polygons
• Computing convex hull in a floating point arithmetic
• An efficient algorithm for determining the convex hull of a finite planar set

This page was built for publication: EXACT AND OPTIMAL CONVEX HULLS IN 2D