A Locked Orthogonal Tree

Simple item page
dc.creatorCharlton, David
dc.creatorDemaine, Erik D.
dc.creatorDemaine, Martin L.
dc.creatorPrice, Gregory
dc.creatorTu, Yaa-Lirng
dc.date2008-01-29
dc.date.accessioned2026-07-07T08:57:03Z
dc.date.available2026-07-07T08:57:03Z
dc.descriptionWe give a counterexample to a conjecture of Poon [Poo06] that any orthogonal tree in two dimensions can always be flattened by a continuous motion that preserves edge lengths and avoids self-intersection. We show our example is locked by extending results on strongly locked self-touching linkages due to Connelly, Demaine and Rote [CDR02] to allow zero-length edges as defined in [ADG07], which may be of independent interest. Our results also yield a locked tree with only eleven edges, which is the smallest known example of a locked tree.
dc.identifierhttps://arxiv.org/abs/0801.4405
dc.identifierhttp://arxiv.org/abs/0801.4405
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/146826
dc.subjectComputational Geometry
dc.titleA Locked Orthogonal Tree
dc.typetext

Files

Collections

arXiv