Helmut Alt
[bibtex]Kombinatorische Geometrie
Wooden Geometric Puzzles: Design and Hardness Proofs
In Fun with Algorithms 4th International Conference (FUN2007), Lecture Notes in Computer Science, Seiten 16-29, Springer Berlin / Heidelberg, Castiglioncello, Italy, June 2007.
Helmut Alt, Hans L. Bodlaender, Marc J. van Kreveld, Günter Rote, Gerard Tel
[bibtex]
Arithmetische Komplexität
Comparing the combinational complexities of arithmetic functions
J. ACM, Band 35, Seiten 447-460, 1988.
Helmut Alt
[bibtex]
Komplexitätstheorie
On the Complexity of the Linkage Reconfiguration Problem
In Towards a Theory of Geometric Graphs, Seiten 1–14, Herausgeber Janos Pach, American Mathematical Society, 2004.
Helmut Alt, Christian Knauer, Günter Rote, Sue Whitesides
[bibtex]Nondeterministic Space Complexity for the Recognition of Context-Free Languages.
Inform. Process. Lett., Band 42, Seiten 25-27, 1992.
Helmut Alt, Viliam Geffert, Kurt Mehlhorn
[bibtex]Nondeterministic Space Complexity for the Recognition of Context-Free Languages
Inform. Process. Lett., Band 42, Seiten 25-27, 1992.
Helmut Alt, Viliam Geffert, Kurt Mehlhorn
[bibtex]
Algorithmische Geometrie
Parallel Computation of the Hausdorff Distance between Shapes
In Proceedings of the 29th European Workshop on Computational Geometry (EuroCG), Seiten 47–50, March 2013.
Helmut Alt, Ludmila Scharf
Proceedings URL
[bibtex]Can We Compute the Similarity between Surfaces?
Discrete and Computational Geometry, Band 43 (1), Seiten 78–99, 2010.
Helmut Alt, Maike Buchin
[bibtex]Computing the depth of an arrangement of axis-aligned rectangles in parallel
In Proceedings of the 26th European Workshop on Computational Geometry (EuroCG), Seiten 33–36, Dortmund, Germany, March 2010.
Helmut Alt, Ludmila Scharf
[bibtex]Constructing Optimal Highways
Internat. J. Found. Comput. Sci., Band 20 (1), Seiten 3–23, 2009.
Hee-Kap Ahn, Helmut Alt, Tetsuo Asano, Sang Won Bae, Peter Braß, Otfried Cheong, Christian Knauer, Hyeon-Suk Na, Chan-Su Shin, Alexander Wolff
[doi]
[bibtex]Wooden Geometric Puzzles: Design and Hardness Proofs
Theory Comput. Syst., Band 44, Seiten 160–174, 2009.
Helmut Alt, Hans Bodlaender, Marc van Kreveld, Günter Rote, Gerard Tel
[bibtex]The Computational Geometry of Comparing Shapes
In Efficient Algorithms, Band LNCS 5760, Seiten 235–248, Herausgeber Susanne Albers, Helmut Alt, Stefan Näher, Springer Berlin / Heidelberg, 2009.
Helmut Alt
Essays Dedicated to Kurt Mehlhorn on the Occasion of His 60th Birthday
SpringerLink
[bibtex]Wooden Geometric Puzzles: Design and Hardness Proofs
Theory of Computing Systems, 2008.
Helmut Alt, Hans Bodlaender, Marc van Kreveld, Günter Rote, Gerard Tel
[bibtex]Can we Compute the Similarity Between Surfaces?
Seiten pp. 21, 2007.
Helmut Alt, Maike Buchin
http://www.citebase.org/abstract?id=oai:arXiv.org:cs/0703011
[bibtex]Constructing Optimal Highways
In Thirteenth Computing: The Australasian Theory Symposium (CATS2007), CRPIT, Band 65, Seiten 7-14, Herausgeber Joachim Gudmundsson, Barry Jay, ACS, Ballarat, Australia, 2007.
Hee-Kap Ahn, Helmut Alt, Tetsuo Asano, Sang Won Bae, Peter Braß, Otfried Cheong, Christian Knauer, Hyeon-Suk Na, Chan-Su Shin, Alexander Wolff
[bibtex]Minimum-Cost Coverage of Point Sets by Disks
In Proc. 22nd Annual ACM Symposium on Computational Geometry, Seiten 449-458, Sedona (Arizona), USA, 2006.
Helmut Alt, E. M. Arkin, H. Brönnimann, Jeff Erickson, S. P. Fekete, Christian Knauer, L. Lenchner and J. S. B. Mitchell, Kim Whittlesey
[bibtex]The Voronoi diagram of curved objects
Discrete & Computational Geometry, Band 34, Seiten 439-453, 2005.
Helmut Alt, Otfried Cheong, Antoine Vigneron
[bibtex]Semi-Computability of the Fr\'echet Distance between Surfaces
In Proceedings of the 21st European Workshop on Computational Geometry (EWCG), Seiten 45 – 48, Eindhoven, Netherlands, 2005.
Helmut Alt, Maike Buchin
[bibtex]Matching planar maps
In Proceedings of the 14th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), Baltimore, Seiten 589-598, 2003.
Helmut Alt, Alon Efrat, Günter Rote, Carola Wenk
[bibtex] [pdf] [ps.gz]On the worst-case complexity of the silhouette of a polytope
In Proceedings of the 15th Canadian Conference on Computational Geometry, 2003.
Helmut Alt, Marc Glisse, Xavier Goaoc
[bibtex]Finding a curve in a map (Video)
In Proceedings of the Nineteenth Annual Symposium on Computational Geometry, San Diego, Seiten 384-385, Association for Computing Machinery, 2003.
Helmut Alt, Alon Efrat, Lingeshwaran Palaniappan, Günter Rote, Carola Wenk
[bibtex] [pdf] [ps.gz]The Complexity of (Un)folding
In 19th ACM Symposium on Computational Geometry, Seiten 164-170, 2003.
Helmut Alt, Christian Knauer, Günter Rote, Sue Whitesides
[bibtex] [ps.gz]Matching planar maps
J. of Algorithms, Seiten 262-283, 2003.
Helmut Alt, Alon Efrat, Günter Rote, Carola Wenk
[bibtex] [pdf] [ps.gz]The nearest neighbor
In Computational Discrete Mathematics, Lecture Notes in Computer Science, Band 2122, Seiten 13–24, Springer, 2001.
Helmut Alt
[bibtex]Exact Linfty-Nearest Neighbor Search in High Dimensions
In Proceedings of the 17th ACM Symposium on Computational Geometry, Seiten 157-163, Association for Computing Machinery, June 2001.
Helmut Alt, Laura Heinrich-Litan
[bibtex]Packing Convex Polygons into Rectangular Boxes
In Japanese Conference on Discrete and Computational Geometry 2000, Lecture Notes in Computer Science, Band 2098, Seiten 67-80, Herausgeber J. Akiyama and M. Kano and M. Urabe, Springer-Verlag, 2001.
Helmut Alt, Ferran Hurtado
[bibtex]A class of point-sets with few k-sets
Comp. Geom. Theory and Appl., Band 16, Seiten 95-101, 2000.
Helmut Alt, Stefan Felsner, Ferran Hurtado, Marc Noy, Emo Welzl
[bibtex] [ps.gz]Point-sets with few k-sets
In Proc. ACM Symposium on Computational Geometry, Seiten 200-205, 1998.
Helmut Alt, Stefan Felsner, Ferran Hurtado, Marc Noy
[bibtex] [ps.gz]Point-sets with few k-sets
Technischer Bericht B 97-10, Freie Universität Berlin, 1997.
Helmut Alt, Stefan Felsner, Ferran Hurtado, Marc Noy
[bibtex] [ps.gz]Piecewise Linear Approximation of Bézier-Curves
In Proc. 13th Annu. ACM Sympos. Comput. Geom., Seiten 433-435, 1997.
Helmut Alt, Emo Welzl, Barbara Wolfers
[bibtex]Computing the Largest Inscribed Isothetic Rectangle
In Proc. 7th Canad. Conf. Comput. Geom., Seiten 67-72, 1995.
Helmut Alt, David Hsu, Jack Snoeyink
[bibtex]The Voronoi diagram of curved objects
In Proc. 11th Annu. ACM Sympos. Comput. Geom., Seiten 89-97, 1995.
Helmut Alt, Otfried Cheong (geb. Schwarzkopf)
[bibtex]Approximation of convex polygons
In Proc. 17th Internat. Colloq. Automata Lang. Program., Lecture Notes Comput. Sci., Band 443, Seiten 703-716, Springer-Verlag, 1990.
Helmut Alt, Johannes Blömer, Michael Godau, Hubert Wagener
[bibtex]
Datenstrukturen
A lower bound on the complexity of the union-split-find problem
SIAM J. Comput., Band 17, Seiten 1093-1102, 1988.
Helmut Alt, Kurt Mehlhorn, Stefan Näher
[bibtex]
Diskrete Mathematik
Computational Discrete Mathematics, Advanced Lectures (Ed.)
Lecture Notes in Computer Science, Band 2122, Springer, 2001.
Helmut Alt
ISBN: 3-540-42775-9
[bibtex]
Herausgegebene Veröffentlichungen
Efficient Algorithms
Band LNCS 5760, Springer Berlin / Heidelberg, 2009.
Herausgeber: Susanne Albers, Helmut Alt, Stefan Näher
Essays Dedicated to Kurt Mehlhorn on the Occasion of His 60th Birthday
SpringerLink
[bibtex]Theory of Computing Systems
Band 38 (2), Springer New York, 2005.
Herausgeber: Helmut Alt
[bibtex]Special Issue with selected contributions from STACS 2002
Theory of Computing Systems, Band 37, 2004.
Helmut Alt, Jerome Durand-Lose, Eds.
[bibtex]STACS 2003
Proceedings of the 20th Annual Symposium on Theoretical Aspects of Computer Science held at the Freie Universität Berlin, Berlin, February 27–March 1, 2003
Lecture Notes in Computer Science, Band 2607, Springer-Verlag, Berlin, 2003.
Herausgeber: Helmut Alt, Michel Habib
[bibtex]STACS 2002
Proceedings of the 19th Annual Symposium on Theoretical Aspects of Computer Science held in Antibes-Juan les Pins, March 14–16, 2002
Lecture Notes in Computer Science, Band 2285, Springer-Verlag, Berlin, 2002.
Herausgeber: Helmut Alt, Afonso Ferreira
[bibtex]Computational Discrete Mathematics: advanced lectures
Lecture Notes In Computer Science, Springer-Verlag New York, Inc., 2001.
Herausgeber: Helmut Alt
[bibtex]
Geometrische Optimierungsprobleme
Matching shapes with a reference point
International Journal on Computational Geometry and Applications, Band 7, Seiten 349-363, 1997.
Oswin Aichholzer, Helmut Alt, Günter Rote
[bibtex] [pdf] [ps.gz]Matching shapes with a reference point
In Proceedings of the Tenth Annual Symposium on Computational Geometry, Stony Brook, New York, Seiten 85-92, Association for Computing Machinery, 1994.
Oswin Aichholzer, Helmut Alt, Günter Rote
[bibtex] [pdf] [ps.gz]
Geometrische Muster- und Formenerkennung
Shape Matching by Random Sampling
Theoretical Computer Science, Band 442, Seiten 2–12, 2012.
Helmut Alt, Ludmila Scharf
[doi]
[bibtex]Computation of the Hausdorff distance between sets of line segments in parallel
CoRR, Band abs/1207.3962, 2012.
Helmut Alt, Ludmila Scharf
[arxiv]
[bibtex]Probabilistic Matching of Planar Regions
Computational Geometry, Theory and Applications (CGTA), Band 43 (2), Seiten 99–114, 2010.
Helmut Alt, Ludmila Scharf, Daria Schymura
Special Issue on the 24th European Workshop on Computational Geometry (EuroCG'08)
view at ScienceDirect
[bibtex]Shape matching by random sampling
In 3rd Annual Workshop on Algorithms and Computation (WALCOM 2009), Lecture Note in Computer Science, Band 5431, Seiten 381–393, Herausgeber S. Das and R. Uehara, Springer-Verlag Berlin Heidelberg, 2009.
Helmut Alt, Ludmila Scharf
[bibtex] [pdf]Probabilistic Matching of Planar Regions
CoRR, Band abs/0902.4337, 2009.
Helmut Alt, Ludmila Scharf, Daria Schymura
[Eprint:arXiv:0902.4337]
[bibtex]Shape matching by random sampling
Technischer Bericht B 08-02, Freie Universität Berlin, 2008.
Helmut Alt, Ludmila Scharf
[bibtex] [pdf]Computing the Hausdorff Distance between Curved Objects
Int. J. Comput. Geometry Appl., Band 18 (4), Seiten 307–320, August 2008.
Helmut Alt, Ludmila Scharf
[bibtex] [pdf]Probabilistic Matching of Polygons
In Proceedings of the 24th European Workshop on Computational Geometry (EuroCG), Seiten 255–258, Nancy, France, March 2008.
Helmut Alt, Ludmila Scharf, Daria Schymura
[bibtex] [pdf]Probabilistic Matching and Resemblance Evaluation of Shapes in Trademark Images
In Proceedings of the ACM International Conference on Image and Video Retrieval (CIVR), Seiten 533–540, Amsterdam, The Netherlands, July 2007.
Helmut Alt, Ludmila Scharf, Sven Scholz
[bibtex] [pdf]Probabilistic matching of sets of Polygonal curves
In Proceedings of the 22nd European Workshop on Computational Geometry (EWCG), Seiten 107–110, Delphi, Greece, March 2006.
Helmut Alt, Ludmila Scharf, Sven Scholz
[bibtex] [pdf]Computing the Hausdorff Distance between Curved Objects
In Proceedings of the 2nd International Symposium on Voronoi Diagrams in Science and Engineering, Seiten 196-204, Hanyang University, Seoul, Korea, October 2005.
Helmut Alt, Ludmila Scharf
[bibtex]Comparison of distance measures for planar curves
Algorithmica, Band 38 (1), Seiten 45-58, 2004.
Helmut Alt, Christian Knauer, Carola Wenk
Special Issue on Shape Algorithmics
[bibtex]Computing the Hausdorff distance between curved objects
In Proceedings of the 20th European Workshop on Computational Geometry (EWCG), Seville, Spain, Seiten 233 - 236, 2004.
Helmut Alt, Ludmila Scharf
[bibtex] [ps.gz]Computing the Hausdorff distance of geometric patterns and shapes
In Discrete and Computational Geometry. The Goodman–Pollack Festschrift, Algorithms and Combinatorics, Band 25, Seiten 65–76, Herausgeber B. Aronov and S. Basu and J. Pach and M. Sharir, Springer, Berlin, 2003.
Helmut Alt, Peter Braß, Michael Godau, Christian Knauer, Carola Wenk
Special Issue: The Goodman-Pollack-Festschrift (B. Aronov, S. Basu, J. Pach, M. Sharir eds.)
[bibtex] [ps.gz]Computing the Hausdorff distance of geometric patterns and shapes
Technischer Bericht B 01-07, Freie Universität Berlin, Fachbereich Mathematik und Informatik, 2001.
Helmut Alt, Peter Braß, Michael Godau, Christian Knauer, Carola Wenk
[bibtex]Comparison of distance measures for geometric shapes
Technischer Bericht B 01-09, Freie Universität Berlin, Fachbereich Mathematik und Informatik, December 2001.
Helmut Alt, Christian Knauer, Carola Wenk
[bibtex] [ps.gz]Matching polygonal curves with respect to the Fr\'echet distance
In Proceedings 18th International Symposium on Theoretical Aspects of Computer Science, Seiten 63-74, 2001.
Helmut Alt, Christian Knauer, Carola Wenk
[bibtex] [ps.gz]Discrete Geometric Shapes: Matching, Interpolation, and Approximation
In Handbook of Computational Geometry, Seiten 121-153, Elsevier Science Publishers B.V. North-Holland, Amsterdam, 1999.
Helmut Alt, Leonidas Guibas
[bibtex] [ps.gz]Matching shapes with respect to the symmetric difference (Extended Abstract)
In Proceedings of the Fifteenth European Workshop on Computational Geometry, Antibes-Juan-les-Pins, France, Seiten 195-197, 1999.
Helmut Alt, Christian Knauer
[bibtex]New algorithmic approaches to protein spot detection and pattern matching in two-dimensional electrophoresis gel databases
Electrophoresis, Band 20, Seiten 755-765, 1999.
Helmut Alt, Eckart Fleck, Frank Hoffmann, Klaus Kriegel, Helmut Oswald, Klaus-Peter Pleißner, Anders Sahlströhm, Susan Wegner, Carola Wenk
[bibtex]Matching convex shapes with respect to the symmetric difference
Algorithmica, Band 21, Seiten 89-103, 1998.
Helmut Alt, Ulrich Fuchs, Günter Rote, Gerald Weber
[bibtex] [pdf] [ps.gz]Matching convex shapes with respect to the symmetric difference
In Algorithms - ESA '96. Proc. Fourth Annual European Symposium on Algorithms, Barcelona, Lecture Notes in Computer Science, Band 1136, Seiten 320-333, Springer-Verlag, 1996.
Helmut Alt, Ulrich Fuchs, Günter Rote, Gerald Weber
[bibtex] [pdf] [ps.gz]Discrete Geometric Shapes: Matching, Interpolation, and Approximation - A Survey
Technischer Bericht 96-11, Freie Universität Berlin, Fachbereich Mathematik und Informatik, 1996.
Helmut Alt, Leonidas Guibas
to appear in Handbook on Computational Geometry, Eds. Jörg Sack and Jorge Urrutia
[bibtex] [ps.gz]Approximate matching of polygonal shapes
Ann. Math. Artif. Intell., Band 13, Seiten 251-266, 1995.
Helmut Alt, Bernd Behrends, Johannes Blömer
[bibtex]Computing the Fr\'echet distance between two polygonal curves
Internat. J. Comput. Geom. Appl., Band 5, Seiten 75-91, 1995.
Helmut Alt, Michael Godau
[bibtex]An Application of Point Pattern Matching in Astronautics
J. Symbolic Comput., Band 17, Seiten 321-340, 1994.
Helmut Alt, Lars Knipping, Gerald Weber
[bibtex]Measuring the resemblance of polygonal curves.
In Proc. 8th Annu. ACM Sympos. Comput. Geom., Seiten 102-109, 1992.
Helmut Alt
[bibtex]Measuring the resemblance of polygonal curves
In Proc. 8th Annu. ACM Sympos. Comput. Geom., Seiten 102-109, 1992.
Helmut Alt, Michael Godau
[bibtex]Approximate matching of polygonal shapes
In Proc. 7th Annu. ACM Sympos. Comput. Geom., Seiten 186-193, 1991.
Helmut Alt, Bernd Behrends, Johannes Blömer
[bibtex]Metrics and Algorithms for Measuring the Resemblance of Curves
In Proc. 13th IMACS World Congress on Computation and Applied Mathematics, Seiten 135-136, 1991.
Helmut Alt, Michael Godau
[bibtex]Congruence, similarity and symmetries of geometric objects
In Proc. 3rd Annu. ACM Sympos. Comput. Geom., Seiten 308-315, 1987.
Helmut Alt, Kurt Mehlhorn, Hubert Wagener, Emo Welzl
[bibtex]
Graphentheorie und Algorithmen
Storage Area Network Optimization: Final Report
Technischer Bericht B 00-18, Freie Universität Berlin, 2000.
Helmut Alt, Stefan Felsner, Ludmila Scharf
[bibtex] [ps.gz]Universal 3-Dimensional Visibility Representations for Graphs
Computational Geometry: Theory and Applications, Band 9, Seiten 111-125, 1998.
Helmut Alt, Michael Godau, Sue Whitesides
[bibtex]On the Number of Simple Cycles in Planar Graphs
In Springer Lecture Notes in Computer Science, Band 1335, Seiten 15-24, Proceedings, Workshop on Graph-Theoretic Concepts in Computer Science - WG '97, Berlin, 1997.
Helmut Alt, Ulrich Fuchs, Klaus Kriegel
[bibtex]Universal 3-Dimensional Visibility Representations for Graphs
In Graph Drawing (Proc. GD '95), Lecture Notes Comput. Sci., Band 1027, Seiten 8-19, Springer-Verlag, 1996.
Helmut Alt, Michael Godau, Sue Whitesides
[bibtex]Computing a Maximum Cardinality Matching of a Bipartite Graph in Time O(n1.5 sqrt(m/log n))
Inform. Process. Lett., Band 37, Seiten 237-240, 1991.
Helmut Alt, Norbert Blum, Kurt Mehlhorn, Markus Paul
[bibtex]
Bewegungsplanung
Approximate motion planning and the complexity of the boundary of the union of simple geometric figures
Algorithmica, Band 8, Seiten 391-406, 1992.
Helmut Alt, Rudolf Fleischer, Michael Kaufmann, Kurt Mehlhorn, Stefan Näher, Stefan Schirra, Christian Uhrig
[bibtex]Approximate motion planning and the complexity of the boundary of the union of simple geometric figures
In Proc. 6th Annu. ACM Sympos. Comput. Geom., Seiten 281-289, 1990.
Helmut Alt, Rudolf Fleischer, Michael Kaufmann, Kurt Mehlhorn, Stefan Näher, Stefan Schirra, Christian Uhrig
[bibtex]Algorithmic aspect of motion planning: a tutorial, part 1
Algorithms Rev., Band 1 (1), Seiten 43-60, 1990.
Helmut Alt, Chee K. Yap
[bibtex]Algorithmic aspect of motion planning: a tutorial, part 2
Algorithms Rev., Band 1 (2), Seiten 61-77, 1990.
Helmut Alt, Chee K. Yap
[bibtex]Algorithmic Aspects of Robotics: a Tutorial
In Proceedings SOFSEM `89, Seiten 7-40, 1989.
Helmut Alt, Chee K. Yap
[bibtex]Motion Planning in the CL-Environment
In Proc. 2nd Workshop Algorithms Data Struct., Lecture Notes Comput. Sci., Band 382, Seiten 373-380, Springer-Verlag, 1989.
Helmut Alt
[bibtex]Visibility graphs and obstacle-avoiding shortest paths
Zeitschrift für Operations Research, Band 32 (145-164), 1988.
Helmut Alt, Emo Welzl
[bibtex]
Paralleles Rechnen
Simulation of Idealized Models of Parallel Computers on More Realistic ones
SIAM J. Comput., Band 16, Seiten 808-835, 1987.
Helmut Alt, Torben Hagerup, Kurt Mehlhorn, Franco Preparata
[bibtex]Simulation of Idealized Models of Parallel Computers on More Realistic ones
In Proc. MFCS 1986, Springer Lecture Notes in Computer Science 233, Seiten 199-208, 1986.
Helmut Alt, Torben Hagerup, Kurt Mehlhorn, Franco Preparata
[bibtex]
Probabilistische Algorithmen
A Method for Obtaining Probabilistic Algorithms with Small Tail Probabilities
Algorithmica, Band 16, Seiten 543-547, 1996.
Helmut Alt, Leonidas Guibas, Richard Karp, Kurt Mehlhorn, Avi Widgerson
[bibtex]