Helmut Alt | Academic Influence

Helmut Alt's AcademicInfluence.com Rankings

Helmut Alt

Computer Science

#4408

World Rank

#4643

Historical Rank

computer-science Degrees

Helmut Alt

Mathematics

#6740

World Rank

#9284

Historical Rank

Geometry

#142

World Rank

#212

Historical Rank

Measure Theory

#3406

World Rank

#4021

Historical Rank

mathematics Degrees

Download Badge

Computer Science
Mathematics

Helmut Alt's Degrees

PhD Computer Science University of Bonn

Similar Degrees You Can Earn

Best Online PhD of Computer Science (Doctorates) 2025

Why Is Helmut Alt Influential?

(Suggest an Edit or Addition)

According to Wikipedia, Helmut Alt is a German computer scientist whose research concerns graph algorithms and computational geometry. He is known for his work on matching geometric shapes, including methods for efficiently computing the Fréchet distance between shapes. He was also the first to use the German phrase "Algorithmische Geometrie" [algorithmic geometry] to refer to computational geometry. He is a professor of computer science at the Free University of Berlin.

(See a Problem?)

Helmut Alt's Published Works

Number of citations in a given year to any of this author's works

Total number of citations to an author for the works they published in a given year. This highlights publication of the most important work(s) by the author

Published Works

