FU Logo
Fachbereich Mathematik und Informatik
123123

2003

[bibtex]

    Algorithmische Geometrie

    • On the worst-case complexity of the silhouette of a polytope
      In Proceedings of the 15th Canadian Conference on Computational Geometry, 2003.
      Helmut Alt, Marc Glisse, Xavier Goaoc
      [bibtex]

    • Matching planar maps
      In Proceedings of the 14th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), Baltimore, Seiten 589-598, 2003.
      Helmut Alt, Alon Efrat, Günter Rote, Carola Wenk
      [bibtex] [pdf] [ps.gz]

    • Covering with Ellipses
      Algorithmica, Band 38 (1), 2003.
      Alon Efrat, Frank Hoffmann, Christian Knauer, Klaus Kriegel, Günter Rote, Carola Wenk
      Special Issue on Shape Algorithmics
      [bibtex]

    • On counting point-hyperplane incidences
      CGTA, Band 25, Seiten 13-20, 2003.
      Peter Braß, Christian Knauer
      Special Issue: Selected Papers from the 17th European Workshop on Computational Geometry (EWCG) (EuroCG 2001).
      [bibtex]

    • The Complexity of (Un)folding
      In 19th ACM Symposium on Computational Geometry, Seiten 164-170, 2003.
      Helmut Alt, Christian Knauer, Günter Rote, Sue Whitesides
      [bibtex] [ps.gz]

    • Guarding Art Galleries by Guarding Witnesses
      Technischer Bericht UU-CS-2003-044, Institute of Information and Computing Sciences, Universiteit Utrecht, 2003.
      Kyung-Yong Chwa, Byung-Cheol Jo, Christian Knauer, Esther Moet, René van Oostrum, Chan-Su Shin
      [bibtex]

    • Straightening polygonal arcs and convexifying polygonal cycles
      Discrete and Computational Geometry, Band 30, Seiten 205-239, 2003.
      Robert Connelly, Erik D. Demaine, Günter Rote
      [bibtex] [pdf] [ps.gz]

    • Incremental constructions con BRIO
      In Proceedings of the Nineteenth Annual Symposium on Computational Geometry, San Diego, Seiten 211-219, Association for Computing Machinery, 2003.
      Nina Amenta, Sunghee Choi, Günter Rote
      [bibtex] [ps.gz] [pdf]

    • The zigzag path of a pseudo-triangulation
      In Algorithms and Data Structures. Proceedings of the 8th International Workshop on Algorithms and Data Structures (WADS 2003), Ottawa, July 2003, Lecture Notes in Computer Science, Band 2748, Seiten 377-388, Herausgeber Frank Dehne and Joerg-Rüdiger Sack and Michiel Smid, Springer-Verlag, 2003.
      Oswin Aichholzer, Günter Rote, Bettina Speckmann, Ileana Streinu
      [bibtex] [ps.gz]

    • Simple and output-sensitive construction of contour trees using monotone paths
      Computational Geometry, Theory and Applications, May 2003.
      Yi-Jen Chiang, Tobias Lenz, Xiang Lu, Günter Rote
      [bibtex] [pdf] [ps.gz]

    • Computing the Fr\'echet distance between piecewise smooth curves
      Technischer Bericht ECG-TR-241108-01, May 2003.
      Günter Rote
      [bibtex] [pdf] [ps.gz]

    • On constrained minimum pseudotriangulations
      In Computing and Combinatorics. Proceedings of the 9th International Computing and Combinatorics Conference (COCOON 2003), Big Sky, Montana, USA, July 2003, Lecture Notes in Computer Science, Band 2697, Seiten 445-454, Herausgeber Tandy Warnow and Binhai Zhu, Springer-Verlag, 2003.
      Günter Rote, Cao An Wang, Lusheng Wang, Yinfeng Xu
      [bibtex] [pdf] [ps.gz]

    • Finding a curve in a map (Video)
      In Proceedings of the Nineteenth Annual Symposium on Computational Geometry, San Diego, Seiten 384-385, Association for Computing Machinery, 2003.
      Helmut Alt, Alon Efrat, Lingeshwaran Palaniappan, Günter Rote, Carola Wenk
      [bibtex] [pdf] [ps.gz]

    • Matching planar maps
      J. of Algorithms, Seiten 262-283, 2003.
      Helmut Alt, Alon Efrat, Günter Rote, Carola Wenk
      [bibtex] [pdf] [ps.gz]

    • Über die Extrempunkte des PPT Polytopes
      In Doktoranden-Workshop der FU Berlin, 2003.
      André Schulz
      Technical Report
      [bibtex]

    • Efficient Contour Tree Construction and Computation of Betti Numbers in Scalar Fields
      In 19th European Workshop on Computational Geometry, Bonn, Germany, March 2003.
      Tobias Lenz, Günter Rote
      [bibtex]

    • Simple and optimal output-sensitive construction of contour trees using monotone paths
      Technischer Bericht ECG-TR-244300-01, May 2003.
      Yi-Jen Chiang, Tobias Lenz, Xiang Lu, Günter Rote
      [bibtex]

    • Topologie von Konturen d-dimensionaler Funktionen
      Technischer Bericht B 03-17, Freie Universität Berlin, Oct 2003.
      Tobias Lenz
      Doktorandenworkshop des Instituts für Informatik der FU
      [bibtex]

    • Untere Schranken für den Vergleich geometrischer Formen mit Hilfe von Referenzpunkten
      In Doktoranden-Workshop der FU Berlin, 2003.
      Oliver Klein
      Technical Report
      [bibtex]

    Computergrafik und digitale Kartographie

    • Entwurf und Implementierung echtzeitfähiger Renderingverfahren zur nicht-realistischen Darstellung digitaler Geländemodelle (Design and Implementation of Real-Time Rendering Techniques for the Non-Realistic Illustration of Digital Terrain Models)
      Diplomarbeit, Fachbereich Mathematik und Informatik, Universität Münster, 2003.
      Kevin Buchin
      [bibtex]

    • E}ntwurf und {I}mplementierung echtzeitfähiger nicht-photorealistischer {R}enderingverfahren für 3D-{Stadtmodelle (Design and Implementation of Real-Time Non-Photorealistic Rendering Techniques for 3D City Models)
      Diplomarbeit, Fachbereich Mathematik und Informatik, Universität Münster, 2003.

      [bibtex]

    • Real-time per-pixel rendering with stroke textures
      In Proceedings of the 19th spring conference on Computer graphics (SCCG '03), Seiten 125–129, ACM Press, New York, NY, USA, Budmerice, Slovakia, 2003.
      Kevin Buchin, Maike Walther
      isbn: 1-58113-861-X
      [bibtex]

    • Hatching, Stroke Styles & Pointillism
      Band ShaderX2 - Shader Tips and Tricks, Kapitel Rendering Techniques, Herausgeber Wolfgang Engel, Wordware Publishing, September 2003.
      Kevin Buchin, Maike Walther
      [bibtex]

    • Real-Time Expressive Rendering of City Models
      In Proceedings of the Seventh International Conference on Information Visualization (IV '03), Seiten 245 – 251, IEEE Computer Society, 2003.

      [bibtex]

    Herausgegebene Veröffentlichungen

    • STACS 2003
      Proceedings of the 20th Annual Symposium on Theoretical Aspects of Computer Science held at the Freie Universität Berlin, Berlin, February 27–March 1, 2003
      Lecture Notes in Computer Science, Band 2607, Springer-Verlag, Berlin, 2003.
      Herausgeber: Helmut Alt, Michel Habib
      [bibtex]

    Geometrische Muster- und Formenerkennung

    • Computing the Hausdorff distance of geometric patterns and shapes
      In Discrete and Computational Geometry. The Goodman–Pollack Festschrift, Algorithms and Combinatorics, Band 25, Seiten 65–76, Herausgeber B. Aronov and S. Basu and J. Pach and M. Sharir, Springer, Berlin, 2003.
      Helmut Alt, Peter Braß, Michael Godau, Christian Knauer, Carola Wenk
      Special Issue: The Goodman-Pollack-Festschrift (B. Aronov, S. Basu, J. Pach, M. Sharir eds.)
      [bibtex] [ps.gz]

    • The Area of Overlap of two Unions of Convex Objects under Translation
      Technischer Bericht UU-CS-2003-025, 2003.
      Mark de Berg, Panos Giannopoulos, Christian Knauer, René van Oostrum, Remco Veltkamp
      [bibtex]

    Geometrie

    • Pursuit-evasion with imprecise target location
      In Proceedings of the 14th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), Baltimore, Seiten 747-753, 2003.
      Günter Rote
      [bibtex]

    • Planar minimally rigid graphs and pseudo-triangulations
      In Proceedings of the Nineteenth Annual Symposium on Computational Geometry, San Diego, Seiten 154-163, Association for Computing Machinery, 2003.
      Ruth Haas, David Orden, Günter Rote, Francisco Santos, Brigitte Servatius, Herman Servatius, Diane Souvaine, Ileana Streinu, Walter Whiteley
      [bibtex] [pdf] [pdf]

    • Pursuit-evasion with imprecise target location
      In Proceedings of the 14th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), Baltimore, Seiten 747-753, 2003.
      Günter Rote
      [bibtex]

    • Expansive motions and the polytope of pointed pseudo-triangulations
      Discrete and Computational Geometry–The Goodman-Pollack Festschrift, Band 25, Seiten 699-736, 2003.
      Günter Rote, Francisco Santos, Ileana Streinu
      [bibtex] [pdf] [pdf.gz] [ps.gz]

    Geschichte der Informatik

    • Konrad Zuses Plankalkül – Seine Genese und eine moderne Implementierung
      In Geschichten der Informatik: Visionen, Paradigmen, Leitmotive, Seiten 215–236, Herausgeber Hans D. Hellige, Springer, 2003.
      Gerald Friedland, Cüneyt Göktekin, Mike Krüger, Denis Kuniß, Olaf Langmack, Raúl Rojas, Ludmila Scharf
      Springer
      [bibtex]

    Arbeitsgruppe
    Mitglieder
    Drittmittelprojekte
    Stipendien- programme
    Veröffentlichungen
    Arbeiten
    Veranstaltungen
    Photo Album
    Impressum