##
The Visible Perimeter of an Arrangement of Disks

Given a collection of n opaque unit disks in the plane, we want to find a stacking order for them that maximizes their visible perimeter, the total length of all pieces of their boundaries visible from above. We prove that if the centers of the disks form a dense point set, i.e., the ratio of their maximum to their minimum distance is O(n^1/2), then there is a stacking order for which the visible perimeter is Ω(n^2/3). We also show that this bound cannot be improved in the case of the n^1/2×n^1/2 piece of a sufficiently small square grid. On the other hand, if the set of centers is dense and the maximum distance between them is small, then the visible perimeter is O(n^3/4) with respect to any stacking order. This latter bound cannot be improved either. These results partially answer some questions of Cabello, Haverkort, van Kreveld, and Speckmann.

Editor(s):

Didimo, Walter

Patrignani, Maurizio

Published in:

Graph Drawing, 364-375

Presented at:

Graph Drawing 2012

Publisher:

Berlin, Heidelberg, Springer

ISBN:

978-3-642-36762-5

Keywords:

Laboratories:

Record created 2013-03-15, last modified 2018-03-17