On the Area Requirements of Euclidean Minimum Spanning Trees

DOI10.1007/978-3-642-22300-6_3zbMath1342.68323OpenAlexW1601733264MaRDI QIDQ5199228

Patrizio Angelini, Marco Chiesa, Michael Kaufmann, Fabrizio Frati, Claudio Squarcella, Till Bruckdorfer

Publication date: 12 August 2011

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: http://infoscience.epfl.ch/record/175657

Mathematics Subject Classification ID

Trees (05C05) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (4)

Approximate Proximity Drawings ⋮ Approximate proximity drawings ⋮ Polynomial area bounds for MST embeddings of trees ⋮ The approximate rectangle of influence drawability problem

This page was built for publication: On the Area Requirements of Euclidean Minimum Spanning Trees