Helmut Alt

According to our database, Helmut Alt authored at least 80 papers between 1975 and 2026.

Collaborative distances:

• Dijkstra number of three.
• Erdős number of three.

2026

Packing d-dimensional balls into a d + 1-dimensional container.

Helmut Alt, Sergio Cabello, Otfried Cheong, Ji-won Park, Nadja Seiferth

Comput. Geom., 2026

2020

Middle curves based on discrete Fréchet distance.

Hee-Kap Ahn, Helmut Alt, Maike Buchin, Eunjin Oh, Ludmila Scharf, Carola Wenk

Comput. Geom., 2020

2019

Packing 2D Disks into a 3D Container.

Helmut Alt, Otfried Cheong, Ji-won Park, Nadja Scharf

Proceedings of the WALCOM: Algorithms and Computation - 13th International Conference, 2019

2017

Minimum Cell Connection in Line Segment Arrangements.

Helmut Alt, Sergio Cabello, Panos Giannopoulos, Christian Knauer

Int. J. Comput. Geom. Appl., 2017

Placing your Coins on a Shelf.

Helmut Alt, Kevin Buchin, Steven Chaplick, Otfried Cheong, Philipp Kindermann, Christian Knauer, Fabian Stehn

Proceedings of the 28th International Symposium on Algorithms and Computation, 2017

2016

Computational Aspects of Packing Problems.

Helmut Alt

Bull. EATCS, 2016

Thoughts on Barnette's Conjecture.

Helmut Alt, Michael S. Payne, Jens M. Schmidt, David R. Wood

Australas. J Comb., 2016

A Middle Curve Based on Discrete Fréchet Distance.

Hee-Kap Ahn, Helmut Alt, Maike Buchin, Eunjin Oh, Ludmila Scharf, Carola Wenk

Proceedings of the LATIN 2016: Theoretical Informatics, 2016

Approximating Smallest Containers for Packing Three-Dimensional Convex Objects.

Helmut Alt, Nadja Scharf

Proceedings of the 27th International Symposium on Algorithms and Computation, 2016

2015

Approximating Minimum-Area Rectangular and Convex Containers for Packing Convex Polygons.

Helmut Alt, Mark de Berg, Christian Knauer

Proceedings of the Algorithms - ESA 2015, 2015

2014

Scandinavian Thins on Top of Cake: New and Improved Algorithms for Stacking and Packing.

Helmut Alt, Esther M. Arkin, Alon Efrat, George Hart, Ferran Hurtado, Irina Kostitsyna, Alexander Kröller, Joseph S. B. Mitchell, Valentin Polishchuk

Theory Comput. Syst., 2014

2013

Bundling Three Convex Polygons to Minimize Area or Perimeter.

Hee-Kap Ahn, Helmut Alt, Sang Won Bae, Dongwoo Park

Proceedings of the Algorithms and Data Structures - 13th International Symposium, 2013

2012

Computation of the Hausdorff distance between sets of line segments in parallel

Helmut Alt, Ludmila Scharf

CoRR, 2012

2011

Minimum cell connection and separation in line segment arrangements

Helmut Alt, Sergio Cabello, Panos Giannopoulos, Christian Knauer

CoRR, 2011

Fast Sorting Algorithms.

Helmut Alt

Proceedings of the Algorithms Unplugged, 2011

2010

Can We Compute the Similarity between Surfaces?

Helmut Alt, Maike Buchin

Discret. Comput. Geom., 2010

Probabilistic matching of planar regions.

Helmut Alt, Ludmila Scharf, Daria Schymura

Comput. Geom., 2010

2009

Shape Matching by Random Sampling.

Helmut Alt, Ludmila Scharf

Proceedings of the WALCOM: Algorithms and Computation, Third International Workshop, 2009

09111 Abstracts Collection - Computational Geometry.

Pankaj Kumar Agarwal, Helmut Alt, Monique Teillaud

Proceedings of the Computational Geometry, 08.03. - 13.03.2009, 2009

The Computational Geometry of Comparing Shapes.

Helmut Alt

Proceedings of the Efficient Algorithms, 2009

2008

Schnelle Sortieralgorithmen.

Helmut Alt

Proceedings of the Taschenbuch der Algorithmen, 2008

Computing the Hausdorff Distance between Curved Objects.

Helmut Alt, Ludmila Scharf

Int. J. Comput. Geom. Appl., 2008

2007

Wooden Geometric Puzzles: Design and Hardness Proofs.

Helmut Alt, Hans L. Bodlaender, Marc J. van Kreveld, Günter Rote, Gerard Tel

Proceedings of the Fun with Algorithms, 4th International Conference, 2007

Probabilistic matching and resemblance evaluation of shapes in trademark images.

Helmut Alt, Ludmila Scharf, Sven Scholz

Proceedings of the 6th ACM International Conference on Image and Video Retrieval, 2007

Constructing Optimal Highways.

Hee-Kap Ahn, Helmut Alt, Tetsuo Asano, Sang Won Bae, Peter Brass, Otfried Cheong, Christian Knauer, Hyeon-Suk Na, Chan-Su Shin, Alexander Wolff

