On reconfiguring radial trees

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2866, Issue , 2003, Pages 182-191

  Kusakari, Yoshiyuki ^a  

^a AKITA PREFECTURAL UNIVERSITY   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL GEOMETRY;

CONTINUOUS MOTIONS; INITIAL CONFIGURATION; LINE SEGMENT; STRAIGHT-LINE SEGMENTS;

FORESTRY;

EID: 33646755660     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-44400-8_19     Document Type: Article

References (7)

1. H. Alt, C. Knauer, G. Rote, and S. Whitesides, The Complexity of (Un)folding, In Proceeding of 19th ACM Symposium on Computational Geometry, 2003, to appear.
2. T. Biedl, E. Demaine, M. Demaine, S. Lazard, A. Lubiw, J. O'Rourke, S. Robbins, I. Streinu, G. Toussaint, and S. Whitesides, A note on reconfiguring tree linkages: Trees can lock, Discrete Applied Mathematics, vol. 254, pp.19-32, 2002.
3. A preliminary version appeared in Proceedings of 10th Canadian Conference on Computational Geometry, 1998.
4. R. Connelly, E. Demaine, and G. Rote, Straightening polygonal arcs and convexifying polygonal cycles, In Proceedings of 41st IEEE Symposium on Foundations of Computer Science, 2000.
5. 3, American Mathematical Society, pp. 287-311,2002.
6. A preliminary version appeared in in Proceedings of the 11th Annual Fall Workshop on Computational Geometry, 2001.
7. Y. Kusakari, M. Sato, and T. Nishizeki, Planar Reconfiguration of Monotone Trees, IEICE Trans. Fund., Vol.E85-A, No.5, pp.938-943, 2002.