Minimal Locked Trees

DOI10.1007/978-3-642-03367-4_6MaRDI QIDQ3183441zbMATH OpenOpenAlexDBLPWikidataFDO

Authors Brad Ballinger, David Charlton, Erik D. Demaine, Martin L. Demaine, John Iacono, Ching-Hao Liu, Sheung-Hung Poon

Publication date 20 October 2009

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

Full work available at URL http://hdl.handle.net/1721.1/61781

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Recommendations

• Minimal configuration trees
• Minimal congestion trees
• Minimal spanning forests
• Minimal spanning trees
• Random Minimal Trees
• scientific article; zbMATH DE number 3846542
• Steiner minimal trees
• Minimum spanning trees
• Minimal Huffman trees

Cites work

• scientific article; zbMATH DE number 5506193 (Why is no real title available?)
• scientific article; zbMATH DE number 3945379 (Why is no real title available?)
• scientific article; zbMATH DE number 2145225 (Why is no real title available?)
• scientific article; zbMATH DE number 1877249 (Why is no real title available?)
• A note on reconfiguring tree linkages: Trees can lock
• Acute triangulations of polygons
• Graph Drawing
• Interlocked open and closed linkages with few joints.
• Interlocked open linkages with few joints
• On Removing a Ball without Disturbing the Others
• On Unfolding Lattice Polygons/Trees and Diameter-4 Trees
• Straightening polygonal arcs and convexifying polygonal cycles

Cited in

(4)

• Locked and unlocked smooth embeddings of surfaces
• Minimally colored trees
• A KNOTTED MINIMAL TREE
• scientific article; zbMATH DE number 1877249 (Why is no real title available?)

This page was built for publication: Minimal Locked Trees

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