LEDA: a platform for combinatorial and geometric computing
Kurt Mehlhorn, Stefan Näher, Christian Uhrig · Lecture notes in computer science · 1995
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).
Cited by 1,199 works. doi:10.1007/3-540-63165-8_161 Open-access PDF
Authors
References
- A note on two problems in connexion with graphs
- Data Structures and Network Algorithms
- LEDA: a platform for combinatorial and geometric computing
- Designing programs that check their work
- Self-testing/correcting with applications to numerical problems
- The CGAL kernel: A basis for geometric computation
- Checking geometric programs or verification of geometric structures
- On the Embedding Phase of the Hopcroft and Tarjan Planarity Testing Algorithm
- Data structures, algorithms, and performance
- Multidimensional Data Structures