Author(s):

Fulek, Radoslav; Radoičić, Radoš

Title: 
Vertical visibility among parallel polygons in three dimensions

Title Series: 
LNCS

Affiliation 
IST Austria 
Abstract: 
Let C={C1,...,Cn} denote a collection of translates of a regular convex kgon in the plane with the stacking order. The collection C forms a visibility clique if for everyi < j the intersection Ci and (Ci ∩ Cj)\⋃i<l<jCl =∅.elements that are stacked between them, i.e., We show that if C forms a visibility clique its size is bounded from above by O(k4) thereby improving the upper bound of 22k from the aforementioned paper. We also obtain an upper bound of 22(k/2)+2 on the size of a visibility clique for homothetes of a convex (not necessarily regular) kgon.

Conference Title:

GD: Graph Drawing and Network Visualization

Volume: 
9411

Conference Dates:

September 2426, 2015

Conference Location:

Los Angeles, CA, USA

ISBN:

9783319272603

Publisher:

Springer

Date Published:

20151127

Start Page: 
373

End Page:

379

URL: 

DOI: 
10.1007/9783319272610_31

Open access: 
yes (repository) 