The LEDA Platform of Combinatorial and Geometric Computing

We give an overview of the LEDA platform for combinatorial and geometric computing and an account of its development. We discuss our motivation for building LEDA and to what extent we have reached our goals. We also discuss some recent theoretical developments. This paper contains no new technical material. It is intended as a guide to existing publications about the system. We refer the reader also to our web-pages for more information.

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

[2]  Geert-Jan Giezeman,et al.  The CGAL Kernel: A Basis for Geometric Computation , 1996, WACG.

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

[4]  William L. Ditto,et al.  Principles and applications of chaotic systems , 1995, CACM.

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

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

[7]  Manuel Blum,et al.  Self-testing/correcting with applications to numerical problems , 1990, STOC '90.

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

[9]  Kurt Mehlhorn,et al.  A strong and easily computable separation bound for arithmetic expressions involving square roots , 1997, SODA '97.

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

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

[12]  Kurt Mehlhorn,et al.  LEDA: a platform for combinatorial and geometric computing , 1997, CACM.

[13]  Kurt Mehlhorn,et al.  A computational basis for higher-dimensional computational geometry and applications , 1998, Comput. Geom..

[14]  Kurt Mehlhorn,et al.  A platform for combinatorial and geometric computing , 1995 .

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

[16]  Kurt Mehlhorn,et al.  Checking geometric programs or verification of geometric structures , 1999, Comput. Geom..

[17]  Manuel Blum,et al.  Designing programs that check their work , 1989, STOC '89.

[18]  Kurt Mehlhorn,et al.  A computational basis for higher-dimensional computational geometry and applications , 1997, SCG '97.

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

[20]  Kurt Mehlhorn,et al.  Checking geometric programs or verification of geometric structures , 1996, SCG '96.

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

[22]  Kurt Mehlhorn.  Multidimensional Data Structures , 1984 .

[23]  Kurt Mehlhorn,et al.  Runtime prediction of real programs on real machines , 1997, SODA '97.