Computing the Fréchet distance between two polygonal curves (1995) (942)
Congruence, similarity, and symmetries of geometric objects (1987) (293)
Discrete Geometric Shapes: Matching, Interpolation, and Approximation (2000) (234)
Matching planar maps (2003) (227)
Approximate matching of polygonal shapes (1995) (222)
Computing a Maximum Cardinality Matching in a Bipartite Graph in Time O(^1.5 sqrt m/log n) (1991) (175)
Comparison of Distance Measures for Planar Curves (2003) (107)
Deterministic Simulation of Idealized Parallel Computers on More Realistic Ones (1986) (104)
The Voronoi Diagram of Curved Objects (1995) (101)
Minimum-cost coverage of point sets by disks (2006) (98)
Matching Polygonal Curves with Respect to the Fréchet Distance (2001) (98)
Measuring the resemblance of polygonal curves (1992) (93)
New algorithmic approaches to protein spot detection and pattern matching in two‐dimensional electrophoresis gel databases (1999) (88)
Matching shapes with a reference point (1994) (83)
Approximate motion planning and the complexity of the boundary of the union of simple geometric figures (1990) (79)
The Computational Geometry of Comparing Shapes (2009) (71)
Computing the Hausdorff Distance of Geometric Patterns and Shapes (2003) (66)
Matching Convex Shapes with Respect to the Symmetric Difference (1996) (66)
Discrete Geometric Shapes Matching Interpolation and Approximation A Survey (2009) (64)
Approximate Matching of Polygonal Shapes (Extended Abstract) (1991) (62)
Can We Compute the Similarity between Surfaces? (2007) (57)
Visibility graphs and obstacle-avoiding shortest paths (1988) (54)
Approximation of Convex Polygons (1990) (45)
Computational Discrete Mathematics (2001) (40)
Computing the Hausdorff Distance between Curved Objects (2008) (38)
Universal 3-dimensional visibility representations for graphs (1995) (37)
Computing the largest inscribed isothetic rectangle (1994) (33)
A Lower Bound for the Complexity of the Union-Split-Find Problem (1987) (33)
A Lower Bound on the Complexity of the Union-Split-Find Problem (1988) (31)
A method for obtaining randomized algorithms with small tail probabilities (1996) (27)
Lower Bounds for the Space Complexity of Context-Free Recognition (1976) (26)
An Application of Point Pattern Matching in Astronautics (1994) (25)
A language over a one symbol alphabet requiring only O (log log n) space (1975) (23)
Packing Convex Polygons into Rectangular Boxes (2000) (23)
Partial Match Retrieval in Implicit Data Structures (1981) (22)
A Lower Bound for the Nondeterministic Space Complexity of Context-Free Recognition (1992) (20)
Constructing Optimal Highways (2007) (19)
Semi-computability of the Fréchet distance between surfaces (2005) (18)
Comparing the combinational complexities of arithmetic functions (1988) (17)
On the Number of Simple Cycles in Planar Graphs (1997) (17)
Efficient Algorithms, Essays Dedicated to Kurt Mehlhorn on the Occasion of His 60th Birthday (2009) (17)
Multiplication is the easiest nontrivial arithmetic function (1983) (16)
Approximating Minimum-Area Rectangular and Convex Containers for Packing Convex Polygons (2020) (15)
The complexity of (un)folding (2003) (14)
Comparison of arithmetic functions with respect to boolean circuit depth (1984) (13)
On the worst-case complexity of the silhouette of a polytope (2003) (13)
Square rooting is as difficult as multiplication (1979) (13)
Computational Aspects of Packing Problems (2016) (13)
Probabilistic matching of planar regions (2009) (11)
Shape matching by random sampling (2009) (11)
Probabilistic matching of sets of polygonal curves (2006) (10)
Probabilistic matching and resemblance evaluation of shapes in trademark images (2007) (9)
Resemblance and Symmetries of Geometric Patterns (1992) (9)
Motion Planning in the CL-Environment (Extended Abstract) (1989) (8)
Minimum Cell Connection in Line Segment Arrangements (2017) (8)
Bundling Three Convex Polygons to Minimize Area or Perimeter (2013) (8)
Computational Discrete Mathematics: advanced lectures (2001) (8)
On the Complexity of the Linkage Reconguration Problem (2003) (8)
Minimum cell connection and separation in line segment arrangements (2011) (7)
Discrete geometric shapes (1996) (7)
A Middle Curve Based on Discrete Fréchet Distance (2016) (7)
Lower bounds on space complexity for contextfree recognition (1979) (6)
Searching Semisorted Tables (1985) (6)
Algorithmic aspects of motion planning: Part 2 (1990) (6)
Computing the depth of an arrangement of axis-aligned rectangles in parallel ∗ (2010) (6)
Functions Equivalent to Integer Multiplication (1980) (6)
Exact L∞ nearest neighbor search in high dimensions (2001) (6)
STACS 2003: 20th Annual Symposium on Theoretical Aspects of Computer Science, Berlin, Germany, February 27 - March 1, 2003. Proceedings (2003) (6)
The complexity of basic complex operations (1981) (5)
Nearest Neighbor Search in High Dimensions (5)
Thoughts on Barnette's Conjecture (2013) (4)
The economics of wind energy within the generation mix (2005) (4)
Point-sets with few k-sets (1998) (4)
Approximating Smallest Containers for Packing Three-Dimensional Convex Objects (2016) (4)
A class of point-sets with few k-sets (2000) (4)
The Nearest Neighbor (2001) (4)
Packing 2D Disks into a 3D Container (2018) (4)
Wooden Geometric Puzzles: Design and Hardness Proofs (2007) (3)
Middle curves based on discrete Fréchet distance (2020) (3)
Algorithms for square root extraction (1977) (3)
Computation of the Hausdorff distance between sets of line segments in parallel (2012) (2)
Piecewise linear approximation of Be´zier-curves (1997) (2)
Approximation of Polygons by Rechtangles and Circles (1988) (1)
Finding a curve in a map (2003) (1)
How to Water Carrots : Geometric Coverage Problems for Point Sets (2005) (1)
Complexity arguments in algebraic language theory (1979) (1)
On the Complexity of the Linkage Recon guration Problem (1)
Exact L infty Nearest Neighbor Search in High Dimensions. (2001) (1)
Probabilistic Matching of polygons ∗ (2007) (1)
Scandinavian Thins on Top of Cake: New and Improved Algorithms for Stacking and Packing (2014) (1)
The complexity of complex division (extended abstract) (1979) (1)
A process for preparing cyclopentadiene derivatives (1992) (0)
Scandinavian Thins on Top of Cake: New and Improved Algorithms for Stacking and Packing (2013) (0)
09111 Abstracts Collection - Computational Geometry (2009) (0)
Metallocene and use thereof as polymerization catalyst (1995) (0)
Solving order constraints in logarithmic space (2003) (0)
Approximating the Packing of Unit Disks into Simple Containers∗ (2020) (0)
STACS 2002 : 19th Annual Symposium on Theoretical Aspects of Computer Science, Antibes - Juan les Pins, France, March 14-16, 2002 : proceedings (2002) (0)
Storage area network optimization (2000) (0)
Computational Geometry (Dagstuhl Seminar 9511) (2021) (0)
SERIE B INFORMATIK Universal Dimensional Visibility Representations for Graphs (2009) (0)
Process and reactor apparatus for degradation of elastomers (1995) (0)
On the Complexity of the Linkage Recon(cid:12)guration Problem (cid:3) (2003) (0)
SERIE B INFORMATIK Matching Convex Shapes With Respect to the Symmetric Di erence (2009) (0)
Fast Sorting Algorithms (2011) (0)
Placing your Coins on a Shelf (2017) (0)
Motion planning in the CL-environment: A case for a realistic model (invited talk) (1989) (0)
Computational Geometry (Dagstuhl Seminar 9312) (2021) (0)
Computational Geometry (Dagstuhl Seminar 9141) (2021) (0)
Executive Summary Computational Geometry 1 Computational Geometry Evolution (2009) (0)
The use of organometallic fluorenyl compounds (1992) (0)
Algorithmic aspects of motion planning: Part 1 (invited lecture) (1989) (0)

This paper list is powered by the following services:

Other Resources About Helmut Alt

en.wikipedia.org

What Schools Are Affiliated With Helmut Alt?

Helmut Alt is affiliated with the following schools: