Minimum Average Distance Triangulations
- 1.7k Downloads
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, with edge weights given as part of the problem. In a different variant of the problem, the points are vertices of a simple polygon and we look for a triangulation of the interior of the polygon that is optimal in the same sense. We prove that a general formulation of the problem in which the weights are arbitrary positive numbers is strongly NP-complete. For the case when all weights are equal we give polynomial-time algorithms. In the end we mention several open problems.
KeywordsShort Path Network Design Problem Steiner Point Wiener Index Simple Polygon
Unable to display preview. Download preview PDF.
- 3.Rouvray, D.H.: Predicting chemistry from topology. Sci. Am. 255 (1986)Google Scholar
- 6.Nilsen, C.W.: Wiener index and diameter of a planar graph in subquadratic time (2009)Google Scholar
- 7.Aurenhammer, F., Xu, Y.: Optimal triangulations. In: Encyclopedia of Optimization, pp. 2757–2764 (2009)Google Scholar
- 8.Bern, M.W., Eppstein, D.: Mesh generation and optimal triangulation. In: Computing in Euclidean Geometry, pp. 23–90 (1992)Google Scholar
- 9.Gilbert, P.D.: New results in planar triangulations. Report R-850, Coordinated Sci. Lab., Univ. Illinois, Urbana, IL (1979)Google Scholar
- 12.Kozma, L.: Minimum average distance triangulations (2012), http://arxiv.org/abs/1112.1828