Helmut Alt
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Helmut Alt has a total of 28 co-authors. Here are the top co-authors by number of shared publications:
- Michael Godau
Free University of Berlin
3 shared publications - Christian Knauer
Freie Universität Berlin
2 shared publications - Sue Whitesides
McGill University
2 shared publications - Alexander Kröller
Algorithms Group Braunschweig Institute of Technology IBR Germany
1 shared publication - Alon Efrat
Department of Computer Science, University of Arizona, Tucson, USA
1 shared publication - Antoine Vigneron
UNIST, Sch Elect & Comp Engn, Ulsan, South Korea
1 shared publication
Latest Publications
- 14 August 2013
- Published by Springer Nature in Theory of Computing Systems
- Vol. 54 (4) , 689-714
Scandinavian Thins on Top of Cake: New and Improved Algorithms for Stacking and Packing
- 14 August 2013
- Published by Springer Nature in Theory of Computing Systems
- Vol. 54 (4) , 689-714
Scandinavian Thins on Top of Cake: New and Improved Algorithms for Stacking and Packing
- 23 June 2009
- Published by Elsevier in Computational Geometry
- Vol. 43 (2) , 99-114
Probabilistic matching of planar regions
- 23 June 2009
- Published by Elsevier in Computational Geometry
- Vol. 43 (2) , 99-114
Probabilistic matching of planar regions
- 17 March 2009
- Published by Springer Nature in Discrete & Computational Geometry
- Vol. 43 (1) , 78-99
Can We Compute the Similarity between Surfaces?
- 17 March 2009
- Published by Springer Nature in Discrete & Computational Geometry
- Vol. 43 (1) , 78-99
Can We Compute the Similarity between Surfaces?
- Open Access
- 4 March 2008
- Published by Springer Nature in Theory of Computing Systems
- Vol. 44 (2) , 160-174
Wooden Geometric Puzzles: Design and Hardness Proofs
- 4 March 2008
- Published by Springer Nature in Theory of Computing Systems
- Vol. 44 (2) , 160-174
Open AccessWooden Geometric Puzzles: Design and Hardness Proofs
- 4 August 2005
- Published by Springer Nature in Discrete & Computational Geometry
- Vol. 34 (3) , 439-453
The Voronoi Diagram of Curved Objects
- 4 August 2005
- Published by Springer Nature in Discrete & Computational Geometry
- Vol. 34 (3) , 439-453
The Voronoi Diagram of Curved Objects
- 24 October 2003
- Published by Springer Nature in Algorithmica
- Vol. 38 (1) , 45-58
Comparison of Distance Measures for Planar Curves
- 24 October 2003
- Published by Springer Nature in Algorithmica
- Vol. 38 (1) , 45-58
Comparison of Distance Measures for Planar Curves
- 1 January 2003
- Published by Springer Nature
- p. 65-76
Computing the Hausdorff Distance of Geometric Patterns and Shapes
- 1 January 2003
- Published by Springer Nature
- p. 65-76
Computing the Hausdorff Distance of Geometric Patterns and Shapes
- 1 September 1999
- Published by Cambridge University Press (CUP) in Combinatorics, Probability and Computing
- Vol. 8 (5) , 397-405
On the Number of Simple Cycles in Planar Graphs
Let C(G) denote the number of simple cycles of a graph G and let C(n) be the maximum of C(G) over all planar graphs with n nodes. We present a lower bound on C(n), constructing graphs with at least 2.28n cycles. Applying some probabilistic arguments we prove an upper bound of 3.37n.We also discuss this question restricted to the subclasses of grid graphs, bipartite graphs, and 3-colourable triangulated graphs.
- 1 September 1999
- Published by Cambridge University Press (CUP) in Combinatorics, Probability and Computing
- Vol. 8 (5) , 397-405
On the Number of Simple Cycles in Planar Graphs
Let C(G) denote the number of simple cycles of a graph G and let C(n) be the maximum of C(G) over all planar graphs with n nodes. We present a lower bound on C(n), constructing graphs with at least 2.28n cycles. Applying some probabilistic arguments we prove an upper bound of 3.37n.We also discuss this question restricted to the subclasses of grid graphs, bipartite graphs, and 3-colourable triangulated graphs.