Preview
Unable to display preview. Download preview PDF.
References
M. de Berg, M. van Kreveld, M. Overmars, and O. Schwarzkopf. Computational Geometry. Springer, 1997.
S. Fortune. A sweepline algorithm for Voronoi diagrams. In Proc. 2nd Annu. ACM Sympos. Comput. Geom., pages 313–322, 1986.
K. Hinrichs, J. Nievergelt, and P. Schorn. Plane-sweep solves the closest pair problem elegantly. Inform. Process. Lett., 26:255–261, 1988.
K. Hinrichs, J. Nievergelt, and P. Schorn. An all-round sweep algorithm for 2-dimensional nearest-neighbor problems. In Acta Informatica, volume 29, pages 383–394, 1992.
R. Klein. Algorithmische Geometrie. Addision-Wesley, 1997.
K. Mehlhorn. Data Structures and Algorithms 3: Multi-dimensional Searching and Computational Geometry, volume 3 of EATCS Monographs on Theoretical Computer Science. Springer-Verlag, Heidelberg, West Germany, 1984.
K. Mulmuley. Computational Geometry: An Introduction Through Randomized Algorithms. Prentice Hall, Englewood Cliffs, NJ, 1994.
J. Nievergelt and K. Hinrichs. Algorithms and Data Structures, with Applications to Graphics and Geometry. Prentice-Hall, 1993.
J. Nievergelt. Complexity, algorithms, programs, systems: The shifting focus. In Proc. ALCOM Workshop on Algorithms: Implementation, Libraries, and Use, J. Symbolic Computation, volume 17, pages 297–310, 1994.
Jürg Nievergelt, Peter Schorn, Michele de Lorenzi, Christoph Ammann, and Adrian Brüngger. XYZ: A project in experimental geometric computation. In Computational Geometry — Methods, Algorithms and Appli cations: Proc. Internat. Workshop Comput. Geom. CG '91, volume 553 of Lecture Notes in Computer Science, pages 171–186. Springer-Verlag, 1991.
F. P. Preparata and M. I. Shamos. Computational Geometry: An Introduction. Springer-Verlag, New York, NY, 1985.
P. Schorn. The XYZ GeoBench for the experimental evaluation of geometric algorithms. In DIMACS Workshop on Computational Support for Discrete Mathematics, 1992. [SH75] M. I. Shamos and D. Hoey. Closest-point problems. In Proc. 16th Annu. IEEE Sympos. Found. Comput. Sci., pages 151–162, 1975.
P. M. Vaidya. An O(n log n) algorithm for the all-nearest-neighbors problem. Discrete Comput. Geom., 4:101–115, 1989.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1997 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Nievergelt, J. (1997). Introduction to geometric computing: From algorithms to software. In: van Kreveld, M., Nievergelt, J., Roos, T., Widmayer, P. (eds) Algorithmic Foundations of Geographic Information Systems. CISM School 1996. Lecture Notes in Computer Science, vol 1340. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-63818-0_1
Download citation
DOI: https://doi.org/10.1007/3-540-63818-0_1
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-63818-6
Online ISBN: 978-3-540-69653-7
eBook Packages: Springer Book Archive