On Unfolding Lattice Polygons/Trees and Diameter-4 Trees

DOI10.1007/11809678_21zbMath1162.68762OpenAlexW2152093010MaRDI QIDQ3591320

Sheung-Hung Poon

Publication date: 10 September 2007

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

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

zbMATH Keywords

computational geometryunfoldingstraighteningconvexifying

Mathematics Subject Classification ID

Trees (05C05) Computational aspects related to convexity (52B55) Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Related Items (2)

Minimal Locked Trees ⋮ On Unfolding 3D Lattice Polygons and 2D Orthogonal Trees

This page was built for publication: On Unfolding Lattice Polygons/Trees and Diameter-4 Trees