Advertisement

On the Area Requirements of Euclidean Minimum Spanning Trees

  • Patrizio Angelini
  • Till Bruckdorfer
  • Marco Chiesa
  • Fabrizio Frati
  • Michael Kaufmann
  • Claudio Squarcella
Part of the Lecture Notes in Computer Science book series (LNCS, volume 6844)

Abstract

In their seminal paper on Euclidean minimum spanning trees [Discrete & Computational Geometry, 1992], Monma and Suri proved that any tree of maximum degree 5 admits a planar embedding as a Euclidean minimum spanning tree. Their algorithm constructs embeddings with exponential area; however, the authors conjectured that c n ×c n area is sometimes required to embed an n-vertex tree of maximum degree 5 as a Euclidean minimum spanning tree, for some constant c > 1. In this paper, we prove the first exponential lower bound on the area requirements for embedding trees as Euclidean minimum spanning trees.

Keywords

Maximum Degree Minimum Span Tree Edge Incident Area Requirement Clockwise Order 
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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Angelini, P., Bruckdorfer, T., Chiesa, M., Frati, F., Kaufmann, M., Squarcella, C.: On the area requirements of Euclidean minimum spanning trees. Technical Report RT-DIA-183-2011, Dept. Comp. Sci. Autom., Roma Tre University (2011)Google Scholar
  2. 2.
    Arora, S.: Polynomial time approximation schemes for Euclidean traveling salesman and other geometric problems. J. ACM 45(5), 753–782 (1998)MathSciNetCrossRefzbMATHGoogle Scholar
  3. 3.
    Bose, P., Lenhart, W., Liotta, G.: Characterizing proximity trees. Algorithmica 16(1), 83–110 (1996)MathSciNetCrossRefzbMATHGoogle Scholar
  4. 4.
    Chan, T.M.: Euclidean bounded-degree spanning tree ratios. Discr. Comp. Geom. 32(2), 177–194 (2004)MathSciNetzbMATHGoogle Scholar
  5. 5.
    Di Giacomo, E., Didimo, W., Liotta, G., Meijer, H.: Drawing a tree as a minimum spanning tree approximation. In: Cheong, O., Chwa, K.-Y., Park, K. (eds.) ISAAC 2010, Part II. LNCS, vol. 6507, pp. 61–72. Springer, Heidelberg (2010)CrossRefGoogle Scholar
  6. 6.
    Eades, P., Whitesides, S.: The realization problem for Euclidean minimum spanning trees is NP-hard. Algorithmica 16(1), 60–82 (1996)MathSciNetCrossRefzbMATHGoogle Scholar
  7. 7.
    Francke, A., Hoffmann, M.: The Euclidean degree-4 minimum spanning tree problem is NP-hard. In: SoCG 2009, pp. 179–188 (2009)Google Scholar
  8. 8.
    Frati, F., Kaufmann, M.: Polynomial area bounds for MST embeddings of trees. Tech. Report RT-DIA-122-2008, Dept. of Comp. Sci. Autom., Roma Tre University (2008)Google Scholar
  9. 9.
    Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W.H. Freeman, New York (1979)zbMATHGoogle Scholar
  10. 10.
    Hurtado, F., Liotta, G., Wood, D.R.: Proximity drawings of high-degree trees. In: CoRR, abs/1008.3193 (2010)Google Scholar
  11. 11.
    Jothi, R., Raghavachari, B.: Degree-bounded minimum spanning trees. Discr. Appl. Math. 157(5), 960–970 (2009)MathSciNetCrossRefzbMATHGoogle Scholar
  12. 12.
    Kaufmann, M.: Polynomial area bounds for MST embeddings of trees. In: Hong, S.-H., Nishizeki, T., Quan, W. (eds.) GD 2007. LNCS, vol. 4875, pp. 88–100. Springer, Heidelberg (2008)CrossRefGoogle Scholar
  13. 13.
    Liotta, G.: Handbook of Graph Drawing, ch.4. In: Tamassia, R. (ed.). CRC Press, Boca Raton (2011)Google Scholar
  14. 14.
    Liotta, G., Tamassia, R., Tollis, I.G., Vocca, P.: Area requirement of Gabriel drawings. In: Bongiovanni, G., Bovet, D.P., Di Battista, G. (eds.) CIAC 1997. LNCS, vol. 1203, pp. 135–146. Springer, Heidelberg (1997)CrossRefGoogle Scholar
  15. 15.
    Mitchell, J.S.B.: Guillotine subdivisions approximate polygonal subdivisions: A simple polynomial-time approximation scheme for geometric TSP, k-MST, and related problems. SIAM J. Comput. 28(4), 1298–1309 (1999)MathSciNetCrossRefzbMATHGoogle Scholar
  16. 16.
    Monma, C.L., Suri, S.: Transitions in geometric minimum spanning trees. Discr. Comput. Geom. 8, 265–293 (1992)MathSciNetCrossRefzbMATHGoogle Scholar
  17. 17.
    Papadimitriou, C.H., Vazirani, U.V.: On two geometric problems related to the traveling salesman problem. J. Algorithms 5, 231–246 (1984)MathSciNetCrossRefzbMATHGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2011

Authors and Affiliations

  • Patrizio Angelini
    • 1
  • Till Bruckdorfer
    • 2
  • Marco Chiesa
    • 1
  • Fabrizio Frati
    • 1
    • 3
  • Michael Kaufmann
    • 2
  • Claudio Squarcella
    • 1
  1. 1.Dipartimento di Informatica e AutomazioneUniversità Roma TreItaly
  2. 2.Wilhelm-Schickard-Institut für InformatikUniversität TübingenGermany
  3. 3.School of Basic SciencesÉcole Polytechnique Fédérale de LausanneSwitzerland

Personalised recommendations