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

Authors:
Sara Drago;Anton Bogdanovych;Massimo Ancona;Simeon Simoff;Helmut Berger;Carles Sierra
Affiliations:
University of Genoa, Geneva, Italy;University of Technology Sydney, Sydney, NSW, Australia;University of Genoa, Geneva, Italy;University of Technology Sydney, Sydney, NSW, Australia;Electronic Commerce Competence Center, Wien, Austria;Artificial Intelligence Research Institute (IIIA-CSIC), Barcelona, Catalonia, Spain
Venue:
ACSC '07 Proceedings of the thirtieth Australasian conference on Computer science - Volume 62
Year:
2007

Citing 14
Cited 1

Arboricity and subgraph listing algorithms

SIAM Journal on Computing
Efficient algorithms for finding maximum matching in graphs

ACM Computing Surveys (CSUR)
Offices are open systems

ACM Transactions on Information Systems (TOIS) - Special issue: selected papers from the conference on office information systems
On floorplans of planar graphs

STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Efficient algorithms for Petersen's matching theorem

Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
ISLANDER: an electronic institutions editor

Proceedings of the first international joint conference on Autonomous agents and multiagent systems: part 3
Edge dominating and hypomatchable sets

SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Two Algorithms for Finding Rectangular Duals of Planar Graphs

WG '93 Proceedings of the 19th International Workshop on Graph-Theoretic Concepts in Computer Science
An algorithm for finding a rectangular dual of a planar graph for use in area planning for VLSI integrated circuits.

DAC '84 Proceedings of the 21st Design Automation Conference
Travel in Immersive Virtual Environments: An Evaluation of Viewpoint Motion Control Techniques

VRAIS '97 Proceedings of the 1997 Virtual Reality Annual International Symposium (VRAIS '97)
Mapping Information onto 3D Virtual Worlds

IV '00 Proceedings of the International Conference on Information Visualisation
Matching: a well-solved class of integer linear programs

Combinatorial optimization - Eureka, you shrink!
An Introduction to 3-D User Interface Design

Presence: Teleoperators and Virtual Environments
Narrowing the gap between humans and agents in e-commerce: 3D electronic institutions

EC-Web'05 Proceedings of the 6th international conference on E-Commerce and Web Technologies

Developing virtual heritage applications as normative multiagent systems

AOSE'10 Proceedings of the 10th international conference on Agent-oriented software engineering

Quantified Score

Hi-index	0.00

Visualization

Abstract

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 particulary focused on the automatic generation of 3D Electronic Institutions from the Performative Structure graph.