{"user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","conference":{"end_date":"2015-09-26","name":"GD: Graph Drawing and Network Visualization","location":"Los Angeles, CA, United States","start_date":"2015-09-24"},"scopus_import":"1","intvolume":"      9411","has_accepted_license":"1","publication_status":"published","page":"373 - 379","ddc":["510"],"date_updated":"2022-01-28T09:20:50Z","status":"public","article_processing_charge":"No","date_published":"2015-11-27T00:00:00Z","title":"Vertical visibility among parallel polygons in three dimensions","quality_controlled":"1","volume":9411,"publist_id":"5575","type":"book_chapter","_id":"1596","alternative_title":["LNCS"],"doi":"10.1007/978-3-319-27261-0_31","file_date_updated":"2020-07-14T12:45:04Z","oa":1,"file":[{"content_type":"application/pdf","relation":"main_file","date_updated":"2020-07-14T12:45:04Z","file_name":"IST-2016-595-v1+1_VerticalVisibilityGDRevision.pdf","file_size":312992,"creator":"system","access_level":"open_access","file_id":"5258","date_created":"2018-12-12T10:17:06Z","checksum":"eec04f86c5921d04f025d5791db9b965"}],"date_created":"2018-12-11T11:52:56Z","publisher":"Springer Nature","year":"2015","language":[{"iso":"eng"}],"author":[{"id":"39F3FFE4-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-8485-1774","first_name":"Radoslav","last_name":"Fulek","full_name":"Fulek, Radoslav"},{"first_name":"Radoš","last_name":"Radoičić","full_name":"Radoičić, Radoš"}],"day":"27","month":"11","project":[{"call_identifier":"FP7","grant_number":"291734","_id":"25681D80-B435-11E9-9278-68D0E5697425","name":"International IST Postdoc Fellowship Programme"}],"department":[{"_id":"UlWa"}],"pubrep_id":"595","ec_funded":1,"publication_identifier":{"isbn":["978-3-319-27260-3"]},"citation":{"ieee":"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.","mla":"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>.","ama":"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>","ista":"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.","chicago":"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>.","short":"R. Fulek, R. Radoičić, in:, Graph Drawing and Network Visualization, Springer Nature, 2015, pp. 373–379.","apa":"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>"},"oa_version":"Submitted Version","abstract":[{"lang":"eng","text":"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."}],"publication":"Graph Drawing and Network Visualization"}