Resource title

Gaps in convex disc packings with an application to 1-Steiner minimum trees

Resource image

image for OpenScout resource :: Gaps in convex disc packings with an application to 1-Steiner minimum trees

Resource description

We show that if six translates of a convex disc C all touch C, and no two of the translates have interior points in common, then there are never more than two gaps, i.e., consecutive non-touching pairs of translates. We also characterize the configurations where there are two, one or no gaps. This result is then applied to show that the Steiner point in a 1-Steiner Minimum Tree in a normed plane has degree at most five if the unit ball is not an affine regular hexagon (where Steiner points of degree six exist).

Resource author

Resource publisher

Resource publish date

Resource language

en

Resource content type

Resource resource URL

http://eprints.lse.ac.uk/25459/

Resource license