Presentation 2001/10/12
Planar Reconfiguration of Monotone Trees
Yoshiyuki KUSAKARI, Masaki SATO, Takao NISHIZEKI,
PDF Download Page PDF download Page Link
Abstract(in Japanese) (See Japanese page)
Abstract(in English) A linkage is a collection of line segments, called bars, possibly joined at their ends, called joints. A planar reconfiguration of a linkage is a continuous motion of their bars, preserving the length of each bar and disallowing bars to cross. In this paper, we introduce a class of linkages, called "monotone trees, " and give a method for reconfiguring a monotone tree to a straight line. If the tree has n joints, then the method takes at most n-1 moves, each of which uses two joints. We also obtain an algorithm to find such a method in time Ο(n log n), using space Ο(n). These time and space complexities and optimal.
Keyword(in Japanese) (See Japanese page)
Keyword(in English) linkage / monotone tree / planarreconfiguration / straightening / pulling operation / order graph
Paper # COMP 2001-42
Date of Issue

Conference Information
Committee COMP
Conference Date 2001/10/12(1days)
Place (in Japanese) (See Japanese page)
Place (in English)
Topics (in Japanese) (See Japanese page)
Topics (in English)
Chair
Vice Chair
Secretary
Assistant

Paper Information
Registration To Theoretical Foundations of Computing (COMP)
Language JPN
Title (in Japanese) (See Japanese page)
Sub Title (in Japanese) (See Japanese page)
Title (in English) Planar Reconfiguration of Monotone Trees
Sub Title (in English)
Keyword(1) linkage
Keyword(2) monotone tree
Keyword(3) planarreconfiguration
Keyword(4) straightening
Keyword(5) pulling operation
Keyword(6) order graph
1st Author's Name Yoshiyuki KUSAKARI
1st Author's Affiliation Department of Electronics and Information Systems, Faculty of Systems Science and Technology, Akita Prefectural University()
2nd Author's Name Masaki SATO
2nd Author's Affiliation Industrial Systems Eng. Dept. 1, DENSO CORPORATION
3rd Author's Name Takao NISHIZEKI
3rd Author's Affiliation Graduate School of Information Science, Tohoku University
Date 2001/10/12
Paper # COMP 2001-42
Volume (vol) vol.101
Number (no) 376
Page pp.pp.-
#Pages 7
Date of Issue