Abstract
This paper continues the study of 3D visibility representations of complete graphs where vertices are represented by equal convex polygons lying in planes parallel to the xy-plane. Edges correspond to the z-parallel visibility among these polygons. We give several bounds on the size of the largest complete graph that has a 3D visibility representation with particular properties. Namely we improve the best known lower bound for representations by regular n-gons from [n+1 / 2]+2 to n+1 and the upper bound from 22n to (6n-3/3n-1) -3. © Springer-Verlag 2004.
Cite
CITATION STYLE
Štola, J. (2004). 3D Visibility Representations of Complete Graphs. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2912, 226–237. https://doi.org/10.1007/978-3-540-24595-7_21
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
