Work

LEDA: a platform for combinatorial and geometric computing

Year: 1995

Type: conference-paper

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).

Source: Lecture notes in computer science

DOI: 10.1007/3-540-63165-8_161

Authors: Kurt Mehlhorn, Stefan Näher, Christian Uhrig

Institutions: Max Planck Institute for Informatics, Martin Luther University Halle-Wittenberg, Saarland University

Language: English

Topic: Computational Geometry and Mesh Generation

Subfield: Computer Graphics and Computer-Aided Design

Field: Computer Science

Domain: Physical Sciences

Open Access status: bronze

OpenAlex ID: W136556473

FWCI: 19.73

Cites: 40

Cited by: 1,222

Related to: 10