1998

Algorithmische Geometrie

• Point-sets with few k-sets
  In Proc. ACM Symposium on Computational Geometry, Seiten 200-205, 1998.
  Helmut Alt, Stefan Felsner, Ferran Hurtado, Marc Noy
  [bibtex] [ps.gz]

• On the diameter of sets with maximum number of unit distances
  Geombinatorics, Band 8, Seiten 149-153, 1998.
  Peter Braß
  appeared also as preprint Freie Universität Berlin, Fachbereich Mathematik und Informatik Serie B 98-02
  [bibtex]

• Extremal orthoposets without forbidden substructures
  Int. J. Theoretical Physics, Band 38, Seiten 3-9, 1998.
  Peter Braß
  [bibtex]

• Triangles in Euclidean Arrangements
  In Proceedings WG'98, Springer Lecture Notes in Computer Science 1517, Lecture Notes in Comput. Sci., Band 1517, Seiten 137-148, Smolenice, 1998.
  Stefan Felsner, Klaus Kriegel
  [bibtex] [ps.gz]

• Moving an angle around a region
  In Proceedings SWAT'98, Springer Lecture Notes in Computer Science 1432, Seiten 71-82, Stockholm, 1998.
  Frank Hoffmann, Christian Icking, Rolf Klein, Klaus Kriegel
  [bibtex]

• The Polygon Exploration Problem II : The Angle Hull
  Technischer Bericht 245, Fernuniversität Hagen, Praktische Informatik VI, 1998.
  Frank Hoffmann, Christian Icking, Rolf Klein, Klaus Kriegel
  [bibtex] [pdf]

Geometrische Muster- und Formenerkennung

• Matching convex shapes with respect to the symmetric difference
  Algorithmica, Band 21, Seiten 89-103, 1998.
  Helmut Alt, Ulrich Fuchs, Günter Rote, Gerald Weber
  [bibtex] [pdf] [ps.gz]

• Matching 2D patterns of protein spots
  In Proceedings SoCG'98, Seiten 231-239, Minneapolis, 1998.
  Frank Hoffmann, Klaus Kriegel, Carola Wenk
  [bibtex]

Graphentheorie und Algorithmen

• The Maximum Number of Edges in a Graph of Bounded Dimension, with Applications to Ring Theory
  Technischer Bericht B 98-10, Freie Universität Berlin, 1998.
  Geir Agnarsson, Stefan Felsner, William T. Trotter
  [bibtex] [ps.gz]

• Universal 3-Dimensional Visibility Representations for Graphs
  Computational Geometry: Theory and Applications, Band 9, Seiten 111-125, 1998.
  Helmut Alt, Michael Godau, Sue Whitesides
  [bibtex]

Online Algorithmen

• The Polygon Exploration Problem I : A Competitive Strategy
  Technischer Bericht 241, Fernuniversität Hagen, Praktische Informatik VI, 1998.
  Frank Hoffmann, Christian Icking, Rolf Klein, Klaus Kriegel
  [bibtex] [pdf]

• The Polygon Exploration Problem: A New Strategy and a New Analysis Technique
  In Proceedings WAFR'98, Seiten 211-222, A K Peters, Natick, Massachusetts, Houston, 1998.
  Frank Hoffmann, Christian Icking, Rolf Klein, Klaus Kriegel
  [bibtex]