The Fréchet distance is a similarity measure between two curves $A$ and $B$: Informally, it is the minimum length of a leash required to connect a dog, constrained to be on $A$, and its owner, constrained to be on $B$, as they walk without backtracking along their respective curves from one endpoint to the other. The advantage of this measure on other measures such as the Hausdorff distance is that it takes into account the ordering of the points along the curves.
The discrete Fréchet distance replaces the dog and its owner by a pair of frogs that can only reside on $n$ and $m$ specific pebbles on the curves $A$ and $B$, respectively. These frogs hop from a pebble to the next without backtracking. The discrete Fréchet distance can be computed by a rather straightforward quadratic dynamic programming algorithm. However, despite a considerable amount of work on this problem and its variations, there is no subquadratic algorithm known, even for approximation versions of the problem.
In this paper we present a subquadratic algorithm for computing the discrete Fréchet distance between two sequences of points in the plane, of respective lengths $m\le n$. The algorithm runs in $O(\dfrac{mn\log\log n}{\log n})$ time and uses $O(n+m)$ storage. Our approach uses the geometry of the problem in a subtle way to encode legal positions of the frogs as states of a finite automata.
Truly Subquadratic Time Algorithms for Diameter and Related Problems in Graphs of Bounded VC-dimension
University of Illinois at Urbana-Champaign(伊利诺伊大学厄巴纳-香槟分校);Dartmouth College(达特茅斯学院);Rutgers University(罗格斯大学);Aalto University(阿尔托大学);UMass Amherst(马萨诸塞大学阿默斯特分校);Institute of Science and Technology Austria(奥地利科学技术研究所)
Charting the Diameter Computation Landscape on Intersection Graphs in the Plane
University of Illinois at Urbana-Champaign(伊利诺伊大学厄巴纳-香槟分校);Dartmouth College(达特茅斯学院);Rutgers University(罗格斯大学);Aalto University(阿尔托大学);UMass Amherst(马萨诸塞大学阿默斯特分校);Institute of Science and Technology Austria(奥地利科学技术研究所)
Charting the Diameter Computation Landscape of Geometric Intersection Graphs in Three Dimensions and Higher
University of Illinois at Urbana-Champaign(伊利诺伊大学厄巴纳-香槟分校);Dartmouth College(达特茅斯学院);Rutgers University(罗格斯大学);Aalto University, Finland(芬兰阿尔托大学);UMass Amherst(马萨诸塞大学阿默斯特分校);Institute of Science and Technology Austria(奥地利科学技术研究所)
Walking the Dog Fast in Practice: Algorithm Engineering of the Fréchet Distance
Fréchet距离为计算两条(多边形)曲线的相似性的流行任务提供了一种自然和直观的度量。虽然一个简单的算法计算它在近二次时间,一个强次二次算法不存在,除非强指数时间假设失败。尽管如此,Fréchet距离的快速实际实现,特别是对于真实的输入曲线,是非常可取的。这甚至导致了一个指定的竞争,ACM SIGSPATIAL GIS Cup 2017:在这里,挑战是在Fréchet距离下实现近邻数据结构。前三个实现的瓶颈恰恰是Fréchet距离的决策过程。在这项工作中,我们提出了一个快速的,认证的实现决定Fréchet距离,以(1)补充其悲观的最坏情况下的硬度通过对现实的输入数据的实证分析,并(2)提高GIS杯挑战的最先进的。我们的实验评估我们的实现一个大型的基准组成的几个数据集(包括手写字符和GPS轨迹)。的GIS杯的获奖实施相比,我们获得了运行时间的改善,高达两个以上的数量级的决策过程和查询的近邻数据结构的因素高达30。
Algorithms for Distance Problems in Continuous Graphs
University of Ljubljana(卢布尔雅那大学);Institute of Mathematics, Physics and Mechanics(数学、物理与力学研究所);University of Seville(塞维利亚大学);Technical University of Dortmund(多特蒙德工业大学);Universitat Politècnica de Catalunya(加泰罗尼亚理工大学)
研究连续图直径和平均距离计算问题,利用几何技术为两类稀疏图设计次二次时间算法,树宽至多为\(k\)的连续图计算时间为\(O(n\log^{O(k)} n)\),\(n\)个顶点\(F\)个面的连续平面图计算时间为\(O(n F \log n)\)。
Computing All Optimal Partial $p$-Wasserstein Matchings on the Line
Karlsruhe Institute of Technology(卡尔斯鲁厄理工学院);University of Copenhagen(哥本哈根大学);Université Paris Cité, IRIF(巴黎西岱大学);ETH Zurich(苏黎世联邦理工学院);University of Maryland, College Park(马里兰大学帕克分校);Université Côte d’Azur, CNRS, Inria(蔚蓝海岸大学);Boston University(波士顿大学);North Carolina State University(北卡罗来纳州立大学)
Eindhoven University of Technology(埃因霍温理工大学);POSTECH(浦项科技大学);ETH Zürich(苏黎世联邦理工学院);Saarland University(萨尔兰大学);Humboldt-University Berlin(柏林洪堡大学);Aalto University(阿尔托大学);University of Hamburg(汉堡大学)