On Reconfiguring Radial Trees

Yoshiyuki KUSAKARI

doi:10.1093/ietfec/e89-a.5.1207

On Reconfiguring Radial Trees

Yoshiyuki KUSAKARI

Full Text Views

0

Share
Cite this

Summary :

A linkage is a collection of line segments, called bars, possibly joined at their ends, called joints. We consider flattening a tree-like linkage, that is, a continuous motion of their bars from an initial configuration to a final configuration looking like a"straight line segment," preserving the length of each bar and not crossing any two bars. In this paper, we introduce a new class of linkages, called "radial trees," and show that there exists a radial tree which cannot be flattened.

Publication: IEICE TRANSACTIONS on Fundamentals Vol.E89-A No.5 pp.1207-1214

Publication Date: 2006/05/01

Publicized

Online ISSN: 1745-1337

DOI: 10.1093/ietfec/e89-a.5.1207

Type of Manuscript: Special Section PAPER (Special Section on Discrete Mathematics and Its Applications)

Category

Cite this

Copy

Yoshiyuki KUSAKARI, "On Reconfiguring Radial Trees" in IEICE TRANSACTIONS on Fundamentals, vol. E89-A, no. 5, pp. 1207-1214, May 2006, doi: 10.1093/ietfec/e89-a.5.1207.
Abstract: A linkage is a collection of line segments, called bars, possibly joined at their ends, called joints. We consider flattening a tree-like linkage, that is, a continuous motion of their bars from an initial configuration to a final configuration looking like a"straight line segment," preserving the length of each bar and not crossing any two bars. In this paper, we introduce a new class of linkages, called "radial trees," and show that there exists a radial tree which cannot be flattened.
URL: https://globals.ieice.org/en_transactions/fundamentals/10.1093/ietfec/e89-a.5.1207/_p

Copy

@ARTICLE{e89-a_5_1207,
author={Yoshiyuki KUSAKARI, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={On Reconfiguring Radial Trees},
year={2006},
volume={E89-A},
number={5},
pages={1207-1214},
abstract={A linkage is a collection of line segments, called bars, possibly joined at their ends, called joints. We consider flattening a tree-like linkage, that is, a continuous motion of their bars from an initial configuration to a final configuration looking like a"straight line segment," preserving the length of each bar and not crossing any two bars. In this paper, we introduce a new class of linkages, called "radial trees," and show that there exists a radial tree which cannot be flattened.},
keywords={},
doi={10.1093/ietfec/e89-a.5.1207},
ISSN={1745-1337},
month={May},}

Copy

TY - JOUR
TI - On Reconfiguring Radial Trees
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 1207
EP - 1214
AU - Yoshiyuki KUSAKARI
PY - 2006
DO - 10.1093/ietfec/e89-a.5.1207
JO - IEICE TRANSACTIONS on Fundamentals
SN - 1745-1337
VL - E89-A
IS - 5
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - May 2006
AB - A linkage is a collection of line segments, called bars, possibly joined at their ends, called joints. We consider flattening a tree-like linkage, that is, a continuous motion of their bars from an initial configuration to a final configuration looking like a"straight line segment," preserving the length of each bar and not crossing any two bars. In this paper, we introduce a new class of linkages, called "radial trees," and show that there exists a radial tree which cannot be flattened.
ER -