通信有效的平面局部Delaunay图的构造
Communication-Efficient Construction of the Plane Localized Delaunay Graph
摘要：
设$V$是平面上的有限点集。我们提出了一个2-局部算法，构造一个平面$\frac{4 π\sqrt{3}}{9}$ -图的单位圆盘图$\UDG(V)$。该算法只进行一轮通信，每个$V$点最多广播5条消息。这改进了Araújo和Rodrigues以前最好的消息界11（Fast localized德洛内三角剖分，Lecture Notes in计算机科学，volume 3544，2004）。
英文摘要：
Let $V$ be a finite set of points in the plane. We present a 2-local algorithm that constructs a plane $\frac{4 π\sqrt{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újo and Rodrigues (Fast localized Delaunay triangulation, Lecture Notes in Computer Science, volume 3544, 2004).
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
