Helmut Alt

According to our database1, Helmut Alt authored at least 78 papers between 1976 and 2020.

Collaborative distances:



In proceedings 
PhD thesis 



On csauthors.net:


Middle curves based on discrete Fréchet distance.
Comput. Geom., 2020

Packing 2D Disks into a 3D Container.
Proceedings of the WALCOM: Algorithms and Computation - 13th International Conference, 2019

Placing your coins on a shelf.
JoCG, 2018

Approximating Smallest Containers for Packing Three-Dimensional Convex Objects.
Int. J. Comput. Geom. Appl., 2018

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

Minimum Cell Connection in Line Segment Arrangements.
Int. J. Comput. Geom. Appl., 2017

Computational Aspects of Packing Problems.
Bull. EATCS, 2016

Bundling three convex polygons to minimize area or perimeter.
Comput. Geom., 2016

Thoughts on Barnette's Conjecture.
Australas. J Comb., 2016

A Middle Curve Based on Discrete Fréchet Distance.
Proceedings of the LATIN 2016: Theoretical Informatics, 2016

Scandinavian Thins on Top of Cake: New and Improved Algorithms for Stacking and Packing.
Theory Comput. Syst., 2014

Shape matching by random sampling.
Theor. Comput. Sci., 2012

Computation of the Hausdorff distance between sets of line segments in parallel
CoRR, 2012

Minimum cell connection and separation in line segment arrangements
CoRR, 2011

Fast Sorting Algorithms.
Proceedings of the Algorithms Unplugged, 2011

Can We Compute the Similarity between Surfaces?
Discret. Comput. Geom., 2010

Probabilistic matching of planar regions.
Comput. Geom., 2010

Wooden Geometric Puzzles: Design and Hardness Proofs.
Theory Comput. Syst., 2009

Constructing Optimal Highways.
Int. J. Found. Comput. Sci., 2009

09111 Abstracts Collection - Computational Geometry.
Proceedings of the Computational Geometry, 08.03. - 13.03.2009, 2009

The Computational Geometry of Comparing Shapes.
Proceedings of the Efficient Algorithms, 2009

Schnelle Sortieralgorithmen.
Proceedings of the Taschenbuch der Algorithmen, 2008

Computing the Hausdorff Distance between Curved Objects.
Int. J. Comput. Geom. Appl., 2008

Probabilistic matching and resemblance evaluation of shapes in trademark images.
Proceedings of the 6th ACM International Conference on Image and Video Retrieval, 2007

Minimum-cost coverage of point sets by disks.
Proceedings of the 22nd ACM Symposium on Computational Geometry, 2006

Theory Comput. Syst., 2005

The Voronoi Diagram of Curved Objects.
Discret. Comput. Geom., 2005

Semi-computability of the Fréchet distance between surfaces.
Proceedings of the (Informal) Proceedings of the 21st European Workshop on Computational Geometry, 2005

Comparison of Distance Measures for Planar Curves.
Algorithmica, 2004

Matching planar maps.
J. Algorithms, 2003

Finding a curve in a map.
Proceedings of the 19th ACM Symposium on Computational Geometry, 2003

The complexity of (un)folding.
Proceedings of the 19th ACM Symposium on Computational Geometry, 2003

On the worst-case complexity of the silhouette of a polytope.
Proceedings of the 15th Canadian Conference on Computational Geometry, 2003

Matching Polygonal Curves with Respect to the Fréchet Distance.
Proceedings of the STACS 2001, 2001

Exact Linfty Nearest Neighbor Search in High Dimensions.
Proceedings of the Seventeenth Annual Symposium on Computational Geometry, 2001

The Nearest Neighbor.
Proceedings of the Computational Discrete Mathematics, Advanced Lectures, 2001

A class of point-sets with few k-sets.
Comput. Geom., 2000

Packing Convex Polygons into Rectangular Boxes.
Proceedings of the Discrete and Computational Geometry, Japanese Conference, 2000

