Klaus Kriegel
[bibtex]Combinatorial Geometry
On the Number of Cycles in Planar Graphs
In Proc. 13th International Computing and Combinatorics Conference (COCOON), Pages 97–107, 2007.
Kevin Buchin, Christian Knauer, Klaus Kriegel, André Schulz, Raimund Seidel
[bibtex] [ps] [pdf]
Computational Geometry
Efficient Dynamical Computation of Principal Components
In Proceedings of International Conference on Computer Graphics Theory and Applications - GRAPP, Pages 85–93, Vilamoura, Portugal, 2011.
Darko Dimitrov, Mathias Holst, Christian Knauer, Klaus Kriegel
[bibtex]Bounds on the quality of the PCA bounding boxes
Computational Geometry, Volume 42 (8), Pages 772-789, October 2009.
Darko Dimitrov, Christian Knauer, Klaus Kriegel, Günter Rote
Special Issue on the 23rd European Workshop on Computational Geometry
[bibtex]Closed-Form Solutions for Continuous PCA and Bounding Box Algorithms
A. Ranchordas et al. (Eds.): VISIGRAPP 2008, CCIS , Springer, Volume 2, Pages 26–40, 2009.
Darko Dimitrov, Mathias Holst, Christian Knauer, Klaus Kriegel
[bibtex]Computing Principal Components Dynamically
CoRR, Volume abs/0912.5380, 2009.
Darko Dimitrov, Mathias Holst, Christian Knauer, Klaus Kriegel
[bibtex]Experimental Study of Bounding Box Algorithms
In Proceedings of International Conference on Computer Graphics Theory and Applications - GRAPP, Pages 15–22, Funchal, Portugal, 2008.
Darko Dimitrov, Mathias Holst, Christian Knauer, Klaus Kriegel
[bibtex]Detection of Perfect and Approximate Reflective Symmetry in Arbitrary Dimension
In Proceedings of International Conference on Computer Vision Theory and Applications - VISAPP 2007, Pages 128–136, Barcelona, Spain, 2007.
Darko Dimitrov, Klaus Kriegel
[bibtex]Upper and Lower Bounds on the Quality of the PCA Bounding Boxes
In Proceedings of the International Conference in Central Europe on Computer Graphics, Visualization and Computer Vision - WSCG 2007, Pages 185–192, Plzen, Czech Republic, 2007.
Darko Dimitrov, Christian Knauer, Klaus Kriegel, Günter Rote
[bibtex]New Upper Bounds on the Quality of the PCA Bounding Boxes in R^2 and R^3
In Proc. 23rd ACM Symp. on Computational Geometry, Pages 275–283, ACM, Gyeongju, South Korea, 2007.
Darko Dimitrov, Christian Knauer, Klaus Kriegel, Günter Rote
[bibtex]New Upper Bounds on the Quality of the PCA Bounding Boxes in R^2 and R^3 (Extended Abstract)
In Proceedings of the 23rd European Workshop on Computational Geometry (EWCG), Pages 122–125, Graz, Austria, 2007.
Darko Dimitrov, Christian Knauer, Klaus Kriegel, Günter Rote
[bibtex]Vertex Guards in Rectilinear Polygons with Holes
In The Kyoto International Conference on Computational Geometry and Graph Theory (Abstracts), Pages Session 04A, 2 pages, Kyoto, Japan, 2007.
Frank Hoffmann, Klaus Kriegel, Csaba Toth
[bibtex]On the Bounding Boxes Obtained by Principal Component Analysis
In Proc. 22nd European Workshop on Computational Geometry, Pages 193–196, Delphi, Greece, 2006.
Darko Dimitrov, Christian Knauer, Klaus Kriegel, Günter Rote
[bibtex]Upper and Lower Bounds on the Quality of the PCA Bounding Boxes
Technical Report B 06-10, Freie Universität Berlin, September 2006.
Darko Dimitrov, Christian Knauer, Klaus Kriegel, Günter Rote
[bibtex] [pdf]Covering with Ellipses
Algorithmica, Volume 38 (1), 2003.
Alon Efrat, Frank Hoffmann, Christian Knauer, Klaus Kriegel, Günter Rote, Carola Wenk
Special Issue on Shape Algorithmics
[bibtex]Covering shapes by ellipses
In Proceedings of the 13th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), San Francisco, Pages 453-454, San Francisco, USA, 2002.
Alon Efrat, Frank Hoffmann, Christian Knauer, Klaus Kriegel, Günter Rote, Carola Wenk
[bibtex]Covering with Ellipses
Technical Report 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), Pages 114-123, Montreal, Canada, 2001.
Alon Efrat, Frank Hoffmann, Klaus Kriegel, Christof Schultz, Carola Wenk
[bibtex]Triangles in Euclidean Arrangements
Discrete and Computational Geometry, Volume 22, Pages 429-438, 1999.
Stefan Felsner, Klaus Kriegel
[bibtex] [ps.gz]A Simple and Robust Geometric Algorithm for Landmark Registration in Computer Assisted Neurosurgery
Technical Report B 99-21, Freie Universität Berlin, Fachbereich Mathematik und Informatik, Germany, December 1999.
Frank Hoffmann, Klaus Kriegel, Sven Schönherr, Carola Wenk
[bibtex] [ps.gz]Triangles in Euclidean Arrangements
In Proceedings WG'98, Springer Lecture Notes in Computer Science 1517, Lecture Notes in Comput. Sci., Volume 1517, Pages 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, Pages 71-82, Stockholm, 1998.
Frank Hoffmann, Christian Icking, Rolf Klein, Klaus Kriegel
[bibtex]The Polygon Exploration Problem II : The Angle Hull
Technical Report 245, Fernuniversität Hagen, Praktische Informatik VI, 1998.
Frank Hoffmann, Christian Icking, Rolf Klein, Klaus Kriegel
[bibtex] [pdf]Triangles in Euclidean Arrangements
Technical Report B 97-09, Freie Universität Berlin, 1997.
Stefan Felsner, Klaus Kriegel
[bibtex] [ps.gz]Generalized guarding and partitioning for rectilinear polygons
Coputational Geometry: Theory and Applictions, Volume 6, Pages 21-44, 1996.
Ervin Györi, Frank Hoffmann, Klaus Kriegel, Tom Shermer
[bibtex]A graph coloring result and its consequences for polygon guarding problems
SIAM Journal on Discrete Mathematics, Volume 9(2), Pages 210-224, Hong Kong, 1996.
Frank Hoffmann, Klaus Kriegel
[bibtex]Generalized guarding and partitioning for rectilinear polygons
In Proceedings CCCG'94, Pages 302-307, Saskatoon, 1994.
Ervin Györi, Frank Hoffmann, Klaus Kriegel, Tom Shermer
[bibtex]A graph coloring result and its consequences for polygon guarding problems
In Proceedings ISAAC'93, Pages 78-87, Hong Kong, 1993.
Frank Hoffmann, Klaus Kriegel
[bibtex]
Geometric Shape and Pattern Matching
Minimizing the weighted directed Hausdorff distance between colored point sets under translations and rigid motions
In Proceedings of the 25th European Workshop on Computational Geometry (EuroCG), Brussels, Belgium, March 2009.
Christian Knauer, Klaus Kriegel, Fabian Stehn
[bibtex] [pdf]Minimizing the weighted directed Hausdorff distance between colored point sets under translations and rigid motions
In Proc. Frontiers in Algorithmics Workshop, Lecture Notes in Computer Science, Volume 5598, Pages 108–119, Springer, Hefei, China, 2009.
Christian Knauer, Klaus Kriegel, Fabian Stehn
[bibtex] [pdf]Approximate point-to-surface registration with a single characteristic point
In Proceedings of International Conference on Computer Vision Theory and Applications - VISAPP, Pages 188-195, Funchal, Portugal, 2008.
Darko Dimitrov, Christian Knauer, Klaus Kriegel, Fabian Stehn
[bibtex]Approximation algorithms for a point-to-surface registration problem in medical navigation
In Proc. Frontiers in Algorithmics Workshop, Lecture Notes in Computer Science, Volume 4613, Pages 26–37, Springer, Lanzhou, China, 2007.
Darko Dimitrov, Christian Knauer, Klaus Kriegel, Fabian Stehn
[bibtex]Registration of 3D - Patterns and Shapes with Characteristic Points
In Proceedings of International Conference on Computer Vision Theory and Applications - VISAPP 2006, Pages 393–400, Setùbal, Portugal, 2006.
Darko Dimitrov, Christian Knauer, Klaus Kriegel
[bibtex]Matching surfaces with characteristic points
In Proceedings of the 21st European Workshop on Computational Geometry (EWCG), Pages 49–51, Eindhoven, Netherlands, 2005.
Darko Dimitrov, Christian Knauer, Klaus Kriegel
[bibtex]Ein neuer algorithmischer Ansatz zur Fluoroskopie-basierten Neuronavigation
In Proceedings Workshop Bildverarbeitung für die Medizin (BVM) 2004, Springer, Berlin, Germany, 2004.
Robert Günzler, Frank Hoffmann, Christian Knauer, Klaus Kriegel, Sven Schönherr, Udo Warschewske
[bibtex]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]An applied point pattern matching problem: comparing 2D patterns of protein spots
Discrete Applied Mathematics, Volume 93, Pages 75-88, 1999.
Frank Hoffmann, Klaus Kriegel, Carola Wenk
[bibtex]New algorithmic approaches to protein spot detection and pattern matching in two-dimensional electrophoresis gel databases
Electrophoresis, Volume 20, Pages 755-765, 1999.
Helmut Alt, Eckart Fleck, Frank Hoffmann, Klaus Kriegel, Helmut Oswald, Klaus-Peter Pleißner, Anders Sahlströhm, Susan Wegner, Carola Wenk
[bibtex]Matching 2D patterns of protein spots
In Proceedings SoCG'98, Pages 231-239, Minneapolis, 1998.
Frank Hoffmann, Klaus Kriegel, Carola Wenk
[bibtex]Matching 2D patterns of protein spots
Technical Report B 97-13, Institut für Informatik, FU Berlin, 1997.
Frank Hoffmann, Klaus Kriegel, Carola Wenk
[bibtex]
Graph Theory and Algorithms
On the Number of Simple Cycles in Planar Graphs
In Springer Lecture Notes in Computer Science, Volume 1335, Pages 15-24, Proceedings, Workshop on Graph-Theoretic Concepts in Computer Science - WG '97, Berlin, 1997.
Helmut Alt, Ulrich Fuchs, Klaus Kriegel
[bibtex]
Medical Image Processing
Ein neues algorithmisches Verfahren zur Fluoroskopie-basierten Neuronavigation
In Proceedings Workshop Bildverarbeitung für die Medizin (BVM) 2004, Springer, Berlin, Germany, 2004.
Robert Günzler, Frank Hoffmann, Christian Knauer, Klaus Kriegel, Sven Schönherr, Udo Warschewske
[bibtex]
Online Algorithms
The Polygon Exploration Problem
SIAM Journal on Computing, Volume 31(2), Pages 577-600, 2001.
Frank Hoffmann, Christian Icking, Rolf Klein, Klaus Kriegel
[bibtex]The Polygon Exploration Problem I : A Competitive Strategy
Technical Report 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, Pages 211-222, A K Peters, Natick, Massachusetts, Houston, 1998.
Frank Hoffmann, Christian Icking, Rolf Klein, Klaus Kriegel
[bibtex]A Competitive Strategy for Learning a Polygon
In Proceedings SODA'97, Pages 166-174, New Orleans, 1997.
Frank Hoffmann, Christian Icking, Rolf Klein, Klaus Kriegel
[bibtex]