Vertical visibility among parallel polygons in three dimensions Conference Paper


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 k-gon 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) k-gon.
Conference Title: GD: Graph Drawing and Network Visualization
Volume: 9411
Conference Dates: September 24-26, 2015
Conference Location: Los Angeles, CA, USA
ISBN: 978-331927260-3
Publisher: Springer  
Date Published: 2015-11-27
Start Page: 373
End Page: 379
URL:
DOI: 10.1007/978-3-319-27261-0_31
Open access: yes (repository)
IST Austria Authors
  1. Radoslav Fulek
    11 Fulek
Related IST Austria Work