Lecture notes in computer science · 1995 · 146 citations · 5 references
ComputingComputer ScienceMathematicsAlgorithmsComputational GeometryGeometryGeometric ConstructionsGeometric Data StructuresGeometric GraphsGeometric OptimizationGeometry ProcessingParallel Computational GeometryIntersection CountingParallel Combinatorial GeometryParallel Geometric Searching
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).
5
A note on two problems in connexion with graphs
E. Dijkstra · Numerische Mathematik · 1959 · 23.8K citations
1990 · 3.1K citations
Designing programs that check their work
Manuel Blum, S. Kanna · 1989 · 289 citations
Checking geometric programs or verification of geometric structures
Kurt Mehlhorn, Stefan Näher, Thomas F. Schilz et al. · 1996 · 58 citations · Full text