K
Klaus Kriegel
Researcher at Free University of Berlin
Publications - 52
Citations - 806
Klaus Kriegel is an academic researcher from Free University of Berlin. The author has contributed to research in topics: Polygon & Simple polygon. The author has an hindex of 16, co-authored 52 publications receiving 783 citations.
Papers
More filters
Journal ArticleDOI
The Polygon Exploration Problem
TL;DR: An on-line strategy that enables a mobile robot with vision to explore an unknown simple polygon is presented and it is proved that the resulting tour is less than 26.5 times as long as the shortest watchman tour that could be computed off-line.
Journal ArticleDOI
New algorithmic approaches to protein spot detection and pattern matching in two-dimensional electrophoresis gel databases.
Klaus-Peter Pleißner,Frank Hoffmann,Klaus Kriegel,Carola Wenk,Susan Wegner,Anders Sahlström,H. Oswald,Helmut Alt,Eckart Fleck +8 more
TL;DR: An algorithm is developed based on a combination of hierarchical watershed transformation and feature extraction methods that reduces the strong over‐segmentation of spot regions normally produced by watershed transformation in two‐dimensional electrophoresis gels.
Book ChapterDOI
On the number of cycles in planar graphs
TL;DR: It is shown that there is no planar graph with more than 2.8927n simple cycles and it is proved that 2.3404n is an upper bound for the number of Hamiltonian cycles.
Journal ArticleDOI
Geometric algorithms for the analysis of 2D-electrophoresis gels.
TL;DR: The development of the analysis software CAROl at Freie Universität Berlin has reconsidered the two problems of identifying protein spots and computing a matching between two images and obtained new solutions which rely on methods from computational geometry.
Proceedings ArticleDOI
A competitive strategy for learning a polygon
TL;DR: This paper is the first to describe a complete strategy and to give a proof for such a constant competitive factor for a mobile robot with vision to explore an unknown simple polygon starting from and returning to a given point on the boundary.