Delineating imprecise regions via shortest-path graphs
Delineating imprecise regions via shortest-path graphs
复制标题
通过最短路径图描绘不精确的区域
DOI：
--
复制
发表时间：
2011
期刊：
影响因子：
--
通讯作者：
B. Speckmann
中科院分区：
文献类型：
--
作者：
M. D. Berg;Wouter Meulemans;B. Speckmann
不精确的区域，也被称为白话区，是指没有精确或行政边界的区域。我们提出了一种新的方法来从一组可能位于区域内的点来描绘不精确的区域。我们使用基于欧几里得平方距离的最短路径图，很好地捕捉到了区域边界的形状。最短路径图自然适应不同密度的点集，并且它们总是相连的。与邻域图不同，它们使用非局部标准来确定要连接的点。此外，最短路径图可以很容易地扩展，通过将上下文建模为“软”障碍来考虑地理上下文。我们给出了计算有或没有地理背景的最短路径图的有效算法。我们通过实验评估了用我们的方法计算的不精确区域的质量。为了公平地将我们的结果与普通KDE方法获得的结果进行比较，我们还展示了如何通过再次使用软障碍将上下文集成到KDE中。
An imprecise region, also called a vernacular region, is a region without a precise or administrative boundary. We present a new method to delineate imprecise regions from a set of points that are likely to lie inside the region. We use shortest-path graphs based on the squared Euclidean distance which capture the shape of region boundaries well. Shortest-path graphs naturally adapt to point sets of varying density, and they are always connected. As opposed to neighborhood graphs, they use a non-local criterion to determine which points to connect. Furthermore, shortest-path graphs can easily be extended to take geographic context into account by modeling context as "soft" obstacles. We present efficient algorithms to compute shortest-path graphs with or without geographic context. We experimentally evaluate the quality of the imprecise regions computed with our method. To fairly compare our results to those obtained by the common KDE approach, we also show how to integrate context into KDE by again using soft obstacles.