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.
Randomized Incremental Construction for the Hausdorff Voronoi Diagram of point clusters
本文应用随机增量构造(RIC)框架计算了平面上k个点簇的Hausdorff沃罗诺伊图。点的总数为n。该图是基于Hausdorff距离函数的沃罗诺伊图的推广。Hausdorff沃罗诺伊图的组合复杂度是O(n+m),其中m是簇对之间的交叉总数。对于非交叉簇(m=0),算法的时间复杂度为O(n log n + k log n log k),空间复杂度为O(n).对于任意簇(m=O(n^2)),算法的运行时间为O((m+ nlogk)log n),空间为O(m + nlogk)。当聚类交叉时,平分线是断开的曲线,导致断开的Voronoi区域,这对增量构建提出了挑战。本文首次将RIC范式应用于具有不连通区域和不连通平分线的沃罗诺伊图。
A Randomized Incremental Algorithm for the Hausdorff Voronoi Diagram of Non-crossing Clusters
在平面中的一族\emph{clusters of points}的豪斯多夫沃罗诺伊图中,点$t$与簇$P$之间的距离被测量为$t$与$P$中的任何点之间的最大距离,并且该图是在输入簇的最近邻意义上定义的。在本文中,我们考虑%El。平面中的“非交叉”\emph{non-crossing}簇,其中Hausdorff沃罗诺伊图的组合复杂度在所有簇的凸包上的点的总数$n$中是线性的。我们提出了一个随机增量建设,基于点的位置,计算这个图在预期的$O(n\log^2{n})$时间和预期的$O(n)$空间。我们的技术有效地处理非标准特性的广义沃罗诺伊图,如网站的非常数复杂性,网站不封闭在其沃罗诺伊地区,空沃罗诺伊地区。该图在VLSI计算机辅助设计中有直接应用。
Continuation of Point Clouds via Persistence Diagrams
Instituto de Ciências Matemáticas e de Computação, Universidade de São Paulo(圣保罗大学数学与计算科学学院);WPI-Advanced Institute for Materials Research (WPI-AIMR), Tohoku University(东北大学世界顶尖研究中心材料研究高级研究所)