On the Area Requirements of Euclidean Minimum Spanning Trees
From MaRDI portal
Publication:5199228
DOI10.1007/978-3-642-22300-6_3zbMath1342.68323MaRDI 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
05C05: Trees
68U05: Computer graphics; computational geometry (digital and algorithmic aspects)
05C85: Graph algorithms (graph-theoretic aspects)
Related Items
Polynomial area bounds for MST embeddings of trees, Approximate proximity drawings, The approximate rectangle of influence drawability problem, Approximate Proximity Drawings