Logo

Login | Create Account

3D Visibility Representations of Complete Graphs

Stola, Jan (2004) 3D Visibility Representations of Complete Graphs. [Conference Paper]

Full text not available from this repository.

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 to n+1 and the upper bound from to .

Item Type:Conference Paper
Classifications:P Styles > P.900 Visibility
Z Theory > Z.250 Geometry
P Styles > P.060 3D
ID Code:452
Deposited By:Selbach, Anna
Deposited On:27 Oct 2005
Last Modified:18 Sep 2008 13:08
Alternative Locations:http://www.springerlink.com/openurl.asp?genre=article&issn=0302-9743&volume=2912&spage=226

Repository Staff Only: item control page

References

H. Alt, M. Godau, S. Whitesides (1998): University 3-dimensional visibility representations for graphs, Comput. Geom. 9, 111-125.

R. Babilon, H. Nyklová, O. Pangrác, J. Vondrák (1999): Visibility representations of complete graphs, Proc. Graph Drawing 99, 333-341.

G. Tóth, P. Valtr (1998): Note on the Erdös-Szekeres theorem, Discrete Comput. Geom. 19(3), 457-459.

F.J. Cobos, J.C. Dana, F. Hurtado, A. Márquez, F. Mateos (1995): On a visibility representation of graphs, Proc. Graph Drawing 95, 152-161.

P. Bose, A. Dean, J. Hutchinson, T. Shermer (1996): On rectangle visibility graphs, Proc. Graph Drawing 96, 25-44.

S.P. Fekete, M.E. Houle, S. Whitesides (1995): New results on a visibility representation of graphs in 3D, Proc. Graph Drawing 95, 234-241.

J.P. Hutchinson, T. Shermer, A. Vince (1999): On representations of some thickness-two graphs, Comput. Geom. 13(3), 161-171.

R. Tamassia, I.G. Tollis (1986): A unified approach to visibility representations of planar graphs, Discrete and Computational Geometry, 1:321-341.

P. Bose, H. Everett, S. Fekete, A. Lubiw, H. Meijer, K. Romanik. T. Shermer, S. Whitesides (1993): On a visibility representation for graphs in three dimensions, Proc. Graph Drawing 93, 38-39.

A. Dean, J. Hutchinson (1997): Rectangle-visibility representations of bipartite graphs, Discrete Appl. Math. 75(1), 9-25.

GDEA is powered by EPrints 3 which is developed by the School of Electronics and Computer Science at the University of Southampton. More information and software credits.