Helmut Alt
Helmut Alt
Verified email at mi.fu-berlin.de
Cited by
Cited by
Computing the Fréchet distance between two polygonal curves
H Alt, M Godau
International Journal of Computational Geometry & Applications 5 (01n02), 75-91, 1995
Discrete geometric shapes: Matching, interpolation, and approximation
H Alt, LJ Guibas
Handbook of computational geometry, 121-153, 2000
Congruence, similarity, and symmetries of geometric objects
H Alt, K Mehlhorn, H Wagener, E Welzl
Discrete & Computational Geometry 3 (3), 237-256, 1988
Approximate matching of polygonal shapes
H Alt, B Behrends, J Blömer
Annals of Mathematics and Artificial Intelligence 13 (3), 251-265, 1995
Matching planar maps
H Alt, A Efrat, G Rote, C Wenk
Journal of algorithms 49 (2), 262-283, 2003
Computing a maximum cardinality matching in a bipartite graph in time o (n1. 5mlog n)
H Alt, N Blum, K Mehlhorn, M Paul
Information Processing Letters 37 (4), 237-240, 1991
Measuring the resemblance of polygonal curves
H Alt, M Godau
Proceedings of the eighth annual symposium on Computational geometry, 102-109, 1992
The Voronoi diagram of curved objects
H Alt, O Cheong, A Vigneron
Discrete & Computational Geometry 34 (3), 439-453, 2005
Deterministic simulation of idealized parallel computers on more realistic ones
H Alt, T Hagerup, K Mehlhorn, FP Preparata
SIAM Journal on Computing 16 (5), 808-835, 1987
Comparison of distance measures for planar curves
H Alt, C Knauer, C Wenk
Algorithmica 38 (1), 45-58, 2004
Matching polygonal curves with respect to the Fréchet distance
H Alt, C Knauer, C Wenk
Annual Symposium on Theoretical Aspects of Computer Science, 63-74, 2001
New algorithmic approaches to protein spot detection and pattern matching in two‐dimensional electrophoresis gel databases
KP Pleißner, F Hoffmann, K Kriegel, C Wenk, S Wegner, A Sahlström, ...
ELECTROPHORESIS: An International Journal 20 (4‐5), 755-765, 1999
Minimum-cost coverage of point sets by disks
H Alt, EM Arkin, H Brönnimann, J Erickson, SP Fekete, C Knauer, ...
Proceedings of the twenty-second annual symposium on Computational geometry …, 2006
Matching shapes with a reference point
O Aichholzer, H Alt, G Rote
International Journal of Computational Geometry & Applications 7 (04), 349-363, 1997
Approximate motion planning and the complexity of the boundary of the union of simple geometric figures
H Alt, R Fleischer, M Kaufmann, K Mehlhorn, S Näher, S Schirra, C Uhrig
Algorithmica 8 (1), 391-406, 1992
Computing the Hausdorff distance of geometric patterns and shapes
H Alt, P Braß, M Godau, C Knauer, C Wenk
Discrete and computational geometry, 65-76, 2003
The computational geometry of comparing shapes
H Alt
Efficient Algorithms, 235-248, 2009
Visibility graphs and obstacle-avoiding shortest paths
H Alt, E Welzl
Zeitschrift für Operations-Research 32 (3-4), 145-164, 1988
Car or public transport—two worlds
H Bast
Efficient Algorithms, 355-367, 2009
Approximation of convex polygons
H Alt, J Blömer, H Wagener
International Colloquium on Automata, Languages, and Programming, 703-716, 1990
The system can't perform the operation now. Try again later.
Articles 1–20