LEDA: A Platform for Combinatorial and Geometric Computing

Communications of the ACM

Volumn 38, Issue 1, 1995, Pages 96-102

  Mehlhorn, Kurt ^a   Näher, Stefan ^b  

^a Max Planck Institute for Computer Science ^*  (United States)

^b MARTIN LUTHER UNIVERSITY HALLE WITTENBERG   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMBINATORIAL MATHEMATICS; COMPUTATIONAL GEOMETRY; DATA ACQUISITION; DATA STRUCTURES; DATABASE SYSTEMS; OBJECT ORIENTED PROGRAMMING; RESPONSE TIME (COMPUTER SYSTEMS);

COMBINATORIAL COMPUTING; DATA TYPES; GEOMETRIC COMPUTING; LIBRARY OF EFFICIENT DATA TYPES;

COMPUTER SCIENCE;

EID: 0029184961     PISSN: 00010782     EISSN: 15577317     Source Type: Journal    
DOI: 10.1145/204865.204889     Document Type: Article

References (15)

1. Aho, A.V., Hopcroft, J.E., and Ullman, J.D. Data Structures and Algorithms. Addison-Wesley, Reading, Mass., 1983.
2. Burnikel, C., Mehlhorn, K., and Schirra, S. How to compute the Voronoi diagram of line segments: Theoretical and experimental results. In LNCS, 1994, Proceedings of ESA'94. Springer-Verlag, Berlin/New York.
3. Burnikel, C., Mehlhorn, K., and Schirra, S. On degeneracy in geometric computations. In Proceedings of SODA 94, (1994), p. 16-23.
4. Booch, G. Software Components with Ada. Benjamin Cummings/Addison-Wesley, Reading, Mass., 1987.
5. Cormen, T.H., Leiserson, C.E., and Rivest, R.L. Introduction to Algorithms. MIT Press/McGraw-Hill, Cambridge/New York 1990.
6. Dijkstra, E.W. A note on two problems in connexion with graphs. Numer. Math. 1 (1959), 269-271.
7. Gorlen, K.E., Orlow, S.M., and Plexico, P.S. Data Abstraction and Object-Oriented Programming in C+ +. Wiley, New York, 1990.
8. Kingston, J.H. Algorithms und Data Structures. Addison-Wesley, Reading, Mass., 1990.
9. Lauther, U. Untersuchung der library of efficient data types and algorithms (LEDA). Tech. Rep., Siemens AG, ZEE, München, 1992.
10. Locke, N. C++ FTP libraries. C+ + Report 6, (1994), 61-65.
11. Mehlhorn, K. Data Structures and Efficient Algorithms. Springer-Verlag, New York, 1984.
12. Mehlhorn, K., and Näher, S. Algorithm design and software libraries: Recent developments in the LEDA project. In Algorithms, Software, Architectures, Information Processing 92. Vol. 1. Elsevier North-Holland, Amsterdam 1992.
13. Mehlhorn, K., and Näher, S. Implementation of a sweep line algorithm for the segment intersection problem. Tech. Rep. MPI-I-94-160, Max-Planck-Institut für Informatik, Saarbrücken, 1994.
14. Mehlhorn, K., and Näher, S. The implementation of geometric algorithms. Thirteenth World Computer Congress, IFIP94, Vol. 1, Elsevier Science North-Holland, Amsterdam, 1994.
15. Mehlhorn, K., Mutzel, P., and Näher, S. An implementation of the Hopcroft and Tarjan planarity test and embedding algorithm. Tech. Rep. MPI-I-93-151, Max-Planck-Institut für Informatik, Saarbrücken, 1993.