A Delaunay Triangulation Architecture Supporting Churn and User Mobility in MMVEs. Mohsen Ghaffari, Behnoosh Hariri and Shervin Shirmohammadi Advanced Communications Research Institute(ACRI), Sharif University of Technology, Tehran, Iran .
Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author.While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server.
Mohsen Ghaffari, Behnoosh Hariri and Shervin Shirmohammadi
Advanced Communications Research Institute(ACRI), Sharif University of Technology, Tehran, Iran.
Distributed Collaborative Virtual Environment Research Lab., University of Ottawa, Ottawa, Canada.
Send to location
Geometric Routing Overlay
for the packets.
Delaunay Triangulation Graph
Points on a plane
Set of Nodes
Phase Shifted Update Cycles
Update Cycle = T seconds
Since there is no single point where all of information required for checking overlaps is located, we need a distributed method.
To update the red graph to support greedy routing, the idea is to find the overlaps between vertex regions and connect relevant nodes to eliminate this overlaps .
The point is if we connect two nodes, the intersection of their vertex regions would be empty.