book chapter published yes Radoslav Fulek author 39F3FFE4-F248-11E8-B48F-1D18A9856A870000-0001-8485-1774 Radoš Radoičić author UlWa department GD: Graph Drawing and Network Visualization International IST Postdoc Fellowship Programme project 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 &lt; j the intersection Ci and (Ci ∩ Cj)\⋃i&lt;l&lt;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. https://research-explorer.ista.ac.at/download/1596/5258/IST-2016-595-v1+1_VerticalVisibilityGDRevision.pdf application/pdfno Springer Nature2015Los Angeles, CA, United States eng 978-3-319-27260-3 00037362860003110.1007/978-3-319-27261-0_31 9411373 - 379 Fulek R, Radoičić R. 2015.Vertical visibility among parallel polygons in three dimensions. In: Graph Drawing and Network Visualization. LNCS, vol. 9411, 373–379. Fulek, Radoslav, and Radoš Radoičić. “Vertical Visibility among Parallel Polygons in Three Dimensions.” <i>Graph Drawing and Network Visualization</i>, vol. 9411, Springer Nature, 2015, pp. 373–79, doi:<a href="https://doi.org/10.1007/978-3-319-27261-0_31">10.1007/978-3-319-27261-0_31</a>. Fulek, Radoslav, and Radoš Radoičić. “Vertical Visibility among Parallel Polygons in Three Dimensions.” In <i>Graph Drawing and Network Visualization</i>, 9411:373–79. Springer Nature, 2015. <a href="https://doi.org/10.1007/978-3-319-27261-0_31">https://doi.org/10.1007/978-3-319-27261-0_31</a>. R. Fulek, R. Radoičić, in:, Graph Drawing and Network Visualization, Springer Nature, 2015, pp. 373–379. Fulek, R., &#38; Radoičić, R. (2015). Vertical visibility among parallel polygons in three dimensions. In <i>Graph Drawing and Network Visualization</i> (Vol. 9411, pp. 373–379). Los Angeles, CA, United States: Springer Nature. <a href="https://doi.org/10.1007/978-3-319-27261-0_31">https://doi.org/10.1007/978-3-319-27261-0_31</a> R. Fulek and R. Radoičić, “Vertical visibility among parallel polygons in three dimensions,” in <i>Graph Drawing and Network Visualization</i>, vol. 9411, Springer Nature, 2015, pp. 373–379. Fulek R, Radoičić R. Vertical visibility among parallel polygons in three dimensions. In: <i>Graph Drawing and Network Visualization</i>. Vol 9411. Springer Nature; 2015:373-379. doi:<a href="https://doi.org/10.1007/978-3-319-27261-0_31">10.1007/978-3-319-27261-0_31</a> 15962018-12-11T11:52:56Z2025-09-29T11:05:28Z