On Unfolding 3D Lattice Polygons and 2D Orthogonal Trees (Q3511349): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1007/978-3-540-69733-6_37
+Normal rank
@@ Property / OpenAlex ID @@
+W2159554525
@@ Property / OpenAlex ID: W2159554525 / rank @@
+Normal rank
@@ Property / cites work @@
+The complexity of (un)folding
@@ Property / cites work: The complexity of (un)folding / rank @@
+Normal rank
@@ Property / cites work @@
+A note on reconfiguring tree linkages: Trees can lock
+Normal rank
@@ Property / cites work @@
+Locked and unlocked polygonal chains in three dimensions
+Normal rank
@@ Property / cites work @@
+An energy-driven approach to linkage unfolding
@@ Property / cites work: An energy-driven approach to linkage unfolding / rank @@
+Normal rank
@@ Property / cites work @@
+Polygonal chains cannot lock in 4D
@@ Property / cites work: Polygonal chains cannot lock in 4D / rank @@
+Normal rank
@@ Property / cites work @@
+Q4797605
@@ Property / cites work: Q4797605 / rank @@
+Normal rank
@@ Property / cites work @@
+Straightening polygonal arcs and convexifying polygonal cycles
+Normal rank
@@ Property / cites work @@
+Unfolding Manhattan towers
@@ Property / cites work: Unfolding Manhattan towers / rank @@
+Normal rank
@@ Property / cites work @@
+Graph Drawing
@@ Property / cites work: Graph Drawing / rank @@
+Normal rank
@@ Property / cites work @@
+On Unfolding Lattice Polygons/Trees and Diameter-4 Trees
+Normal rank