|
1 |
Implementation of a sweep line algorithm for the straight line segment intersection problem
Mehlhorn, Kurt. - Saarbrücken : MPI Informatik, 1994
|
|
|
|
2 |
On the embedding phase of the Hopcroft and Tarjan planarity testing algorithm
Mehlhorn, Kurt. - Saarbrücken : MPI Informatik, 1994
|
|
|
|
3 |
A complete and efficient algorithm for the intersection of a general and a convex polyhedron
Dobrindt, Katrin. - Saarbrücken : Max-Planck-Inst. für Informatik, 1993
|
|
|
|
4 |
An implementation of the Hopcroft and Tarjan planarity test and embedding algorithm
Mehlhorn, Kurt. - Saarbrücken : Max-Planck-Inst. für Informatik, 1993
|
|
|
|
5 |
An implementation of the Hopcroft and Tarjan planarity test and embedding algorithm
Mehlhorn, Kurt. - Saarbrücken : Max-Planck-Inst. für Informatik, 1993, [Neuausg.]
|
|
|
|
6 |
Maintaining dynamic sequences under equality-tests in polylogarithmic time
Mehlhorn, Kurt. - Saarbrücken : Max-Planck-Inst. für Informatik, 1993
|
|
|
|
7 |
Randomized incremental construction of abstract Voronoi diagrams
Klein, Rolf. - Saarbrücken : MPI Informatik, 1993
|
|
|
|
8 |
Tail estimates for the efficiency of randomized incremental algorithms for line segment intersection
Mehlhorn, Kurt. - Saarbrücken : MPI Informatik, 1993
|
|
|
|
9 |
Dynamic point location in general subdivions
Baumgarten, Hanna. - Saarbrücken : MPI Informatik, 1992
|
|
|
|
10 |
Dynamic point location in general subdivisions
Baumgarten, Hanna. - Berlin : Freie Univ., Fachbereich Mathematik, 1992
|
|
Administration
