3D proportional contact representations of graphs

Md Jawaherul Alam, Stephen G Kobourov, Giuseppe Liotta, Sergey Pupyrev, Sankar Veeramoni

Research output: Chapter in Book/Report/Conference proceedingConference contribution

2 Citations (Scopus)

Abstract

In 3D contact representations, the vertices of a graph are represented by 3D polyhedra and the edges are realized by non-zero-area common boundaries between corresponding polyhedra. While contact representations with cuboids have been studied in the literature, we consider a novel generalization of the problem in which vertices are represented by axis-aligned polyhedra that are union of two cuboids. In particular, we study the weighted (proportional) version of the problem, where the volumes of the polyhedra and the areas of the common boundaries realize prespecified vertex and edge weights. For some classes of graphs (e.g., outerplanar, planar bipartite, planar, complete), we provide algorithms to construct such representations for arbitrary given weights.We also show that not all graphs can be represented in 3D with axis-aligned polyhedra of constant complexity.

Original languageEnglish (US)
Title of host publicationIISA 2014 - 5th International Conference on Information, Intelligence, Systems and Applications
PublisherIEEE Computer Society
Pages27-32
Number of pages6
ISBN (Print)9781479961719
DOIs
StatePublished - 2014
Event5th International Conference on Information, Intelligence, Systems and Applications, IISA 2014 - Chania, Crete, Greece
Duration: Jul 7 2014Jul 9 2014

Other

Other5th International Conference on Information, Intelligence, Systems and Applications, IISA 2014
CountryGreece
CityChania, Crete
Period7/7/147/9/14

ASJC Scopus subject areas

  • Artificial Intelligence
  • Computer Science Applications
  • Information Systems

Cite this

Alam, M. J., Kobourov, S. G., Liotta, G., Pupyrev, S., & Veeramoni, S. (2014). 3D proportional contact representations of graphs. In IISA 2014 - 5th International Conference on Information, Intelligence, Systems and Applications (pp. 27-32). [6878773] IEEE Computer Society. https://doi.org/10.1109/IISA.2014.6878773

3D proportional contact representations of graphs. / Alam, Md Jawaherul; Kobourov, Stephen G; Liotta, Giuseppe; Pupyrev, Sergey; Veeramoni, Sankar.

IISA 2014 - 5th International Conference on Information, Intelligence, Systems and Applications. IEEE Computer Society, 2014. p. 27-32 6878773.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Alam, MJ, Kobourov, SG, Liotta, G, Pupyrev, S & Veeramoni, S 2014, 3D proportional contact representations of graphs. in IISA 2014 - 5th International Conference on Information, Intelligence, Systems and Applications., 6878773, IEEE Computer Society, pp. 27-32, 5th International Conference on Information, Intelligence, Systems and Applications, IISA 2014, Chania, Crete, Greece, 7/7/14. https://doi.org/10.1109/IISA.2014.6878773
Alam MJ, Kobourov SG, Liotta G, Pupyrev S, Veeramoni S. 3D proportional contact representations of graphs. In IISA 2014 - 5th International Conference on Information, Intelligence, Systems and Applications. IEEE Computer Society. 2014. p. 27-32. 6878773 https://doi.org/10.1109/IISA.2014.6878773
Alam, Md Jawaherul ; Kobourov, Stephen G ; Liotta, Giuseppe ; Pupyrev, Sergey ; Veeramoni, Sankar. / 3D proportional contact representations of graphs. IISA 2014 - 5th International Conference on Information, Intelligence, Systems and Applications. IEEE Computer Society, 2014. pp. 27-32
@inproceedings{5d5d42e1fb294acea3b8aacb5dac1d00,
title = "3D proportional contact representations of graphs",
abstract = "In 3D contact representations, the vertices of a graph are represented by 3D polyhedra and the edges are realized by non-zero-area common boundaries between corresponding polyhedra. While contact representations with cuboids have been studied in the literature, we consider a novel generalization of the problem in which vertices are represented by axis-aligned polyhedra that are union of two cuboids. In particular, we study the weighted (proportional) version of the problem, where the volumes of the polyhedra and the areas of the common boundaries realize prespecified vertex and edge weights. For some classes of graphs (e.g., outerplanar, planar bipartite, planar, complete), we provide algorithms to construct such representations for arbitrary given weights.We also show that not all graphs can be represented in 3D with axis-aligned polyhedra of constant complexity.",
author = "Alam, {Md Jawaherul} and Kobourov, {Stephen G} and Giuseppe Liotta and Sergey Pupyrev and Sankar Veeramoni",
year = "2014",
doi = "10.1109/IISA.2014.6878773",
language = "English (US)",
isbn = "9781479961719",
pages = "27--32",
booktitle = "IISA 2014 - 5th International Conference on Information, Intelligence, Systems and Applications",
publisher = "IEEE Computer Society",

}

TY - GEN

T1 - 3D proportional contact representations of graphs

AU - Alam, Md Jawaherul

AU - Kobourov, Stephen G

AU - Liotta, Giuseppe

AU - Pupyrev, Sergey

AU - Veeramoni, Sankar

PY - 2014

Y1 - 2014

N2 - In 3D contact representations, the vertices of a graph are represented by 3D polyhedra and the edges are realized by non-zero-area common boundaries between corresponding polyhedra. While contact representations with cuboids have been studied in the literature, we consider a novel generalization of the problem in which vertices are represented by axis-aligned polyhedra that are union of two cuboids. In particular, we study the weighted (proportional) version of the problem, where the volumes of the polyhedra and the areas of the common boundaries realize prespecified vertex and edge weights. For some classes of graphs (e.g., outerplanar, planar bipartite, planar, complete), we provide algorithms to construct such representations for arbitrary given weights.We also show that not all graphs can be represented in 3D with axis-aligned polyhedra of constant complexity.

AB - In 3D contact representations, the vertices of a graph are represented by 3D polyhedra and the edges are realized by non-zero-area common boundaries between corresponding polyhedra. While contact representations with cuboids have been studied in the literature, we consider a novel generalization of the problem in which vertices are represented by axis-aligned polyhedra that are union of two cuboids. In particular, we study the weighted (proportional) version of the problem, where the volumes of the polyhedra and the areas of the common boundaries realize prespecified vertex and edge weights. For some classes of graphs (e.g., outerplanar, planar bipartite, planar, complete), we provide algorithms to construct such representations for arbitrary given weights.We also show that not all graphs can be represented in 3D with axis-aligned polyhedra of constant complexity.

UR - http://www.scopus.com/inward/record.url?scp=84906748772&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84906748772&partnerID=8YFLogxK

U2 - 10.1109/IISA.2014.6878773

DO - 10.1109/IISA.2014.6878773

M3 - Conference contribution

SN - 9781479961719

SP - 27

EP - 32

BT - IISA 2014 - 5th International Conference on Information, Intelligence, Systems and Applications

PB - IEEE Computer Society

ER -