Name
Abstract | ||
|---|---|---|
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). |
Year | DOI | Venue |
|---|---|---|
1999 | 10.1145/204865.204889 | LEDA: a platform for combinatorial and geometric computing |
Keywords | DocType | Volume |
convex hull,area deal,linear programming,discrete optimization,computer science,core area,application area,voronoi diagram,data structure,geometric computing,numerical analysis,symbolic computation,shortest path,linear program | Journal | 38 |
Issue | ISSN | ISBN |
1 | 0302-9743 | 0-521-56329-1 |
Citations | PageRank | References |
615 | 87.19 | 8 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Kurt Mehlhorn | 1 | 5314 | 853.36 |
| Stefan Näher | 2 | 961 | 146.99 |
| Christian Uhrig | 3 | 739 | 99.73 |