From graphs to Euclidean virtual worlds : visualization of 3D electronic institutions

Sara Drago; Anton Bogdanovych; Massimo Ancona; Simeon J. Simoff; Helmut Berger; Carles Sierra; Gillian Dobbie

From graphs to Euclidean virtual worlds : visualization of 3D electronic institutions

Sara Drago, Anton Bogdanovych, Massimo Ancona, Simeon J. Simoff, Helmut Berger, Carles Sierra, Gillian Dobbie

Research output: Chapter in Book / Conference Paper › Conference Paper

Abstract

![CDATA[In this paper we propose an algorithm for automatic transformation of a graph into a 3D Virtual World and its Euclidean map, using the rectangular dualization technique. The nodes of the initial graph are transformed into rooms, the connecting arcs between nodes determine which rooms have to be placed next to each other and define the positions of the doors connecting those rooms. The proposed algorithm is general enough to be used for automatic generation of 3D Virtual Worlds representation of any planar graph, however, our research is particularly focused on the automatic generation of 3D Electronic Institutions from the Performative Structure graph.]]

Original language	English
Title of host publication	Proceedings of the Thirtieth Australasian Conference on Computer Science
Publisher	Australian Computer Society
Number of pages	1
ISBN (Print)	1920682430
Publication status	Published - 2007
Event	Australasian Computer Science Conference - Duration: 17 Jan 2011 → …

Conference

Conference	Australasian Computer Science Conference
Period	17/01/11 → …

Keywords

Euclidean algorithm
virtual reality
rectangular dualization
representations of graphs

Cite this

@inproceedings{c5fe372012c04abeab797f84b9cbb72c,

title = "From graphs to Euclidean virtual worlds : visualization of 3D electronic institutions",

abstract = "![CDATA[In this paper we propose an algorithm for automatic transformation of a graph into a 3D Virtual World and its Euclidean map, using the rectangular dualization technique. The nodes of the initial graph are transformed into rooms, the connecting arcs between nodes determine which rooms have to be placed next to each other and define the positions of the doors connecting those rooms. The proposed algorithm is general enough to be used for automatic generation of 3D Virtual Worlds representation of any planar graph, however, our research is particularly focused on the automatic generation of 3D Electronic Institutions from the Performative Structure graph.]]",

keywords = "Euclidean algorithm, virtual reality, rectangular dualization, representations of graphs",

author = "Sara Drago and Anton Bogdanovych and Massimo Ancona and Simoff, {Simeon J.} and Helmut Berger and Carles Sierra and Gillian Dobbie",

year = "2007",

language = "English",

isbn = "1920682430",

booktitle = "Proceedings of the Thirtieth Australasian Conference on Computer Science",

publisher = "Australian Computer Society",

note = "Australasian Computer Science Conference ; Conference date: 17-01-2011",

}

TY - GEN

T1 - From graphs to Euclidean virtual worlds : visualization of 3D electronic institutions

AU - Drago, Sara

AU - Bogdanovych, Anton

AU - Ancona, Massimo

AU - Simoff, Simeon J.

AU - Berger, Helmut

AU - Sierra, Carles

AU - Dobbie, Gillian

PY - 2007

Y1 - 2007

N2 - ![CDATA[In this paper we propose an algorithm for automatic transformation of a graph into a 3D Virtual World and its Euclidean map, using the rectangular dualization technique. The nodes of the initial graph are transformed into rooms, the connecting arcs between nodes determine which rooms have to be placed next to each other and define the positions of the doors connecting those rooms. The proposed algorithm is general enough to be used for automatic generation of 3D Virtual Worlds representation of any planar graph, however, our research is particularly focused on the automatic generation of 3D Electronic Institutions from the Performative Structure graph.]]

AB - ![CDATA[In this paper we propose an algorithm for automatic transformation of a graph into a 3D Virtual World and its Euclidean map, using the rectangular dualization technique. The nodes of the initial graph are transformed into rooms, the connecting arcs between nodes determine which rooms have to be placed next to each other and define the positions of the doors connecting those rooms. The proposed algorithm is general enough to be used for automatic generation of 3D Virtual Worlds representation of any planar graph, however, our research is particularly focused on the automatic generation of 3D Electronic Institutions from the Performative Structure graph.]]

KW - Euclidean algorithm

KW - virtual reality

KW - rectangular dualization

KW - representations of graphs

UR - http://handle.uws.edu.au:8081/1959.7/40999

M3 - Conference Paper

SN - 1920682430

BT - Proceedings of the Thirtieth Australasian Conference on Computer Science

PB - Australian Computer Society

T2 - Australasian Computer Science Conference

Y2 - 17 January 2011

ER -

From graphs to Euclidean virtual worlds : visualization of 3D electronic institutions

Abstract

Conference

Keywords

Other files and links

Fingerprint

Cite this