Skip to main content
Conference ProceedingsOPEN ACCESS

3D visibility representations by regular polygons

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2010) 5849 LNCS 323-333
DOI: 10.1007/978-3-642-11805-0_31
1Citations
Citations of this article
3Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

We study 3D visibility representations of complete graphs where vertices are represented by equal regular polygons lying in planes parallel to the xy-plane. Edges correspond to the z-parallel visibility among these polygons. We improve the upper bound on the maximum size of a complete graph with a 3D visibility representation by regular n-gons from 2O(n) to O(n 4). © 2010 Springer-Verlag.

Cite

CITATION STYLE

APA

Štola, J. (2010). 3D visibility representations by regular polygons. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5849 LNCS, pp. 323–333). https://doi.org/10.1007/978-3-642-11805-0_31

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free