The LEDA platform for combinatorial and geometric computing

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1256, Issue , 1997, Pages 7-16

  Mehlhom, Kurt ^a   Naher, Stefan ^b   Uhrig, Christian ^c  

^a MAX PLANCK INSTITUTE FOR INFORMATICS   (Germany)

^b MARTIN LUTHER UNIVERSITY HALLE WITTENBERG   (Germany)

^c INTERACTIVE Software Solutions GmbH   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

AUTOMATA THEORY; WEBSITES;

GEOMETRIC COMPUTING; THEORETICAL DEVELOPMENT;

COMPUTATIONAL LINGUISTICS;

EID: 21744437565     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: None     Document Type: Conference Paper

References (26)

1. A.V. Aho, J.E. Hopcroft, and J.D. Ullman. Data structures and algorithms. Addison-Wesley, 1983.
2. M. Blum and S. Kannan. Programs That Check Their Work. In Proc. of the 21th Annual ACM Symp. on Theory of Computing, 1989.
3. M. Blum, M. Luby, and R. Rubinfeld. Self-testing/correcting with applications to numerical problems. In Proc. 22nd Annual ACM Symp. on Theory of Computing, pages 73-83, 1990.
4. Ch. Burnikel, K. Mehlhorn, and S. Schirra. On degeneracy in geometric computations. In Proc. SODA 94, pages 16-23, 1994.
5. Ch. Burnikel, K. Mehlhorn, and S. Schirra. How to compute the Voronoi diagram of line segments: Theoretical and experimental results. In Springer-Verlag Berlin/New York, editor, LNCS, volume 855 of Proceedings of ESA '94, pages 227-239, 1994.
6. Ch. Burnikel, R. Fleischer, K. Mehlhorn, and S. Schirra. A strong and easily computable separation bound for arithmetic expressions involving square roots. In Proc. SODA 97, pages 702-709, 1997.
7. T.H. Cormen, C.E. Leiserson, and R.L. Rivest. Introduction to Algorithms. MIT Press/McGraw-Hill Book Company, 1990.
8. A. Fabri, G.-J. Giezeman, L. Kettner, S. Schirra, and S. Schonherr. The CGAL Kernel: A basis for geometric computation. In Workshop on Applied Computational Geometry (WACG96), LNCS, 1996.
9. Ulrich Finkler and Kurt Mehlhorn. Runtime prediction of real programs on real machines. In Proceedings 8th ACM-SIAM Symposium on Discrete Algorithms (SODA'97), January 1997.
10. C. Hundack, K. Mehlhorn, and S. Naher. A Simple Linear Time Algorithm for Identifying Kuratowski Subgraphs of Non-Planar Graphs. Manuscript, 1996.
11. J.H. Kingston. Algorithms and Data Structures. Addison-Wesley Publishing Company, 1990.
12. K. Mehlhorn. Data structures and algorithms 1,2, and 3. Springer, 1984.
13. K. Mehlhorn and P. Mutzel. On the Embedding Phase of the Hopcroft and Tarjan Planarity Testing Algorithm. Algorithmica, 16(2):233-242, 1995.
14. K. Mehlhorn, Muller, S. Naher, S. Schirra, M. Seel, C. Uhrig, and J. Ziegler. A computational basis for higher-dimensional computational geometry and its applications. In Proceedings of the Symp. on Computational Geometry, 1997. http://www.mpi-sb.mpg.de/~seel.
15. K. Mehlhorn and S. Naher. The LEDA Platform for Combinatorial and Geometric Computing. Cambridge University Press, forthcoming. Draft versions of some chapters are available at http: //www.mpi-sb.mpg.de/~mehlhom.
16. K. Mehlhorn and S. Naher. The implementation of geometric algorithms. In 13th World Computer Congress IFIP9Ą, volume 1, pages 223-231. Elsevier Science B.V. North-Holland, Amsterdam, 1994.
17. K. Mehlhorn and S. Naher. LEDA: A platform for combinatorial and geometric computing. Communications of the ACM, 38(1):96-102, 1995.
18. K. Mehlhorn, S. Naher, T. Schilz, S. Schirra, M. Seel, R. Seidel, and Ch. Uhrig. Checking Geometric Programs or Verification of Geometric Structures. In Proc. of the 12th Annual Symposium on Computational Geometry, pages 159-165, 1996.
19. Kurt Mehlhorn, S. Naher, and Ch. Uhrig. The LEDA User Manual (Version R 3.4). Technical report, Max-Planck-Institut fur Informatik, 1996. http://www.mpi-sb.mpg.de/LEDA/leda.html.
20. J. Nievergelt and K.H. Hinrichs. Algorithms and Data Structures. Prentice Hall Inc., 1993.
21. J. O'Rourke. Computational Geometry in C. Cambridge University Press, 1994.
22. R. Sedgewick. Algorithms. Addison-Wesley Publishing Company, 1991.
23. Michael Seel. Eine Implemeritierang abstrakter Voronoidiagramme. Master's thesis, Max-Planck-Institut fur Informatik, 1994.
24. R.E. Tarjan. Data structures and network algorithms. In GBMS-NSF Regional Conference Series in Applied Mathematics, volume 44, 1983.
25. C. J. van Wyk. Data Structures and C programs. Addison-Wesley Publishing Company, 1988.
26. D. Wood. Data Structures, Algorithms, and Performance. Addison-Wesley Publishing Company, 1993.