LEDA: a platform for combinatorial and geometric computing

Combinatorial and geometric computing is a core area of computer science (CS). In fact, most CS curricula contain a course in data structures and algorithms. The area deals with objects such as graphs, sequences, dictionaries, trees, shortest paths, flows, matchings, points, segments, lines, convex hulls, and Voronoi diagrams and forms the basis for application areas such as discrete optimization, scheduling, traffic control, CAD, and graphics. There is no standard library of the data structures and algorithms of combinatorial and geometric computing. This is in sharp contrast to many other areas of computing. There are, for example, packages in statistics (SPSS), numerical analysis (LINPACK, EISPACK), symbolic computation (MAPLE, MATHEMATICA), and linear programming (CPLEX).

[1]  Edsger W. Dijkstra,et al.  A note on two problems in connexion with graphs , 1959, Numerische Mathematik.

[2]  Stanley B. Lippman,et al.  C++ Primer , 1993 .

[3]  Robert E. Tarjan,et al.  Data structures and network algorithms , 1983, CBMS-NSF regional conference series in applied mathematics.

[4]  Michael Ian Shamos,et al.  Computational geometry: an introduction , 1985 .

[5]  Bjarne Stroustrup,et al.  C++ Programming Language , 1986, IEEE Softw..

[6]  Grady Booch,et al.  Software Component with ADA , 1987 .

[7]  Van Wyk,et al.  Data structures and C programs , 1988 .

[8]  Niklaus Wirth,et al.  Algorithms and Data Structures , 1989, Lecture Notes in Computer Science.

[9]  Algorithms and data structures , 1990 .

[10]  Sanford M. Orlow,et al.  Data abstraction and object-oriented programming in C++ , 1990 .

[11]  Jeffrey H. Kingston.  Algorithms and data structures - design, correctness, analysis , 1990, International computer science series.

[12]  Ronald L. Rivest,et al.  Introduction to Algorithms , 1990 .

[13]  Reginald Meeson.  Book Review: Data Abstraction and Object-Oriented Programming in C++ by Keith Gorlen, Sanford Orlow, and Perry Plexico: (John Wiley & Sons, 1990) , 1991 .

[14]  Christopher J. Van Wyk,et al.  Data Structures and C Programs, 2nd Ed. (Addison-Wesley Series in Computer Science) , 1991 .

[15]  Kurt Mehlhorn,et al.  Algorithm Design and Software Libraries: Recent Developments in the LEDA Project , 1992, IFIP Congress.

[16]  Derick Wood,et al.  Data structures, algorithms, and performance , 1992 .

[17]  Robert B. Murray,et al.  C++ Strategies and Tactics , 1993 .

[18]  Petra Mutzel,et al.  An implementation of the Hopcroft and Tarjan planarity test and embedding algorithm , 1993 .

[19]  Joachim Ziegler,et al.  An implementation of a Convex Hull Algorithm, Version 1.0 , 1994 .

[20]  Kurt Mehlhorn,et al.  How to Compute the Voronoi Diagram of Line Segments: Theoretical and Experimental Results , 1994, ESA.

[21]  Kurt Mehlhorn,et al.  The Implementation of Geometric Algorithms , 1994, IFIP Congress.

[22]  Joseph O'Rourke,et al.  Computational Geometry in C. , 1995 .

[23]  Kurt Mehlhorn,et al.  On degeneracy in geometric computations , 1994, SODA '94.

[24]  Mark de Berg,et al.  Computational geometry: algorithms and applications , 1997 .

[25]  John Beidler,et al.  Data Structures and Algorithms , 1996, Wiley Encyclopedia of Computer Science and Engineering.