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

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: The complexity of (un)folding / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on reconfiguring tree linkages: Trees can lock / rank
 
Normal rank
Property / cites work
 
Property / cites work: Locked and unlocked polygonal chains in three dimensions / rank
 
Normal rank
Property / cites work
 
Property / cites work: An energy-driven approach to linkage unfolding / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polygonal chains cannot lock in 4D / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4797605 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Straightening polygonal arcs and convexifying polygonal cycles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Unfolding Manhattan towers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph Drawing / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Unfolding Lattice Polygons/Trees and Diameter-4 Trees / rank
 
Normal rank

Latest revision as of 13:12, 28 June 2024

scientific article
Language Label Description Also known as
English
On Unfolding 3D Lattice Polygons and 2D Orthogonal Trees
scientific article

    Statements