Minimal Locked Trees

DOI10.1007/978-3-642-03367-4_6zbMath1253.68328OpenAlexW1587165042WikidataQ62041821 ScholiaQ62041821MaRDI QIDQ3183441

Erik D. Demaine, Martin L. Demaine, David Charlton, Ching-Hao Liu, John Iacono, Brad Ballinger, 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)

Related Items (1)

Unnamed Item

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A note on reconfiguring tree linkages: Trees can lock
• Interlocked open and closed linkages with few joints.
• Straightening polygonal arcs and convexifying polygonal cycles
• On Removing a Ball without Disturbing the Others
• On Unfolding Lattice Polygons/Trees and Diameter-4 Trees
• Interlocked open linkages with few joints
• Acute triangulations of polygons
• Graph Drawing

This page was built for publication: Minimal Locked Trees