Algorithmica

, Volume 10, Issue 6, pp 457–472 | Cite as

Numerical stability of a convex hull algorithm for simple polygons

  • J. W. Jaromczyk
  • G. W. Wasilkowski
Article

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(ε)).

Key words

Convex hull Simple polygon Floating-point arithmetic Robust implementation 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [1]
    B. K. Bhattacharya and H. ElGindy, A new linear convex hull algorithm for simple polygon,IEEE Transactions on Information Theory,30, 85–88, 1984.Google Scholar
  2. [2]
    H. Edelsbrunner,Algorithms in Combinatorial Geometry, Springer-Verlag, New York, 1987.Google Scholar
  3. [3]
    S. Fortune, Stable maintenance of point-set triangulations in two dimension,Proceedings of the 27th IEEE Symposium on Foundations of Computer Science, pp. 494–499, 1989.Google Scholar
  4. [4]
    R. L. Graham, An efficient algorithm for determining the convex hull of a finite planar set,Information Processing Letters,1, 132–133, 1972.Google Scholar
  5. [5]
    R. L. Graham and F. F. Yao, Finding the convex hull of a simple polygon,Journal of Algorithms,4(4), 324–331, 1983.Google Scholar
  6. [6]
    L. Guibas, D. Salesin, and J. Stolfi, Epsilon geometry: building robust algorithms from imprecise computations,Proceedings of the 5th Annual ACM Symposium on Computational Geometry, pp. 208–217, 1989.Google Scholar
  7. [7]
    L. Guibas, D. Salesin, and J. Stolfi, Constructing strongly convex approximate hulls with inaccurate primitives,Proceedings of the International Symposium SIGAL '90, Lecture Notes in Computer Science, Vol. 450, Springer-Verlag, Berlin, pp. 261–270, 1990.Google Scholar
  8. [8]
    D. T. Lee, On finding the convex hull of a simple polygon,International Journal on Computing and Information Sciences,12(2), 87–98, 1983.Google Scholar
  9. [9]
    Z. Li and V. Milenkovic, Constructing strongly convex hulls using exact and rounded arithmetic,Proceedings of the 6th Annual ACM Symposium on Computational Geometry, pp. 235–245, 1990.Google Scholar
  10. [10]
    D. McCallum and D. Avis, A linear time algorithm for finding the convex hull of a simple polygon,Information Processing Letters,9, 201–206, 1979.Google Scholar
  11. [11]
    A. A. Melkman, On line construction of the convex hull of a simple polyline,Information Processing Letters,25, 11–12, 1987.Google Scholar
  12. [12]
    F. Preparata and M. I. Shamos,Computational Geometry: An Introduction, Springer-Verlag, New York, 1985.Google Scholar
  13. [13]
    S. Y. Shin and T. C. Woo, Finding the convex hull of a simple polygon in linear time,Pattern Recognition,13, 453–458, 1986.MathSciNetGoogle Scholar
  14. [14]
    G. T. Toussaint, A counter-example to a convex hull algorithm for polygons,Pattern Recognition,24, 183–184, 1991.Google Scholar

Copyright information

© Springer-Verlag New York Inc. 1993

Authors and Affiliations

  • J. W. Jaromczyk
    • 1
  • G. W. Wasilkowski
    • 1
  1. 1.Department of Computer ScienceUniversity of KentuckyLexingtonUSA

Personalised recommendations