On Unfolding 3D Lattice Polygons and 2D Orthogonal Trees
From MaRDI portal
Publication:3511349
DOI10.1007/978-3-540-69733-6_37zbMath1148.68553WikidataQ62041828 ScholiaQ62041828MaRDI QIDQ3511349
Publication date: 10 July 2008
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-69733-6_37
68R10: Graph theory (including graph drawing) in computer science
68U05: Computer graphics; computational geometry (digital and algorithmic aspects)
Cites Work
- Unnamed Item
- A note on reconfiguring tree linkages: Trees can lock
- Straightening polygonal arcs and convexifying polygonal cycles
- Unfolding Manhattan towers
- On Unfolding Lattice Polygons/Trees and Diameter-4 Trees
- The complexity of (un)folding
- An energy-driven approach to linkage unfolding
- Graph Drawing
- Polygonal chains cannot lock in 4D
- Locked and unlocked polygonal chains in three dimensions