Affiliation:
1. Max Planck Institute for Computer Science, Saarbru¨cken, Germany
2. Martin Luther Univ., Halle, Germany
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).
Publisher
Association for Computing Machinery (ACM)
Reference19 articles.
1. On degeneracy in geometric computations;Burnikel C.;Proceedings of SODA,1994
2. Cormen T.H. Leiserson C.E. and Rivest R.L. Introductiono lto Algorithms. MIT Press/McGraw=Hill. Cambridge/ New York 1990.]] Cormen T.H. Leiserson C.E. and Rivest R.L. Introductiono lto Algorithms. MIT Press/McGraw=Hill. Cambridge/ New York 1990.]]
Cited by
204 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献