Numerical stability of a convex hull algorithm for simple polygons

@article{Jaromczyk1993NumericalSO,
  title={Numerical stability of a convex hull algorithm for simple polygons},
  author={Jerzy W. Jaromczyk and Grzegorz W. Wasilkowski},
  journal={Algorithmica},
  year={1993},
  volume={10},
  pages={457-472}
}
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… CONTINUE READING

From This Paper

Figures, tables, and topics from this paper.

Citations

Publications citing this paper.

References

Publications referenced by this paper.

Similar Papers

Loading similar papers…