27 citations · 62 across the 9 of their papers we have counts for
10 papers
Packing d-dimensional balls into a d+1-dimensional container
Helmut Alt, Sergio Cabello, Otfried Cheong +2
In this article, we consider the problems of finding in dimensions a minimum-volume axis-parallel box, a minimum-volume arbitrarily-oriented box and a minimum-volume convex b…
Placing your Coins on a Shelf
Helmut Alt, Kevin Buchin, Steven Chaplick +4
We consider the problem of packing a family of disks "on a shelf", that is, such that each disk touches the -axis from above and such that no two disks overlap. We prove that th…
Approximating Smallest Containers for Packing Three-dimensional Convex Objects
Helmut Alt, Nadja Scharf
We investigate the problem of computing a minimal-volume container for the non-overlapping packing of a given set of three-dimensional convex objects. Already the simplest versions…
Thoughts on Barnette's Conjecture
Helmut Alt, Michael S. Payne, Jens M. Schmidt +1
We prove a new sufficient condition for a cubic 3-connected planar graph to be Hamiltonian. This condition is most easily described as a property of the dual graph. Let be a pl…
Computation of the Hausdorff distance between sets of line segments in parallel
Helmut Alt, Ludmila Scharf
We show that the Hausdorff distance for two sets of non-intersecting line segments can be computed in parallel in time using O(n) processors in a CREW-PRAM computatio…
Minimum cell connection and separation in line segment arrangements
Helmut Alt, Sergio Cabello, Panos Giannopoulos +1
We study the complexity of the following cell connection and separation problems in segment arrangements. Given a set of straight-line segments in the plane and two points and…