# Vertical Visibility among Parallel Polygons in Three Dimensions

Motivated by a paper of Babilon et al. entitled “Visibility Representations of Complete Graphs” we study the following problem. Let $C$ be a collection of homothetic copies of a convex k-gon P in the plane with the given stacking order. The collection $C$ forms a visibility clique if, for every pair of copies $P_1$ and $P_2$ in $C$, the intersection of $P_1$ and $P_2$ is not covered by the union of the copies in $C$ appearing between $P_1$ and $P_2$ in the stacking order.
We obtain an upper bound of $2^{2{k \choose 2}+2}$ on the size of a visibility clique of homothetic copies of a convex $k$-gon. In the case of translates of a regular convex $k$-gon we improve the bound to $O(k^4)$ thereby improving the upper bound of $2^{2^k}$ from the aforementioned paper.
Furthermore, we show that every visibility clique of $n$ translates of a regular k-gon contains a subset of size $cn^{1/6}$, for a fixed $c>0$, that is combinatorially equivalent to the best known lower bound construction, giving the bound of roughly $k/2$, for the visibility clique of homothetic copies of a convex $k$-gon. The last result holds in more general setting, where we consider pseudo-disc arrangements satisfying certain conditions instead of translates of a polygon.
{"ft_lang_label":"__label__en","ft_lang_prob":0.86375856,"math_prob":0.9981651,"size":1297,"snap":"2019-43-2019-47","text_gpt3_token_len":336,"char_repetition_ratio":0.12064965,"word_repetition_ratio":0.056872036,"special_character_ratio":0.24980725,"punctuation_ratio":0.06827309,"nsfw_num_words":0,"has_unicode_error":false,"math_prob_llama3":0.9975016,"pos_list":[0],"im_url_duplicate_count":[null],"WARC_HEADER":"{\"WARC-Type\":\"response\",\"WARC-Date\":\"2019-11-18T11:30:29Z\",\"WARC-Record-ID\":\"<urn:uuid:89846153-766b-43fb-994d-ab90760273c7>\",\"Content-Length\":\"2480\",\"Content-Type\":\"application/http; msgtype=response\",\"WARC-Warcinfo-ID\":\"<urn:uuid:1b5b04c4-1a6a-4b47-84fc-16f9ee348b2f>\",\"WARC-Concurrent-To\":\"<urn:uuid:9a1ff7eb-6214-40d6-bb4f-318345f79c92>\",\"WARC-IP-Address\":\"128.122.49.29\",\"WARC-Target-URI\":\"https://math.nyu.edu/faculty/pollack/seminar/spring15/Fulek.html\",\"WARC-Payload-Digest\":\"sha1:LLAT7BA5NUZ5UWGQ46MO62SONN3BKV3I\",\"WARC-Block-Digest\":\"sha1:QOU3HRMVUHLMDC5P3AKLHRV7MVBGVBBB\",\"WARC-Identified-Payload-Type\":\"text/html\",\"warc_filename\":\"/cc_download/warc_2019/CC-MAIN-2019-47/CC-MAIN-2019-47_segments_1573496669755.17_warc_CC-MAIN-20191118104047-20191118132047-00547.warc.gz\"}"}