ISSN:
1432-0541
Keywords:
Convex hull
;
Simple polygon
;
Floating-point arithmetic
;
Robust implementation
Source:
Springer Online Journal Archives 1860-2000
Topics:
Computer Science
,
Mathematics
Notes:
Abstract A numerically stable and optimalO(n)-time implementation of an algorithm for finding the convex hull of a simple polygon is presented. Stability is understood in the sense of a backward error analysis. A concept of the condition number of simple polygons and its impact on the performance of the algorithm is discussed. It is shown that if the condition number does not exceed (1+O(ε))/(3ε), then, in floating-point arithmetic with the unit roundoffε, the algorithm produces the vertices of a convex hull for slightly perturbed input points. The relative perturbation does not exceed 3ε(1+O(ε)).
Type of Medium:
Electronic Resource
URL:
http://dx.doi.org/10.1007/BF01891832
Permalink