Euclidean representation of 3D electronic institutions: automatic generation

Authors:
Anton Bogdanovych;Sara Drago
Affiliations:
University of Technology Sydney, Broadway, Australia;University of Genoa, Italy
Venue:
Proceedings of the working conference on Advanced visual interfaces
Year:
2006

Citing 5
Cited 2

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
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
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

A methodology for 3D electronic institutions

Proceedings of the 6th international joint conference on Autonomous agents and multiagent systems
A methodology for developing multiagent systems as 3D electronic institutions

AOSE'07 Proceedings of the 8th international conference on Agent-oriented software engineering VIII

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper we present the 3D Electronic Institutions metaphor and show how it can be used for the specification of highly secure Virtual Worlds and how 3D Virtual Worlds can be automatically generated from this specification. To achieve the generation task we propose an algorithm for automatic transformation of the Performative Structure graph into a 3D Virtual World, 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 sufficiently general to be used for transforming any planar graph into a 3D Virtual World.