Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

14

CORR
2008
Springer

favoriteEmaildiscussreport

90views Education» more CORR 2008»

Communication-Efficient Construction of the Plane Localized Delaunay Graph

13 years 4 months ago

Communication-Efficient Construction of the Plane Localized Delaunay Graph

Download www.scs.carleton.ca

Let V be a finite set of points in the plane. We present a 2-local algorithm that constructs a plane 4 3 9 -spanner of the unit-disk graph UDG(V ). This algorithm makes only one round of communication and each point of V broadcasts at most 5 messages. This improves the previously best message-bound of 11 by Ara

Prosenjit Bose, Paz Carmi, Michiel H. M. Smid, Dam

Real-time Traffic

2-local Algorithm | CORR 2008 | Delaunay Triangulation | Education | Unit-disk Graph |

claim paper

Related Content

» Efficient minimum spanning tree construction without Delaunay triangulation

» Exact Delaunay graph of smooth convex pseudocircles general predicates and implementation ...

» On locally Delaunay geometric graphs

» ConnectivityBased Localization of Large Scale Sensor Networks with Complex Shape

» Fast and Efficient Restricted Delaunay Triangulation in Random Geometric Graphs

» Localized construction of bounded degree and planar spanner for wireless ad hoc networks

» Geometric Spanners for Wireless Ad Hoc Networks

» Memory Requirements for Local Geometric Routing and Traversal in Digraphs

» Surface processing methods for point sets using finite elements

Post Info
More Details (n/a)

Added	09 Dec 2010
Updated	09 Dec 2010
Type	Journal
Year	2008
Where	CORR
Authors	Prosenjit Bose, Paz Carmi, Michiel H. M. Smid, Daming Xu

Comments (0)