Abstract
A recent paper, published in Algorithms—ESA2004, presented examples designed to illustrate that using floating-point arithmetic in algorithms for computational geometry may cause implementations to fail. The stated purpose was to demonstrate, to students and implementors, the inadequacy of floating-point arithmetic for geometric computations. The examples presented were both useful and insightful, but certain of the accompanying remarks were misleading. One such remark is that researchers in numerical analysis may believe that simple approaches are available to overcome the problems of finite-precision arithmetic. Another is the reference, as a general statement, to the inadequacy of floating-point arithmetic for geometric computations.
In this paper it will be shown how the now-classical backward error analysis can be applied in the area of computational geometry. This analysis is relevant in the context of uncertain data, which may well be the practical context for computational-geometry algorithms such as, say, those for computing convex hulls. The exposition will illustrate the fact that the backward error analysis does not pretend to overcome the problem of finite precision: it merely provides a tool to distinguish, in a fairly routine way, those algorithms that overcome the problem to whatever extent it is possible to do so.
It will also be shown, by using one of the examples of failure presented in the principal reference, that often the situation in computational geometry is exactly parallel to other areas, such as the numerical solution of linear equations, or the algebraic eigenvalue problem. Indeed, the example mentioned can be viewed simply as an example of an unstable algorithm, for a problem for which computational geometry has already discovered provably stable algorithms.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Kettner, L., Mehlhorn, K., Pion, S., Schirra, S., Yap, C.: Classroom examples of robustness problems in geometric computations. In: Albers, S., Radzik, T. (eds.) ESA 2004. LNCS, vol. 3221, pp. 702–713. Springer, Heidelberg (2004)
Graham, R.L.: An efficient algorithm for determining the convex hull of a finite planar set. Information Processing Letters 1, 132–133 (1972)
Cohen, I.B.: Revolution in Science. Harvard University Press, Cambridge (1985)
Stewart, N.F.: Science and computer science. ACM Comp. Surveys 1(27), 39–41 (1995)
Kahan, W.M.: A survey of error analysis. In: IFIP 1971, pp. 1214–1239. North Holland, Amsterdam (1971)
Wilkinson, J.H.: The Algebraic Eigenvalue Problem. Clarendon Press, Oxford (1965)
Fortune, S.: Stable maintenance of point set triangulations in two dimensions. In: Proceedings of the 30th annual IEEE Symposium on Foundations of Computer Science, vol. 30, pp. 494–499 (1989)
Hoffmann, C.M., Stewart, N.F.: Accuracy and semantics in shape-interrogation applications. Graphical Models 67(5), 373–389 (2005)
Andersson, L.-E., Peters, T.J., Stewart, N.F.: Selfintersection of composite curves and surfaces. Computer Aided Geometric Design 15(5), 507–527 (1998)
Jaromczyk, J.W., Wasilkowski, G.W.: Computing convex hulls in a floating point arithmetic. Computational Geometry 4, 283–292 (1994)
Fortune, S.: Numerical stability of algorithms for 2D Delaunay triangulations. International Journal of Computational Geometry and Applications 1(5), 193–213 (1995)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Jiang, D., Stewart, N.F. (2006). Backward Error Analysis in Computational Geometry. In: Gavrilova, M., et al. Computational Science and Its Applications - ICCSA 2006. ICCSA 2006. Lecture Notes in Computer Science, vol 3980. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11751540_6
Download citation
DOI: https://doi.org/10.1007/11751540_6
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-34070-6
Online ISBN: 978-3-540-34071-3
eBook Packages: Computer ScienceComputer Science (R0)