Master of Science in Computer Science
First Committee Member
Laxmi P. Gewali, Chair
Second Committee Member
Ajo K. Datta
Third Committee Member
John T. Minor
Graduate Faculty Representative
Number of Pages
Delaunay graphs have been used in CAD/CAM, sensor network and geographic information systems. We investigate the reliability properties of nodes in Delaunay graphs. For measuring the reliability we formulate the concept of roaming-region for nodes. A node v with large roaming-region r(v) such that v is positioned near the center of r(v) is identified as a reliable node. We develop algorithms for constructing roaming-regions and present an implementation of the proposed algorithm in the Java programming language.
Geographic information systems; Roaming (Telecommunication); Sensor networks; Triangulation
Computer Sciences | Programming Languages and Compilers | Theory and Algorithms
Hada, Romas James, "Roaming region for Delaunay triangulation" (2011). UNLV Theses, Dissertations, Professional Papers, and Capstones. 1242.