Graph Drawing

DOI10.1007/11618058zbMATH Open1171.68643OpenAlexW4251892597MaRDI QIDQ5897657FDOQ5897657

Authors: Sheung-Hung Poon 

Publication date: 13 November 2006

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

Full work available at URL: https://doi.org/10.1007/11618058

Recommendations

• On Unfolding Lattice Polygons/Trees and Diameter-4 Trees
• ON UNFOLDING LATTICE POLYGONS/TREES AND DIAMETER-4 TREES
• Polygonal chains cannot lock in 4D
• A note on reconfiguring tree linkages: Trees can lock
• Reconfiguring closed polygonal chains in Euclidean \(d\)-space

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Artificial intelligence for robotics (68T40)

Cited In (5)

• Minimal Locked Trees
• On Unfolding 3D Lattice Polygons and 2D Orthogonal Trees
• A note on reconfiguring tree linkages: Trees can lock
• ON UNFOLDING LATTICE POLYGONS/TREES AND DIAMETER-4 TREES
• On Unfolding Lattice Polygons/Trees and Diameter-4 Trees

This page was built for publication: Graph Drawing

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