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