Proceedings of the Theory of Computing 2007. Proceedings of the Thirteenth Computing: The Australasian Theory Symposium (CATS2007). January 30, 2007

2006

Minimum-cost coverage of point sets by disks.

Helmut Alt, Esther M. Arkin, Hervé Brönnimann, Jeff Erickson, Sándor P. Fekete, Christian Knauer, Jonathan Lenchner, Joseph S. B. Mitchell, Kim Whittlesey

Proceedings of the 22nd ACM Symposium on Computational Geometry, 2006

2005

Foreword.

Helmut Alt

Theory Comput. Syst., 2005

The Voronoi Diagram of Curved Objects.

Helmut Alt, Otfried Cheong, Antoine Vigneron

Discret. Comput. Geom., 2005

Semi-computability of the Fréchet distance between surfaces.

Helmut Alt, Maike Buchin

Proceedings of the (Informal) Proceedings of the 21st European Workshop on Computational Geometry, 2005

2004

Comparison of Distance Measures for Planar Curves.

Helmut Alt, Christian Knauer, Carola Wenk

Algorithmica, 2004

2003

Matching planar maps.

Helmut Alt, Alon Efrat, Günter Rote, Carola Wenk

Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2003

Finding a curve in a map.

Carola Wenk, Helmut Alt, Alon Efrat, Lingeshwaran Palaniappan, Günter Rote

Proceedings of the 19th ACM Symposium on Computational Geometry, 2003

The complexity of (un)folding.

Helmut Alt, Christian Knauer, Günter Rote, Sue Whitesides

Proceedings of the 19th ACM Symposium on Computational Geometry, 2003

On the worst-case complexity of the silhouette of a polytope.

Helmut Alt, Marc Glisse, Xavier Goaoc

Proceedings of the 15th Canadian Conference on Computational Geometry, 2003

2001

Matching Polygonal Curves with Respect to the Fréchet Distance.

Helmut Alt, Christian Knauer, Carola Wenk

Proceedings of the STACS 2001, 2001

Exact L_infty Nearest Neighbor Search in High Dimensions.

Helmut Alt, Laura Heinrich-Litan

Proceedings of the Seventeenth Annual Symposium on Computational Geometry, 2001

The Nearest Neighbor.

Helmut Alt

Proceedings of the Computational Discrete Mathematics, Advanced Lectures, 2001

2000

A class of point-sets with few k-sets.

Helmut Alt, Stefan Felsner, Ferran Hurtado, Marc Noy, Emo Welzl

Comput. Geom., 2000

Packing Convex Polygons into Rectangular Boxes.

Helmut Alt, Ferran Hurtado

Proceedings of the Discrete and Computational Geometry, Japanese Conference, 2000

Discrete Geometric Shapes: Matching, Interpolation, and Approximation.

Helmut Alt, Leonidas J. Guibas

Proceedings of the Handbook of Computational Geometry, 2000

1998

Point-Sets with few <i>k</i>-Sets.

Helmut Alt, Stefan Felsner, Ferran Hurtado, Marc Noy

Proceedings of the Fourteenth Annual Symposium on Computational Geometry, 1998

1997

On the Number of Simple Cycles in Planar Graphs.

Helmut Alt, Ulrich Fuchs, Klaus Kriegel

Proceedings of the Graph-Theoretic Concepts in Computer Science, 1997

Piecewise Linear Approximation of Bézier-Curves.

Helmut Alt, Emo Welzl, Barbara Wolfers

Proceedings of the Thirteenth Annual Symposium on Computational Geometry, 1997

1996

A Method for Obtaining Randomized Algorithms with Small Tail Probabilities.

Helmut Alt, Leonidas J. Guibas, Kurt Mehlhorn, Richard M. Karp, Avi Wigderson

Algorithmica, 1996

Matching Convex Shapes with Respect to the Symmetric Difference.

Helmut Alt, Ulrich Fuchs, Günter Rote, Gerald Weber

Proceedings of the Algorithms, 1996

1995

Computing the Fréchet distance between two polygonal curves.

Helmut Alt, Michael Godau

Int. J. Comput. Geom. Appl., 1995

Approximate Matching of Polygonal Shapes.

Helmut Alt, Bernd Behrends, Johannes Blömer

Ann. Math. Artif. Intell., 1995

Universal 3-Dimensional Visibility Representations for Graphs.

Helmut Alt, Michael Godau, Sue Whitesides

Proceedings of the Graph Drawing, Symposium on Graph Drawing, 1995

The Voronoi Diagram of Curved Objects.

Helmut Alt, Otfried Schwarzkopf

Proceedings of the Eleventh Annual Symposium on Computational Geometry, 1995

Computing the largest inscribed isothetic rectangle.

Helmut Alt, David Hsu, Jack Snoeyink

Proceedings of the 7th Canadian Conference on Computational Geometry, 1995

1994

An Application of Point Pattern Matching in Astronautics.

Gerald Weber, Lars Knipping, Helmut Alt

J. Symb. Comput., 1994

Matching Shapes with a Reference Point.

