Minimum Average Distance Triangulations

  • László Kozma
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 7501)


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.


Short Path Network Design Problem Steiner Point Wiener Index Simple Polygon 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Johnson, D.S., Lenstra, J.K., Kan, A.H.G.R.: The complexity of the network design problem. Networks 8(4), 279–285 (1978)MathSciNetzbMATHCrossRefGoogle Scholar
  2. 2.
    Wiener, H.: Structural Determination of Paraffin Boiling Points. J. of the Am. Chem. Soc. 69(1), 17–20 (1947)CrossRefGoogle Scholar
  3. 3.
    Rouvray, D.H.: Predicting chemistry from topology. Sci. Am. 255 (1986)Google Scholar
  4. 4.
    Mohar, B., Pisanski, T.: How to compute the Wiener index of a graph. J. of Mathematical Chemistry 2, 267–277 (1988)MathSciNetCrossRefGoogle Scholar
  5. 5.
    Dobrynin, A.A., Entringer, R., Gutman, I.: Wiener index of trees: Theory and applications. Acta Applicandae Mathematicae 66, 211–249 (2001)MathSciNetzbMATHCrossRefGoogle Scholar
  6. 6.
    Nilsen, C.W.: Wiener index and diameter of a planar graph in subquadratic time (2009)Google Scholar
  7. 7.
    Aurenhammer, F., Xu, Y.: Optimal triangulations. In: Encyclopedia of Optimization, pp. 2757–2764 (2009)Google Scholar
  8. 8.
    Bern, M.W., Eppstein, D.: Mesh generation and optimal triangulation. In: Computing in Euclidean Geometry, pp. 23–90 (1992)Google Scholar
  9. 9.
    Gilbert, P.D.: New results in planar triangulations. Report R-850, Coordinated Sci. Lab., Univ. Illinois, Urbana, IL (1979)Google Scholar
  10. 10.
    Klincsek, G.T.: Minimal triangulations of polygonal domains. Discr. Math. 9, 121–123 (1980)MathSciNetzbMATHCrossRefGoogle Scholar
  11. 11.
    Mulzer, W., Rote, G.: Minimum-weight triangulation is NP-hard. J. ACM 55, 11: 1–11 (2008)MathSciNetCrossRefGoogle Scholar
  12. 12.
    Kozma, L.: Minimum average distance triangulations (2012),
  13. 13.
    Lichtenstein, D.: Planar formulae and their uses. SIAM J. Comput. 11(2), 329–343 (1982)MathSciNetzbMATHCrossRefGoogle Scholar
  14. 14.
    Knuth, D.E., Raghunathan, A.: The problem of compatible representatives. SIAM J. Discr. Math. 5, 422–427 (1992)MathSciNetzbMATHCrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2012

Authors and Affiliations

  • László Kozma
    • 1
  1. 1.Universität des SaarlandesSaarbrückenGermany

Personalised recommendations