arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1304.1909cs.CG
收藏

网络最远点图

Network Farthest-Point Diagrams

Prosenjit Bose, Kai Dannies, Jean-Lou De Carufel, Christoph Doell, Carsten Grimm, Anil Maheshwari, Stefan Schirra, Michiel Smid

摘要:

考虑沿着网络边缘的点的连续体,即,具有正边权重的无向图。我们用沿着网络的最短路径距离来测量这些点之间的距离,称为网络距离。在这个度量空间中,我们研究最远的点。我们介绍网络最远点图,它捕捉最远点-以及到它们的距离-在我们遍历网络时如何变化。我们对网络G进行预处理,使得当给定G上的查询点q时,我们可以快速确定G中距离q最远的点以及G中距离q最远的距离。此外,我们引入了一个数据结构,支持查询的部分网络,远离q比某个阈值R> 0,其中R是查询的一部分。我们还介绍了最小偏心馈电链路的问题,定义如下。给定一个具有几何边权的网络G和一个不在G上的点p,用一条直线段pq将p连接到G上的一个点q,称为馈电链路,使得从p到所得网络中任何点的最大网络距离最小化。我们解决了最小偏心馈电链路问题,使用偏心图。此外,我们为查询版本提供了一个数据结构,其中网络G是固定的,查询由点p组成。

英文摘要:

Consider the continuum of points along the edges of a network, i.e., an undirected graph with positive edge weights. We measure distance between these points in terms of the shortest path distance along the network, known as the network distance. Within this metric space, we study farthest points. We introduce network farthest-point diagrams, which capture how the farthest points---and the distance to them---change as we traverse the network. We preprocess a network G such that, when given a query point q on G, we can quickly determine the farthest point(s) from q in G as well as the farthest distance from q in G. Furthermore, we introduce a data structure supporting queries for the parts of the network that are farther away from q than some threshold R > 0, where R is part of the query. We also introduce the minimum eccentricity feed-link problem defined as follows. Given a network G with geometric edge weights and a point p that is not on G, connect p to a point q on G with a straight line segment pq, called a feed-link, such that the largest network distance from p to any point in the resulting network is minimized. We solve the minimum eccentricity feed-link problem using eccentricity diagrams. In addition, we provide a data structure for the query version, where the network G is fixed and a query consists of the point p.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