Numerical stability of a convex hull algorithm for simple polygons

DOI10.1007/BF01891832zbMath0783.68132OpenAlexW2020654524MaRDI QIDQ1310463

Grzegorz W. Wasilkowski, Jerzy W. Jaromczyk

Publication date: 6 January 1994

Published in: Algorithmica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01891832

zbMATH Keywords

convex hullfloating-point arithmeticrobust implementationsimple polygon

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Related Items (5)

Constructing strongly convex approximate hulls with inaccurate primitives ⋮ Computing convex hull in a floating point arithmetic ⋮ EXACT AND OPTIMAL CONVEX HULLS IN 2D ⋮ Why does information-based complexity use the real number model? ⋮ Exact computation of the sign of a finite sum

Cites Work

• Unnamed Item
• Unnamed Item
• Finding the convex hull of a simple polygon in linear time
• On-line construction of the convex hull of a simple polyline
• A linear algorithm for finding the convex hull of a simple polygon
• Constructing strongly convex approximate hulls with inaccurate primitives
• An efficient algorithm for determining the convex hull of a finite planar set
• A new linear convex hull algorithm for simple polygons (Corresp.)
• On finding the convex hull of a simple polygon
• Finding the convex hull of a simple polygon

This page was built for publication: Numerical stability of a convex hull algorithm for simple polygons