@inbook{1596,
  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.},
  author       = {Fulek, Radoslav and Radoičić, Radoš},
  booktitle    = {Graph Drawing and Network Visualization},
  isbn         = {978-3-319-27260-3},
  location     = {Los Angeles, CA, United States},
  pages        = {373 -- 379},
  publisher    = {Springer Nature},
  title        = {{Vertical visibility among parallel polygons in three dimensions}},
  doi          = {10.1007/978-3-319-27261-0_31},
  volume       = {9411},
  year         = {2015},
}