Helmut Alt, Oswin Aichholzer, Günter Rote

Proceedings of the Tenth Annual Symposium on Computational Geometry, 1994

1992

A Lower Bound for the Nondeterministic Space Complexity of Context-Free Recognition.

Helmut Alt, Viliam Geffert, Kurt Mehlhorn

Inf. Process. Lett., 1992

Resemblance and Symmetries of Geometric Patterns.

Helmut Alt, Johannes Blömer

Proceedings of the Data Structures and Efficient Algorithms, 1992

Measuring the Resemblance of Polygonal Curves.

Helmut Alt, Michael Godau

Proceedings of the Eighth Annual Symposium on Computational Geometry, 1992

1991

Computing a Maximum Cardinality Matching in a Bipartite Graph in Time O(^1.5 sqrt m/log n).

Helmut Alt, Norbert Blum, Kurt Mehlhorn, Markus Paul

Inf. Process. Lett., 1991

Approximate Matching of Polygonal Shapes (Extended Abstract).

Helmut Alt, Bernd Behrends, Johannes Blömer

Proceedings of the Seventh Annual Symposium on Computational Geometry, 1991

1990

Approximation of Convex Polygons.

Helmut Alt, Johannes Blömer, Hubert Wagener

Proceedings of the Automata, Languages and Programming, 17th International Colloquium, 1990

Approximate Motion Planning and the Complexity of the Boundary of the Union of Simple Geometric Figures.

Helmut Alt, Rudolf Fleischer, Michael Kaufmann, Kurt Mehlhorn, Stefan Näher, Stefan Schirra, Christian Uhrig

Proceedings of the Sixth Annual Symposium on Computational Geometry, 1990

1989

Motion Planning in the CL-Environment (Extended Abstract).

Chee-Keng Yap, Helmut Alt

Proceedings of the Algorithms and Data Structures, 1989

1988

Visibility graphs and obstacle-avoiding shortest paths.

Helmut Alt, Emo Welzl

ZOR Methods Model. Oper. Res., 1988

Comparing the combinational complexities of arithmetic functions.

Helmut Alt

J. ACM, 1988

Approximation of Polygons by Rechtangles and Circles.

Helmut Alt, Hubert Wagener

Bull. EATCS, 1988

1987

Deterministic Simulation of Idealized Parallel Computers on more Realistic Ones.

Helmut Alt, Torben Hagerup, Kurt Mehlhorn, Franco P. Preparata

Proceedings of the Parallel Algorithms and Architectures, 1987

A Lower Bound for the Complexity of the Union-Split-Find Problem.

Kurt Mehlhorn, Stefan Näher, Helmut Alt

Proceedings of the Automata, Languages and Programming, 14th International Colloquium, 1987

Congruence, Similarity, and Symmetries of Geometric Objects.

Helmut Alt, Kurt Mehlhorn, Hubert Wagener, Emo Welzl

Proceedings of the Third Annual Symposium on Computational Geometry, 1987

1985

Searching Semisorted Tables.

Helmut Alt, Kurt Mehlhorn

SIAM J. Comput., 1985

1984

Comparison of Arithmetic Functions with Respect to Boolean Circuit Depth (Extended Abstract)

Helmut Alt

Proceedings of the 16th Annual ACM Symposium on Theory of Computing, April 30, 1984

1983

Multiplication Is the Easiest Nontrivial Arithmetic Function

Helmut Alt

Proceedings of the 24th Annual Symposium on Foundations of Computer Science, 1983

1981

The complexity of basic complex operations.

Helmut Alt, Jan van Leeuwen

Computing, 1981

Partial Match Retrieval in Implicit Data Structures.

Helmut Alt, Kurt Mehlhorn, J. Ian Munro

Proceedings of the Mathematical Foundations of Computer Science 1981, Strbske Pleso, Czechoslovakia, August 31, 1981

1980

Functions Equivalent to Integer Multiplication.

Helmut Alt

Proceedings of the Automata, 1980

1979

Complexity arguments in algebraic language theory.

Helmut Alt, Kurt Mehlhorn

RAIRO Theor. Informatics Appl., 1979

Square rooting is as difficult as multiplication.

Helmut Alt

Computing, 1979

Lower Bounds on Space Complexity for Contextfree Recognition.

Helmut Alt

Acta Informatica, 1979

The complexity of complex division (extended abstract).

Helmut Alt, Jan van Leeuwen

Proceedings of the Fundamentals of Computation Theory, 1979

1977

Eine untere Schranke für den Platzbedarf bei der Analyse beschränkter kontextfreier Sprachen.

Helmut Alt

Proceedings of the Theoretical Computer Science, 1977

1976

Eine untere Schranke für den Platzbedarf bei der Analyse beschränkter kontextfreier Sprachen.

Helmut Alt

PhD thesis, 1976

Lower Bounds for the Space Complexity of Context-Free Recognition.

Helmut Alt, Kurt Mehlhorn

Proceedings of the Third International Colloquium on Automata, 1976

1975

A language over a one symbol alphabet requiring only O (log log n) space.

Helmut Alt, Kurt Mehlhorn

SIGACT News, 1975