Vertical visibility among parallel polygons in three dimensions

R. Fulek, R. Radoičić, 9411 (2015) 373–379.

Download
OA IST-2016-595-v1+1_VerticalVisibilityGDRevision.pdf 312.99 KB

Conference Paper | Published | English

Scopus indexed
Author
Fulek, RadoslavIST Austria ; Radoičić, Radoš
Department
Series Title
LNCS
Abstract
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 < j the intersection Ci and (Ci ∩ Cj)\⋃i<l<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.
Publishing Year
Date Published
2015-11-27
Volume
9411
Page
373 - 379
Conference
GD: Graph Drawing and Network Visualization
Conference Location
Los Angeles, CA, United States
Conference Date
2015-09-24 – 2015-09-26
IST-REx-ID

Cite this

Fulek R, Radoičić R. Vertical visibility among parallel polygons in three dimensions. 2015;9411:373-379. doi:10.1007/978-3-319-27261-0_31
Fulek, R., & Radoičić, R. (2015). Vertical visibility among parallel polygons in three dimensions. Presented at the GD: Graph Drawing and Network Visualization, Los Angeles, CA, United States: Springer. https://doi.org/10.1007/978-3-319-27261-0_31
Fulek, Radoslav, and Radoš Radoičić. “Vertical Visibility among Parallel Polygons in Three Dimensions.” Lecture Notes in Computer Science. Springer, 2015. https://doi.org/10.1007/978-3-319-27261-0_31.
R. Fulek and R. Radoičić, “Vertical visibility among parallel polygons in three dimensions,” vol. 9411. Springer, pp. 373–379, 2015.
Fulek R, Radoičić R. 2015. Vertical visibility among parallel polygons in three dimensions. 9411, 373–379.
Fulek, Radoslav, and Radoš Radoičić. Vertical Visibility among Parallel Polygons in Three Dimensions. Vol. 9411, Springer, 2015, pp. 373–79, doi:10.1007/978-3-319-27261-0_31.
All files available under the following license(s):
Copyright Statement:
This Item is protected by copyright and/or related rights. [...]
Main File(s)
Access Level
OA Open Access
Date Uploaded
2018-12-12
MD5 Checksum
eec04f86c5921d04f025d5791db9b965


Export

Marked Publications

Open Data IST Research Explorer

Search this title in

Google Scholar