---
res:
  bibo_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.@eng
  bibo_authorlist:
  - foaf_Person:
      foaf_givenName: Radoslav
      foaf_name: Fulek, Radoslav
      foaf_surname: Fulek
      foaf_workInfoHomepage: http://www.librecat.org/personId=39F3FFE4-F248-11E8-B48F-1D18A9856A87
    orcid: 0000-0001-8485-1774
  - foaf_Person:
      foaf_givenName: Radoš
      foaf_name: Radoičić, Radoš
      foaf_surname: Radoičić
  bibo_doi: 10.1007/978-3-319-27261-0_31
  bibo_volume: 9411
  dct_date: 2015^xs_gYear
  dct_identifier:
  - UT:000373628600031
  dct_isPartOf:
  - http://id.crossref.org/issn/978-3-319-27260-3
  dct_language: eng
  dct_publisher: Springer Nature@
  dct_title: Vertical visibility among parallel polygons in three dimensions@
...