Veröffentlichungen

The nearest neighbor
In Computational Discrete Mathematics, Lecture Notes in Computer Science, Band 2122, Seiten 13–24, Springer, 2001.
Helmut Alt
[bibtex]
Exact L_infty-Nearest Neighbor Search in High Dimensions
In Proceedings of the 17th ACM Symposium on Computational Geometry, Seiten 157-163, Association for Computing Machinery, June 2001.
Helmut Alt, Laura Heinrich-Litan
[bibtex]
Packing Convex Polygons into Rectangular Boxes
In Japanese Conference on Discrete and Computational Geometry 2000, Lecture Notes in Computer Science, Band 2098, Seiten 67-80, Herausgeber J. Akiyama and M. Kano and M. Urabe, Springer-Verlag, 2001.
Helmut Alt, Ferran Hurtado
[bibtex]
Covering with Ellipses
Technischer Bericht B 01-08, Freie Universität Berlin, Fachbereich Mathematik und Informatik, December 2001.
Alon Efrat, Frank Hoffmann, Christian Knauer, Klaus Kriegel, Günter Rote, Carola Wenk
[bibtex] [ps.gz]
Geometric Algorithms for the Analysis of 2D-Electrophoresis Gels
In Proceedings of the Fifth Annual International Conference on Computational Molecular Biology (RECOMB), Seiten 114-123, Montreal, Canada, 2001.
Alon Efrat, Frank Hoffmann, Klaus Kriegel, Christof Schultz, Carola Wenk
[bibtex]

Zeitreihenanalyse und Chaos
Diplomarbeit, FU-Berlin, Fachbereich Mathematik und Informatik, 2001.
Britta Denner-Broser
[pdf]
[bibtex]

Computational Discrete Mathematics, Advanced Lectures (Ed.)
Lecture Notes in Computer Science, Band 2122, Springer, 2001.
Helmut Alt
ISBN: 3-540-42775-9
[bibtex]

Dynamische Geometrie
Mitteilungen der DMV, Band 3, Seiten 33-40, 2001.
Ulrich Kortenkamp
[bibtex]
Decision Complexity in Dynamic Geometry
In Proceedings of ADG 2000, Lecture Notes in Artificial Intelligence, Seiten 167-172, Herausgeber Dongming Wang, Springer-Verlag, Heidelberg, 2001.
Ulrich Kortenkamp, Jürgen Richter-Gebert
[bibtex]
A Dynamic Setup For Elementary Geometry
In Proceedings of MTCM 2000, Springer-Verlag, 2001.
Ulrich Kortenkamp, Jürgen Richter-Gebert
[bibtex]
Grundlagen Dynamischer Geometrie
In Oberwolfach-Tagungsband, Franzbecker, 2001.
Ulrich Kortenkamp, Jürgen Richter-Gebert
[bibtex]
Complexity issues in Dynamic Geometry
In Proceedings of the Smale Fest 2000}, 2001.
Ulrich Kortenkamp, Jürgen Richter-Gebert
To appear, currently available as technical report TRB-2000/22, Freie Universität Berlin
[bibtex]

Computational Discrete Mathematics: advanced lectures
Lecture Notes In Computer Science, Springer-Verlag New York, Inc., 2001.
Herausgeber: Helmut Alt
[bibtex]

Die interaktive Geometrie-Software Cinderella
Tagungsband Learntec 2001, Band 2, Seiten 525-532, October 2001.
Ulrich Kortenkamp
[bibtex]
The Future of Mathematical Software
In Proceedings of MTCM 2000, Springer-Verlag, 2001.
Ulrich Kortenkamp
[bibtex]
Cinderella - Software interattivo di geometria
Springer-Verlag, Mailand, 2001.
Ulrich Kortenkamp, Jürgen Richter-Gebert
Italian translation.
[bibtex]
Cinderella - Programa interactivo di Geometria
CMAFUL, Lisbon, 2001.
Ulrich Kortenkamp, Jürgen Richter-Gebert
Portuguese translation.
[bibtex]

Computing the Hausdorff distance of geometric patterns and shapes
Technischer Bericht B 01-07, Freie Universität Berlin, Fachbereich Mathematik und Informatik, 2001.
Helmut Alt, Peter Braß, Michael Godau, Christian Knauer, Carola Wenk
[bibtex]
Comparison of distance measures for geometric shapes
Technischer Bericht B 01-09, Freie Universität Berlin, Fachbereich Mathematik und Informatik, December 2001.
Helmut Alt, Christian Knauer, Carola Wenk
[bibtex] [ps.gz]
Matching polygonal curves with respect to the Fr\'echet distance
In Proceedings 18th International Symposium on Theoretical Aspects of Computer Science, Seiten 63-74, 2001.
Helmut Alt, Christian Knauer, Carola Wenk
[bibtex] [ps.gz]
Nearest neighbour search in Hausdorff distance pattern spaces
Technischer Bericht B 01-10, Freie Universität Berlin, Fachbereich Mathematik und Informatik, 2001.
Peter Braß, Christian Knauer
[bibtex] [ps.gz]

Generalized self-approaching curves
Discrete Applied Mathematics, Band 109, Seiten 3–24, 2001.
Oswin Aichholzer, Franz Aurenhammer, Christian Icking, Rolf Klein, Elmar Langetepe, Günter Rote
[bibtex] [pdf] [ps.gz]
Triangles of extremal area or perimeter in a finite planar point set
Discrete and Computational Geometry, Band 26, Seiten 51-58, 2001.
Peter Braß, Günter Rote, Konrad J. Swanepoel
[bibtex]
Fast 2-variable integer programming
In IPCO 2001–Proceedings of the 8th Conference on Integer Programming and Combinatorial Optimization, Utrecht, Lecture Notes in Computer Science, Band 2081, Seiten 78-89, Herausgeber K. Aardal and B. Gerards, Springer-Verlag, 2001.
Friedrich Eisenbrand, Günter Rote
[bibtex] [pdf] [ps.gz]
Fast reduction of ternary quadratic forms
In Cryptography and Lattices –International Conference, CaLC 2001, Lecture Notes in Computer Science, Band 2146, Seiten 32-44, Herausgeber Joseph H. Silverman, Springer-Verlag, 2001.
Friedrich Eisenbrand, Günter Rote
[bibtex] [pdf] [ps.gz]
Counting triangulations and pseudo-triangulations of wheels
In Proceedings of the 13th Canadian Conference on Computational Geometry, Waterloo, Seiten 149-152, Herausgeber T. Biedl, 2001.
Dana Randall, Günter Rote, Francisco Santos, Jack Snoeyink
[bibtex] [pdf] [ps.gz]
Expansive motions and the polytope of pointed pseudo-triangulations
September 2001.
Günter Rote, Francisco Santos, Ileana Streinu
[bibtex] [pdf] [pdf.gz] [ps.gz]

Division-free algorithms for the determinant and the Pfaffian: algebraic and combinatorial approaches
In Computational Discrete Mathematics, Lecture Notes in Computer Science, Band 2122, Seiten 119-135, Herausgeber Helmut Alt, Springer-Verlag, 2001.
Günter Rote
[bibtex] [pdf] [ps.gz]

The Polygon Exploration Problem
SIAM Journal on Computing, Band 31(2), Seiten 577-600, 2001.
Frank Hoffmann, Christian Icking, Rolf Klein, Klaus Kriegel
[bibtex]

The obnoxious center problem on a tree
SIAM Journal on Discrete Mathematics, Band 14, Seiten 498-509, 2001.
Rainer E. Burkard, Yixun Lin, Günter Rote
[bibtex] [pdf] [ps.gz]