FU Logo
Institute of Computer Science
123123

2000

[bibtex]

    Computational Geometry

    • A class of point-sets with few k-sets
      Comp. Geom. Theory and Appl., Volume 16, Pages 95-101, 2000.
      Helmut Alt, Stefan Felsner, Ferran Hurtado, Marc Noy, Emo Welzl
      [bibtex] [ps.gz]

    • Fast enumeration of point-hyperplane incidences
      Technical Report B 00-13, Freie Universität Berlin, Fachbereich Mathematik und Informatik, 2000.
      Peter Braß, Christian Knauer
      [bibtex] [ps.gz]

    • Euklidische und Nicht-Euklidische Geometrie in Cinderella
      Journal für Mathematikdidaktik, Volume 22, Pages 303-324, 2000.
      Ulrich Kortenkamp, Jürgen Richter-Gebert
      [bibtex]

    Dynamic Geometry

    • Foundations of Dynamic Geometry
      Journal für Mathematikdidaktik, Volume 21 (2), Pages 161-162, 2000.
      Ulrich Kortenkamp
      [bibtex]

    • Decision Complexity in Dynamic Geometry - Extended Abstract
      In Proceedings of ADG 2000, International Workshop on Automatic Deduction in Geometry, Volume 3, Pages 216-220, 2000.
      Ulrich Kortenkamp, Jürgen Richter-Gebert
      [bibtex]

    • Euklidische und Nicht-Euklidische Geometrie in Cinderella
      Journal für Mathematikdidaktik, Volume 22, Pages 303-324, 2000.
      Ulrich Kortenkamp, Jürgen Richter-Gebert
      [bibtex]

    • Complexity issues in Dynamic Geometry
      Freie Universität Berlin, 2000.
      Ulrich Kortenkamp, Jürgen Richter-Gebert
      [bibtex]

    • Dynamic Aspects in Computational Geometry
      In Proceedings of the EACA 2000, Barcelona, pp 51-61., Editor(s) Antonio Montes, 2000.
      Ulrich Kortenkamp, Jürgen Richter-Gebert
      [bibtex]

    Educational Software

    • Internetfähige Software fürs Lernen im 21. Jahrhundert
      FU-Nachrichten, June 2000.
      Ulrich Kortenkamp
      [bibtex]

    • Kontinuität in Dynamischer Geometrie
      In Beiträge zum Mathematikunterricht, Pages 358-361, Franzbecker, 2000.
      Ulrich Kortenkamp
      [bibtex]

    • Die interaktive Geometry-Software Cinderella
      Springer-Verlag, Heidelberg, December 2000.
      Ulrich Kortenkamp, Jürgen Richter-Gebert
      [bibtex]

    • Cinderella - die interaktive Geometriesoftware
      HEUREKA-Klett Softwareverlag, Stuttgart, January 2000.
      Ulrich Kortenkamp, Jürgen Richter-Gebert
      [bibtex]

    • Cinderella - Nachmittagssoftware im Unterricht?
      Rundgang, June 2000.
      Ulrich Kortenkamp, Jürgen Richter-Gebert
      [bibtex] [pdf]

    Geometric Shape and Pattern Matching

    • Exact point pattern matching and the number of congruent triangles in a threedimensional point set
      In ESA 2000 – European Symposium on Algorithms, Lecture Notes in Computer Science, Volume 1879, Pages 112-119, Editor(s) M. Paterson, Springer-Verlag, 2000.
      Peter Braß
      [bibtex]

    • Geometrie in der Mustererkennung
      In Mathematik - Interdisziplinär, Pages 67-75, Editor(s) J. Flachsmeyer and R. Fritsch and H.-C. Reichel, Shaker Verlag, 2000.
      Peter Braß
      [bibtex]

    • Testing the congruence of d-dimensional point sets
      In Proc. 16th Annu. ACM Symp. on Computational Geometry, Pages 310-314, 2000.
      Peter Braß, Christian Knauer
      [bibtex] [ps.gz]

    • Testing the congruence of d-dimensional point sets (Extended Abstract)
      In Proceedings of the Sixteenth European Workshop on Computational Geometry, Eilat, Israel, Pages 104-107, 2000.
      Peter Braß, Christian Knauer
      [bibtex] [ps.gz]

    • An alternative approach to deal with geometric uncertainties in computer analysis of two-dimensional electrophoresis gels
      Electrophoresis, Volume 21, Pages 2637-2640, 2000.
      Eckart Fleck, Frank Hoffmann, Klaus Kriegel, Helmut Oswald, Vera Regitz-Zagrosek, Christof Schultz, Ingo Seefeldt, Carola Wenk
      [bibtex]

    Geometry

    • A central limit theorem for convex chains in the square
      Discrete and Computational Geometry, Volume 23, Pages 35-50, 2000.
      Imre Bárány, Günter Rote, William Steiger, Cun-Hui Zhang
      [bibtex] [pdf] [ps.gz]

    • Straightening polygonal arcs and convexifying polygonal cycles
      In Proceedings of the 41st Annual Symposium on Foundations of Computer Science, Redondo Beach, California, Pages 432-442, IEEE Computer Society Press, 2000.
      Robert Connelly, Erik D. Demaine, Günter Rote
      [bibtex] [pdf] [ps.gz]

    • Upper bounds on the maximal number of facets of 0/1-polytopes
      European Journal of Combinatorics, Volume 21, Pages 121-130, 2000.
      Tamás Fleiner, Volker Kaibel, Günter Rote
      [bibtex] [pdf] [ps.gz]

    Graph Theory and Algorithms

    • Storage Area Network Optimization: Final Report
      Technical Report B 00-18, Freie Universität Berlin, 2000.
      Helmut Alt, Stefan Felsner, Ludmila Scharf
      [bibtex] [ps.gz]

    • Division-free algorithms for determinants and Pfaffians: algebraic and combinatorial approaches
      In Computational Discrete Mathematics, Pages 59-75, Editor(s) Helmut Alt, July 2000.
      Günter Rote
      [bibtex] [pdf] [ps.gz]

    Work Group
    Members
    Projects
    Scholarship Programs
    Publications
    Theses
    Events
    Photo Album
    Impressum