Abstract
The use of floating-point arithmetic in geometric computation represents a formidable challenge for development and implementation of geometric algorithms. On one hand, one thrives to develop algorithms that are robust and produce accurate results, while on the other hand, one attempts to achieve rapid execution time. In particular for GIS applications, where large problem sizes are frequently encountered, efficiency considerations are important. In this paper, we present a floating-point filter written specifically for the important line intersection operation that is robust, outperforms existing general purpose filters and results in an accurate discovery and representation of topology from the geometric information.
This R&D project has been supported in part by Sun Microsystems, the Natural Sciences and Engineering Research Council of Canada and Nortel Networks.
This is a preview of subscription content, log in via an institution to check access.
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
Avnaim, F., Boissonnat, J.-D., Devillers, O., Preparata, F.P., Yvinec, M.: Evaluating Signs of Determinants Using Single-Precision Arithmetic. Algorithmica 17(2), 111–132 (1997)
Brönnimann, H., Melquiond, G., Pion, S.: The Boost Interval Arithmetic Library. In: Proceedings of the 5th Conference on Real Numbers and Computers, pp. 65–80 (2003)
Brönnimann, H., Burnikel, C., Pion, S.: Interval arithmetic yields efficient dynamic filters for computational geometry. Discrete Applied Mathematics 109, 25–47 (2001)
The Core Library, see http://www.cs.nyu.edu/exact/core/
Lang, S.: Linear Algebra, 3rd edn. Springer, Heidelberg (1987)
Funke, S., Näher, S., Mehlhorn, K.: Structural Filtering – A Paradigm for Efficient and Exact Geometric Programs. In: Proc (electronic) 11th Canadian Conference on Computational Geometry (CCCG), Vancouver, Canada (1999)
Mehlhorn, K., Näher, S.: The Implementation of Geometric Algorithms. In: 13th World Computer Congress IFIP 1994, vol. 1, pp. 223–231. Elsevier Science B.V., Amsterdam (1994)
Mehlhorn, K., Näher, S.: The LEDA Platform of Combinatorial and Geometric Computing. Cambridge University Press, Cambridge (1999)
Goldberg, D.: “What Every Computer Scientist should know about Floating-Point Arithmetic. ACM Computing Surveys 23(1), 5–48 (1991)
Dobkin, D.P., Silver, D.: Recipes for geometry and numerical analysis - Part I: an empirical study. In: Proceedings of the Fourth annual Symposium on Computational Geometry, pp. 93–105 (1988)
Hayes, B.: A Lucid Interval. American Scientist 91(6), 484–488 (2003)
Karasick, M., Lieber, D., Nackman, L.R.: Efficient Delaunay Triangulations Using Rational Arithmetic. ACM Transactions on Graphics 10(1), 71–91 (1991)
Kearfott, R.B.: Interval Computations: Introduction, Uses and Resources (2004), http://www.cs.utep.edu/interval-comp/
Knott, G., Jou, E.: A Program to Determine Whether Two Line Segments Intersect, Technical Report CAR-TR-306, CS-TR- 1884, DCR-86-05557, Computer Science Deptartment, University of Maryland, College Park (1987)
Kulisch, U.W., Miranker, W.L.: Computer Arithmetic in Theory and Practice. Academic Press, New York (1981)
Bentley, J.L., Ottmann, T.A.: Algorithms for reporting and counting geometric intersections. IEEE Transactions on Computers C-28, 643–647 (1979)
Rafalin, E., Souvaine, D., Streinu, I.: Topological Sweep in Degenerate cases. In: Proceedings of the 4th International Workshop on Algorithm Engineering and Experiments, pp. 155–165. Springer, Berlin (2002)
Ramshaw, L.: The Braiding of Floating Point Lines, CSL Notebook Entry, Xerox Parc (1982)
Schirra, S.: Robustness and Precision Issues in Geometric Computation. In: Sack, J.R., Urrutia, J. (eds.) Handbook of Computational Geometry, pp. 597–632 (1999)
Shewchuk, J.R.: Adaptive Precision Floating-point Arithmetic and Fast Robust Geometric Predicates, Technical Report CMU-CS-96-140, School of Computer Science, Carnegie Mellon University (1996)
Yap, C.: On Guaranteed Accuracy Computation. In: Chen, F., Wang, D. (eds.) Geometric Computation, World Scientific Publishing Co., Singapore (2004) (to appear)
Peucker, T.K.: A Theory of Cartographic Line. In: Proceedings, Second International Symposium on Computer-Assisted Cartography, AUTO-CARTO II, pp. 508–518 (1975)
Lanthier, M.A.: Shortest Path Problems on Polyhedral Surfaces, Ph. D. thesis, School of Computer Science, Carleton University, Ottawa, Ontario, Canada (1999)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Frankel, A., Nussbaum, D., Sack, JR. (2004). Floating-Point Filter for the Line Intersection Algorithm. In: Egenhofer, M.J., Freksa, C., Miller, H.J. (eds) Geographic Information Science. GIScience 2004. Lecture Notes in Computer Science, vol 3234. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-30231-5_7
Download citation
DOI: https://doi.org/10.1007/978-3-540-30231-5_7
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-23558-3
Online ISBN: 978-3-540-30231-5
eBook Packages: Springer Book Archive