Helmut Alt

Publication Activity (10 Years)

Years Active: 1975-2021
Publications (10 Years): 15

Top Venues

CoRR

ISAAC

Int. J. Comput. Geom. Appl.

J. Comput. Geom.

Saarland University, Saarbrücken, Germany (PHD)

Education History

Saarland University, Saarbrücken, Germany

PHD

Publications

Helmut Alt, Otfried Cheong, Ji-won Park, Nadja Seiferth
Packing 2D disks into a 3D container. CoRR (2021)
Hee-Kap Ahn, Helmut Alt, Maike Buchin, Eunjin Oh, Ludmila Scharf, Carola Wenk
Middle curves based on discrete Fréchet distance. Comput. Geom. 89 (2020)
Helmut Alt, Otfried Cheong, Ji-won Park, Nadja Scharf
Packing 2D Disks into a 3D Container. WALCOM (2019)
Helmut Alt, Nadja Scharf
Approximating Smallest Containers for Packing Three-Dimensional Convex Objects. Int. J. Comput. Geom. Appl. 28 (2) (2018)
Helmut Alt, Kevin Buchin, Steven Chaplick, Otfried Cheong, Philipp Kindermann, Christian Knauer, Fabian Stehn
Placing your coins on a shelf. J. Comput. Geom. 9 (1) (2018)
Helmut Alt, Sergio Cabello, Panos Giannopoulos, Christian Knauer
Minimum Cell Connection in Line Segment Arrangements. Int. J. Comput. Geom. Appl. 27 (3) (2017)
Helmut Alt, Kevin Buchin, Steven Chaplick, Otfried Cheong, Philipp Kindermann, Christian Knauer, Fabian Stehn
Placing your Coins on a Shelf. ISAAC (2017)
Helmut Alt, Mark de Berg, Christian Knauer
Approximating Minimum-Area Rectangular and Convex Containers for Packing Convex Polygons. J. Comput. Geom. 8 (1) (2017)
Helmut Alt, Kevin Buchin, Steven Chaplick, Otfried Cheong, Philipp Kindermann, Christian Knauer, Fabian Stehn
Placing your Coins on a Shelf. CoRR (2017)
Helmut Alt, Michael S. Payne, Jens M. Schmidt, David R. Wood
Thoughts on Barnette's Conjecture. Australas. J Comb. 64 (2016)
Helmut Alt, Nadja Scharf
Approximating Smallest Containers for Packing Three-Dimensional Convex Objects. ISAAC (2016)
Helmut Alt
Computational Aspects of Packing Problems. Bull. EATCS 118 (2016)
Helmut Alt, Nadja Scharf
Approximating Smallest Containers for Packing Three-dimensional Convex Objects. CoRR (2016)
Dongwoo Park, Sang Won Bae, Helmut Alt, Hee-Kap Ahn
Bundling three convex polygons to minimize area or perimeter. Comput. Geom. 51 (2016)
Hee-Kap Ahn, Helmut Alt, Maike Buchin, Eunjin Oh, Ludmila Scharf, Carola Wenk
A Middle Curve Based on Discrete Fréchet Distance. LATIN (2016)
Helmut Alt, Mark de Berg, Christian Knauer
Approximating Minimum-Area Rectangular and Convex Containers for Packing Convex Polygons. ESA (2015)
Helmut Alt, Esther M. Arkin, Alon Efrat, George Hart, Ferran Hurtado, Irina Kostitsyna, Alexander Kröller, Joseph S. B. Mitchell, Valentin Polishchuk
Scandinavian Thins on Top of Cake: New and Improved Algorithms for Stacking and Packing. Theory Comput. Syst. 54 (4) (2014)
Hee-Kap Ahn, Helmut Alt, Sang Won Bae, Dongwoo Park
Bundling Three Convex Polygons to Minimize Area or Perimeter. WADS (2013)
Helmut Alt, Ludmila Scharf
Computation of the Hausdorff distance between sets of line segments in parallel CoRR (2012)
Helmut Alt, Ludmila Scharf
Shape matching by random sampling. Theor. Comput. Sci. 442 (2012)
Helmut Alt, Sergio Cabello, Panos Giannopoulos, Christian Knauer
Minimum cell connection and separation in line segment arrangements CoRR (2011)
Helmut Alt, Ludmila Scharf, Daria Schymura
Probabilistic matching of planar regions. Comput. Geom. 43 (2) (2010)
Helmut Alt, Maike Buchin
Can We Compute the Similarity between Surfaces? Discret. Comput. Geom. 43 (1) (2010)
Helmut Alt, Hans L. Bodlaender, Marc J. van Kreveld, Günter Rote, Gerard Tel
Wooden Geometric Puzzles: Design and Hardness Proofs. Theory Comput. Syst. 44 (2) (2009)
Helmut Alt
The Computational Geometry of Comparing Shapes. Efficient Algorithms (2009)
Hee-Kap Ahn, Helmut Alt, Tetsuo Asano, Sang Won Bae, Peter Brass, Otfried Cheong, Christian Knauer, Hyeon-Suk Na, Chan-Su Shin, Alexander Wolff
Constructing Optimal Highways. Int. J. Found. Comput. Sci. 20 (1) (2009)
Helmut Alt, Ludmila Scharf, Daria Schymura
Probabilistic Matching of Planar Regions CoRR (2009)
Helmut Alt, Ludmila Scharf
Shape Matching by Random Sampling. WALCOM (2009)
Pankaj Kumar Agarwal, Helmut Alt, Monique Teillaud
09111 Abstracts Collection - Computational Geometry. Computational Geometry (2009)
Helmut Alt, Ludmila Scharf
Computing the Hausdorff Distance between Curved Objects. Int. J. Comput. Geom. Appl. 18 (4) (2008)
Hee-Kap Ahn, Helmut Alt, Tetsuo Asano, Sang Won Bae, Peter Brass, Otfried Cheong, Christian Knauer, Hyeon-Suk Na, Chan-Su Shin, Alexander Wolff
Constructing Optimal Highways. CATS (2007)
Helmut Alt, Maike Buchin
Can we Compute the Similarity Between Surfaces? CoRR (2007)
Helmut Alt, Hans L. Bodlaender, Marc J. van Kreveld, Günter Rote, Gerard Tel
Wooden Geometric Puzzles: Design and Hardness Proofs. FUN (2007)
Hee-Kap Ahn, Helmut Alt, Tetsuo Asano, Sang Won Bae, Peter Brass, Otfried Cheong, Christian Knauer, Hyeon-Suk Na, Chan-Su Shin, Alexander Wolff
Constructing Optimal Highways CoRR (2007)
Helmut Alt, Ludmila Scharf, Sven Scholz
Probabilistic matching and resemblance evaluation of shapes in trademark images. CIVR (2007)
Helmut Alt, Esther M. Arkin, Hervé Brönnimann, Jeff Erickson, Sándor P. Fekete, Christian Knauer, Jonathan Lenchner, Joseph S. B. Mitchell, Kim Whittlesey
Minimum-cost coverage of point sets by disks. SCG (2006)
Helmut Alt, Otfried Cheong, Antoine Vigneron
The Voronoi Diagram of Curved Objects. Discret. Comput. Geom. 34 (3) (2005)
Helmut Alt
Foreword. Theory Comput. Syst. 38 (2) (2005)
Helmut Alt, Maike Buchin
Semi-computability of the Fréchet distance between surfaces. EuroCG (2005)
Helmut Alt, Christian Knauer, Carola Wenk
Comparison of Distance Measures for Planar Curves. Algorithmica 38 (1) (2004)
Helmut Alt, Alon Efrat, Günter Rote, Carola Wenk
Matching planar maps. J. Algorithms 49 (2) (2003)
Helmut Alt, Marc Glisse, Xavier Goaoc
On the worst-case complexity of the silhouette of a polytope. CCCG (2003)
Carola Wenk, Helmut Alt, Alon Efrat, Lingeshwaran Palaniappan, Günter Rote
Finding a curve in a map. SCG (2003)
Helmut Alt, Christian Knauer, Günter Rote, Sue Whitesides
The complexity of (un)folding. SCG (2003)
Helmut Alt, Alon Efrat, Günter Rote, Carola Wenk
Matching planar maps. SODA (2003)
Helmut Alt, Laura Heinrich-Litan
Nearest Neighbor Search in High Dimensions. SCG (2001)
Helmut Alt, Christian Knauer, Carola Wenk
Matching Polygonal Curves with Respect to the Fréchet Distance. STACS (2001)
Helmut Alt
The Nearest Neighbor. Computational Discrete Mathematics (2001)
Helmut Alt, Ferran Hurtado
Packing Convex Polygons into Rectangular Boxes. JCDCG (2000)
Helmut Alt, Stefan Felsner, Ferran Hurtado, Marc Noy, Emo Welzl
A class of point-sets with few k-sets. Comput. Geom. 16 (2) (2000)
Helmut Alt, Ulrich Fuchs, Klaus Kriegel
On The Number Of Simple Cycles In Planar Graphs. Comb. Probab. Comput. 8 (5) (1999)
Helmut Alt, Michael Godau, Sue Whitesides
Universal 3-dimensional visibility representations for graphs. Comput. Geom. 9 (1-2) (1998)
Helmut Alt, Stefan Felsner, Ferran Hurtado, Marc Noy
-Sets. SCG (1998)
Helmut Alt, Ulrich Fuchs, Günter Rote, Gerald Weber
Matching Convex Shapes with Respect to the Symmetric Difference. Algorithmica 21 (1) (1998)
Helmut Alt, Emo Welzl, Barbara Wolfers
Piecewise Linear Approximation of Bézier-Curves. SCG (1997)
Helmut Alt, Ulrich Fuchs, Klaus Kriegel
On the Number of Simple Cycles in Planar Graphs. WG (1997)
Oswin Aichholzer, Helmut Alt, Günter Rote
Matching Shapes with a Reference Point. Int. J. Comput. Geom. Appl. 7 (4) (1997)
Helmut Alt, Ulrich Fuchs, Günter Rote, Gerald Weber
Matching Convex Shapes with Respect to the Symmetric Difference. ESA (1996)
Helmut Alt, Leonidas J. Guibas, Kurt Mehlhorn, Richard M. Karp, Avi Wigderson
A Method for Obtaining Randomized Algorithms with Small Tail Probabilities. Algorithmica 16 (4/5) (1996)
Helmut Alt, Michael Godau, Sue Whitesides
Universal 3-Dimensional Visibility Representations for Graphs. Graph Drawing (1995)
Helmut Alt, Otfried Schwarzkopf
The Voronoi Diagram of Curved Objects. SCG (1995)
Helmut Alt, Bernd Behrends, Johannes Blömer
Approximate Matching of Polygonal Shapes. Ann. Math. Artif. Intell. 13 (3-4) (1995)
Helmut Alt, David Hsu, Jack Snoeyink
Computing the largest inscribed isothetic rectangle. CCCG (1995)
Helmut Alt, Michael Godau
Computing the Fréchet distance between two polygonal curves. Int. J. Comput. Geom. Appl. 5 (1995)
Helmut Alt, Oswin Aichholzer, Günter Rote
Matching Shapes with a Reference Point. SCG (1994)
Gerald Weber, Lars Knipping, Helmut Alt
An Application of Point Pattern Matching in Astronautics. J. Symb. Comput. 17 (4) (1994)
Helmut Alt, Rudolf Fleischer, Michael Kaufmann, Kurt Mehlhorn, Stefan Näher, Stefan Schirra, Christian Uhrig
Approximate Motion Planning and the Complexity of the Boundary of the Union of Simple Geometric Figures. Algorithmica 8 (5&6) (1992)
Helmut Alt, Johannes Blömer
Resemblance and Symmetries of Geometric Patterns. Data Structures and Efficient Algorithms (1992)
Helmut Alt, Michael Godau
Measuring the Resemblance of Polygonal Curves. SCG (1992)
Helmut Alt, Viliam Geffert, Kurt Mehlhorn
A Lower Bound for the Nondeterministic Space Complexity of Context-Free Recognition. Inf. Process. Lett. 42 (1) (1992)
Helmut Alt, Bernd Behrends, Johannes Blömer
Approximate Matching of Polygonal Shapes (Extended Abstract). SCG (1991)
Helmut Alt, Norbert Blum, Kurt Mehlhorn, Markus Paul
Computing a Maximum Cardinality Matching in a Bipartite Graph in Time O(^1.5 sqrt m/log n). Inf. Process. Lett. 37 (4) (1991)
Helmut Alt, Rudolf Fleischer, Michael Kaufmann, Kurt Mehlhorn, Stefan Näher, Stefan Schirra, Christian Uhrig
Approximate Motion Planning and the Complexity of the Boundary of the Union of Simple Geometric Figures. SCG (1990)
Helmut Alt, Johannes Blömer, Hubert Wagener
Approximation of Convex Polygons. ICALP (1990)
Chee-Keng Yap, Helmut Alt
Motion Planning in the CL-Environment (Extended Abstract). WADS (1989)
Helmut Alt, Emo Welzl
Visibility graphs and obstacle-avoiding shortest paths. ZOR Methods Model. Oper. Res. 32 (3-4) (1988)
Helmut Alt
Comparing the combinational complexities of arithmetic functions. J. ACM 35 (2) (1988)
Helmut Alt, Hubert Wagener
Approximation of Polygons by Rechtangles and Circles. Bull. EATCS 36 (1988)
Helmut Alt, Kurt Mehlhorn, Hubert Wagener, Emo Welzl
Congruence, Similarity, and Symmetries of Geometric Objects. Discret. Comput. Geom. 3 (1988)
Kurt Mehlhorn, Stefan Näher, Helmut Alt
A Lower Bound on the Complexity of the Union-Split-Find Problem. SIAM J. Comput. 17 (6) (1988)
Helmut Alt, Torben Hagerup, Kurt Mehlhorn, Franco P. Preparata
Deterministic Simulation of Idealized Parallel Computers on more Realistic Ones. Parallel Algorithms and Architectures (1987)
Kurt Mehlhorn, Stefan Näher, Helmut Alt
A Lower Bound for the Complexity of the Union-Split-Find Problem. ICALP (1987)
Helmut Alt, Kurt Mehlhorn, Hubert Wagener, Emo Welzl
Congruence, Similarity, and Symmetries of Geometric Objects. SCG (1987)
Helmut Alt, Torben Hagerup, Kurt Mehlhorn, Franco P. Preparata
Deterministic Simulation of Idealized Parallel Computers on More Realistic Ones. SIAM J. Comput. 16 (5) (1987)
Helmut Alt, Torben Hagerup, Kurt Mehlhorn, Franco P. Preparata
Deterministic Simulation of Idealized Parallel Computers on More Realistic Ones. MFCS (1986)
Helmut Alt
Multiplication is the Easiest Nontrivial Arithmetic Function. Theor. Comput. Sci. 36 (1985)
Helmut Alt, Kurt Mehlhorn
Searching Semisorted Tables. SIAM J. Comput. 14 (4) (1985)
Helmut Alt
Comparison of Arithmetic Functions with Respect to Boolean Circuit Depth (Extended Abstract) STOC (1984)
Helmut Alt, Kurt Mehlhorn, J. Ian Munro
Partial Match Retrieval in Implicit Data Structures. Inf. Process. Lett. 19 (2) (1984)
Helmut Alt
Multiplication Is the Easiest Nontrivial Arithmetic Function FOCS (1983)
Helmut Alt, Jan van Leeuwen
The complexity of basic complex operations. Computing 27 (3) (1981)
Helmut Alt, Kurt Mehlhorn, J. Ian Munro
Partial Match Retrieval in Implicit Data Structures. MFCS (1981)
Helmut Alt
Functions Equivalent to Integer Multiplication. ICALP (1980)
Helmut Alt, Jan van Leeuwen
The complexity of complex division (extended abstract). FCT (1979)
Helmut Alt
Square rooting is as difficult as multiplication. Computing 21 (3) (1979)
Helmut Alt, Kurt Mehlhorn
Complexity arguments in algebraic language theory. RAIRO Theor. Informatics Appl. 13 (3) (1979)
Helmut Alt
Lower Bounds on Space Complexity for Contextfree Recognition. Acta Informatica 12 (1979)
Helmut Alt
Eine untere Schranke für den Platzbedarf bei der Analyse beschränkter kontextfreier Sprachen. Theoretical Computer Science (1977)
Helmut Alt, Kurt Mehlhorn
Lower Bounds for the Space Complexity of Context-Free Recognition. ICALP (1976)
Helmut Alt, Kurt Mehlhorn
A language over a one symbol alphabet requiring only O (log log n) space. SIGACT News 7 (4) (1975)

Helmut Alt.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Helmut Alt