On the area requirements of Euclidean minimum spanning trees

DOI10.1007/978-3-642-22300-6_3MaRDI QIDQ5199228zbMATH OpenOpenAlexFDO

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

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) Graph algorithms (graph-theoretic aspects) (05C85) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Recommendations

• On the area requirements of Euclidean minimum spanning trees
• Polynomial area bounds for MST embeddings of trees
• Polynomial Area Bounds for MST Embeddings of Trees
• Drawing a tree as a minimum spanning tree approximation
• Drawing a tree as a minimum spanning tree approximation

Cited in

(11)

• The realization problem for Euclidean minimum spanning trees is NP-hard
• Approximate proximity drawings
• The approximate rectangle of influence drawability problem
• Drawing a tree as a minimum spanning tree approximation
• Approximate proximity drawings
• On the number of leaves of a euclidean minimal spanning tree
• On the area requirements of Euclidean minimum spanning trees
• Drawing a tree as a minimum spanning tree approximation
• Testing Euclidean minimum spanning trees in the plane
• Polynomial Area Bounds for MST Embeddings of Trees
• Polynomial area bounds for MST embeddings of trees

This page was built for publication: On the area requirements of Euclidean minimum spanning trees

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5199228)