Discrete Geometric Shapes: Matching, Interpolation, and Approximation.
Proceedings of the Handbook of Computational Geometry, 2000

On The Number Of Simple Cycles In Planar Graphs.
Comb. Probab. Comput., 1999

Universal 3-dimensional visibility representations for graphs.
Comput. Geom., 1998

Matching Convex Shapes with Respect to the Symmetric Difference.
Algorithmica, 1998

Point-Sets with few k-Sets.
Proceedings of the Fourteenth Annual Symposium on Computational Geometry, 1998

Matching Shapes with a Reference Point.
Int. J. Comput. Geom. Appl., 1997

Piecewise Linear Approximation of Bézier-Curves.
Proceedings of the Thirteenth Annual Symposium on Computational Geometry, 1997

A Method for Obtaining Randomized Algorithms with Small Tail Probabilities.
Algorithmica, 1996

Computing the Fréchet distance between two polygonal curves.
Int. J. Comput. Geom. Appl., 1995

Approximate Matching of Polygonal Shapes.
Ann. Math. Artif. Intell., 1995

The Voronoi Diagram of Curved Objects.
Proceedings of the Eleventh Annual Symposium on Computational Geometry, 1995

Computing the largest inscribed isothetic rectangle.
Proceedings of the 7th Canadian Conference on Computational Geometry, 1995

An Application of Point Pattern Matching in Astronautics.
J. Symb. Comput., 1994

A Lower Bound for the Nondeterministic Space Complexity of Context-Free Recognition.
Inf. Process. Lett., 1992

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

Resemblance and Symmetries of Geometric Patterns.
Proceedings of the Data Structures and Efficient Algorithms, 1992

Measuring the Resemblance of Polygonal Curves.
Proceedings of the Eighth Annual Symposium on Computational Geometry, 1992

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

Approximate Matching of Polygonal Shapes (Extended Abstract).
Proceedings of the Seventh Annual Symposium on Computational Geometry, 1991

Approximation of Convex Polygons.
Proceedings of the Automata, Languages and Programming, 17th International Colloquium, 1990

Motion Planning in the CL-Environment (Extended Abstract).
Proceedings of the Algorithms and Data Structures, 1989

A Lower Bound on the Complexity of the Union-Split-Find Problem.
SIAM J. Comput., 1988

Visibility graphs and obstacle-avoiding shortest paths.
ZOR Methods Model. Oper. Res., 1988

Comparing the combinational complexities of arithmetic functions.
J. ACM, 1988

Approximation of Polygons by Rechtangles and Circles.
Bull. EATCS, 1988

Congruence, Similarity, and Symmetries of Geometric Objects.
Discret. Comput. Geom., 1988

Deterministic Simulation of Idealized Parallel Computers on More Realistic Ones.
SIAM J. Comput., 1987

Multiplication is the Easiest Nontrivial Arithmetic Function.
Theor. Comput. Sci., 1985

Searching Semisorted Tables.
SIAM J. Comput., 1985

Partial Match Retrieval in Implicit Data Structures.
Inf. Process. Lett., 1984

Comparison of Arithmetic Functions with Respect to Boolean Circuit Depth (Extended Abstract)
Proceedings of the 16th Annual ACM Symposium on Theory of Computing, April 30, 1984

The complexity of basic complex operations.
Computing, 1981

Functions Equivalent to Integer Multiplication.
Proceedings of the Automata, 1980

Complexity arguments in algebraic language theory.
RAIRO Theor. Informatics Appl., 1979

Square rooting is as difficult as multiplication.
Computing, 1979

Lower Bounds on Space Complexity for Contextfree Recognition.
Acta Informatica, 1979

The complexity of complex division (extended abstract).
Proceedings of the Fundamentals of Computation Theory, 1979

Eine untere Schranke für den Platzbedarf bei der Analyse beschränkter kontextfreier Sprachen.
Proceedings of the Theoretical Computer Science, 1977

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

Lower Bounds for the Space Complexity of Context-Free Recognition.
Proceedings of the Third International Colloquium on Automata, 1976