The Internet Archive has a preservation copy of this work in our general collections.
The file type is application/pdf
.
Minimum Average Distance Triangulations
[article]
2012
arXiv
pre-print
We study the problem of finding a triangulation T of a planar point set S such as to minimize the expected distance between two points x and y chosen uniformly at random from S. By distance we mean the length of the shortest path between x and y along edges of T. The length of a path is the sum of the weights of its edges. Edge weights are assumed to be given as part of the problem for every pair of distinct points (x,y) in S^2. In a different variant of the problem, the points are vertices of
arXiv:1112.1828v3
fatcat:kqckfoxjtre4dd43vx3thwywo4