AOI cast by tolerance based compass routing in distributed virtual environments
Michele Albano, Antonio Quartulli, Laura Ricci, Luca Genovali · 2009
strategy for P2P Distributed Virtual Environment (DVE) which exploits a Delaunay Triangulation of the DVE to define a compass-based routing algorithm. A set of formal results for circular AOI is presented. Inconsistencies between local views of different peers due to the network latency are faced by introducing a tolerance threashold in the compass routing. I. COMPASS ROUTING IN VORONOI DVES A Voronoi tessellation [3] partitions a DVE into k areas such that the area corresponding to a peer p includes all the points of the DV E which are closer to p than to any other peer. Two peers are Voronoi neighbours iff the borders of their areas overlap. The connected graph defined by linking neighbouring peers is the Delaunay Triangulation corresponding to the Voronoi tessellation. Recently, several Voronoi based DVE [1], [5] have been proposed.