This is a preview of subscription content, log in via an institution to check access.
References
Ch. Burnikel, J. Könemann, K. Mehlhorn, St. Näher, St. Schirra, and Ch. Uhrig. Exact geometric computation in LEDA. In Proc. COMPGEO 95. To appear.
Ch. Burnikel, K. Mehlhorn, and St. Schirra. On degeneracy in geometric computations. In Proc. SODA 94, pages 16–23, 1994.
Ch. Burnikel, K. Mehlhorn, and St. Schirra. How to compute the Voronoi diagram of line segments: Theoretical and experimental results. In LNCS, volume 855, pages 227–239. Springer-Verlag Berlin/New York, 1994. Proceedings of ESA'94.
K. Mehlhorn and St. Näher. Implementation of a sweep line algorithm for the straight line segment intersection problem. Technical Report MPI-I-94-160, Max-Planck-Institut für Informatik, Saarbrücken, 1994.
K. Mehlhorn and St. Näher. The implementation of geometric algorithms. In 13th World Computer Congress IFIP94, volume 1, pages 223–231. Elsevier Science B.V. North-Holland, Amsterdam, 1994.
K. Mehlhorn and St. Näher. LEDA: A library of efficient data types and algorithms. CACM, 38(1):96–102, 1995.
St. Näher. LEDA Manual Version 3.1. Technical Report MPI-I-95-1-002, Max-Planck-Institut für Informatik, 1995.
Editor information
Rights and permissions
Copyright information
© 1995 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Mehlhorn, K. (1995). Experiences with the implementation of geometric algorithms. In: Akl, S.G., Dehne, F., Sack, JR., Santoro, N. (eds) Algorithms and Data Structures. WADS 1995. Lecture Notes in Computer Science, vol 955. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-60220-8_90
Download citation
DOI: https://doi.org/10.1007/3-540-60220-8_90
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-60220-0
Online ISBN: 978-3-540-44747-4
eBook Packages: Springer Book Archive