[{"language":[{"iso":"eng"}],"doi":"10.1007/978-3-319-27261-0_28","day":"27","alternative_title":["LNCS"],"type":"book_chapter","author":[{"full_name":"Aichholzer, Oswin","first_name":"Oswin","last_name":"Aichholzer"},{"first_name":"Therese","full_name":"Biedl, Therese","last_name":"Biedl"},{"last_name":"Hackl","full_name":"Hackl, Thomas","first_name":"Thomas"},{"last_name":"Held","full_name":"Held, Martin","first_name":"Martin"},{"id":"4700A070-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-8871-5814","first_name":"Stefan","full_name":"Huber, Stefan","last_name":"Huber"},{"full_name":"Palfrader, Peter","first_name":"Peter","last_name":"Palfrader"},{"first_name":"Birgit","full_name":"Vogtenhuber, Birgit","last_name":"Vogtenhuber"}],"citation":{"short":"O. Aichholzer, T. Biedl, T. Hackl, M. Held, S. Huber, P. Palfrader, B. Vogtenhuber, in:, Graph Drawing and Network Visualization, Springer Nature, 2015, pp. 335–347.","ama":"Aichholzer O, Biedl T, Hackl T, et al. Representing directed trees as straight skeletons. In: <i>Graph Drawing and Network Visualization</i>. Vol 9411. Springer Nature; 2015:335-347. doi:<a href=\"https://doi.org/10.1007/978-3-319-27261-0_28\">10.1007/978-3-319-27261-0_28</a>","apa":"Aichholzer, O., Biedl, T., Hackl, T., Held, M., Huber, S., Palfrader, P., &#38; Vogtenhuber, B. (2015). Representing directed trees as straight skeletons. In <i>Graph Drawing and Network Visualization</i> (Vol. 9411, pp. 335–347). Los Angeles, CA, United States: Springer Nature. <a href=\"https://doi.org/10.1007/978-3-319-27261-0_28\">https://doi.org/10.1007/978-3-319-27261-0_28</a>","chicago":"Aichholzer, Oswin, Therese Biedl, Thomas Hackl, Martin Held, Stefan Huber, Peter Palfrader, and Birgit Vogtenhuber. “Representing Directed Trees as Straight Skeletons.” In <i>Graph Drawing and Network Visualization</i>, 9411:335–47. Springer Nature, 2015. <a href=\"https://doi.org/10.1007/978-3-319-27261-0_28\">https://doi.org/10.1007/978-3-319-27261-0_28</a>.","ieee":"O. Aichholzer <i>et al.</i>, “Representing directed trees as straight skeletons,” in <i>Graph Drawing and Network Visualization</i>, vol. 9411, Springer Nature, 2015, pp. 335–347.","ista":"Aichholzer O, Biedl T, Hackl T, Held M, Huber S, Palfrader P, Vogtenhuber B. 2015.Representing directed trees as straight skeletons. In: Graph Drawing and Network Visualization. LNCS, vol. 9411, 335–347.","mla":"Aichholzer, Oswin, et al. “Representing Directed Trees as Straight Skeletons.” <i>Graph Drawing and Network Visualization</i>, vol. 9411, Springer Nature, 2015, pp. 335–47, doi:<a href=\"https://doi.org/10.1007/978-3-319-27261-0_28\">10.1007/978-3-319-27261-0_28</a>."},"conference":{"location":"Los Angeles, CA, United States","name":"GD: International Symposium on Graph Drawing","end_date":"2015-09-26","start_date":"2015-09-24"},"title":"Representing directed trees as straight skeletons","quality_controlled":"1","department":[{"_id":"HeEd"}],"publication":"Graph Drawing and Network Visualization","status":"public","intvolume":"      9411","publisher":"Springer Nature","month":"11","date_created":"2018-12-11T11:52:54Z","page":"335 - 347","user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","date_updated":"2022-01-28T09:10:37Z","scopus_import":"1","publication_identifier":{"eisbn":["978-3-319-27261-0"],"isbn":["978-3-319-27260-3"]},"publist_id":"5581","oa_version":"Preprint","year":"2015","volume":9411,"publication_status":"published","oa":1,"main_file_link":[{"url":"http://arxiv.org/abs/1508.01076","open_access":"1"}],"abstract":[{"lang":"eng","text":"The straight skeleton of a polygon is the geometric graph obtained by tracing the vertices during a mitered offsetting process. It is known that the straight skeleton of a simple polygon is a tree, and one can naturally derive directions on the edges of the tree from the propagation of the shrinking process. In this paper, we ask the reverse question: Given a tree with directed edges, can it be the straight skeleton of a polygon? And if so, can we find a suitable simple polygon? We answer these questions for all directed trees where the order of edges around each node is fixed."}],"_id":"1590","date_published":"2015-11-27T00:00:00Z","article_processing_charge":"No"},{"day":"27","alternative_title":["LNCS"],"type":"book_chapter","author":[{"last_name":"Fulek","first_name":"Radoslav","full_name":"Fulek, Radoslav","id":"39F3FFE4-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-8485-1774"},{"first_name":"Radoš","full_name":"Radoičić, Radoš","last_name":"Radoičić"}],"ec_funded":1,"citation":{"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>","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>","short":"R. Fulek, R. Radoičić, in:, Graph Drawing and Network Visualization, 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>.","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.","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>."},"conference":{"start_date":"2015-09-24","end_date":"2015-09-26","name":"GD: Graph Drawing and Network Visualization","location":"Los Angeles, CA, United States"},"title":"Vertical visibility among parallel polygons in three dimensions","language":[{"iso":"eng"}],"doi":"10.1007/978-3-319-27261-0_31","ddc":["510"],"project":[{"call_identifier":"FP7","_id":"25681D80-B435-11E9-9278-68D0E5697425","grant_number":"291734","name":"International IST Postdoc Fellowship Programme"}],"month":"11","date_created":"2018-12-11T11:52:56Z","page":"373 - 379","department":[{"_id":"UlWa"}],"quality_controlled":"1","publication":"Graph Drawing and Network Visualization","status":"public","intvolume":"      9411","publisher":"Springer Nature","publist_id":"5575","has_accepted_license":"1","year":"2015","oa_version":"Submitted Version","user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","date_updated":"2022-01-28T09:20:50Z","scopus_import":"1","publication_identifier":{"isbn":["978-3-319-27260-3"]},"file":[{"access_level":"open_access","date_updated":"2020-07-14T12:45:04Z","checksum":"eec04f86c5921d04f025d5791db9b965","creator":"system","file_size":312992,"file_name":"IST-2016-595-v1+1_VerticalVisibilityGDRevision.pdf","date_created":"2018-12-12T10:17:06Z","file_id":"5258","relation":"main_file","content_type":"application/pdf"}],"abstract":[{"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.","lang":"eng"}],"_id":"1596","date_published":"2015-11-27T00:00:00Z","article_processing_charge":"No","file_date_updated":"2020-07-14T12:45:04Z","volume":9411,"pubrep_id":"595","publication_status":"published","oa":1}]