Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

11

IEICET
2006

favoriteEmaildiscussreport

80views more IEICET 2006»

On Reconfiguring Radial Trees

13 years 4 months ago

On Reconfiguring Radial Trees

Download www.akita-pu.ac.jp

A linkage is a collection of line segments, called bars, possibly joined at their ends, called joints. Straightening a tree linkage is a continuous motion of their bars from an initial configuration to a "straight line segment," preserving the length of each bar and excepting 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 can not be straightened.

Yoshiyuki Kusakari

Real-time Traffic

IEICET 2006 | Line Segment | Straight Line Segment | Tree Linkage |

claim paper

Related Content

» Selecting effective siRNA sequences by using radial basis function network and decision tr...

» Efficient evaluation of radial queries using the target tree

» Labeled Radial Drawing of Data Structures

» Stock Index Modeling Using Hierarchical Radial Basis Function Networks

» TimeRadarTrees Visualizing Dynamic Compound Digraphs

» MoireGraphs Radial FocusContext Visualization and Interaction for Graphs with Visual Nodes

» Statistical analysis of the social network and discussion threads in slashdot

» A hierarchical RBF online learning algorithm for realtime 3D scanner

» A Dynamic Reconfiguration Tolerant Selfstabilizing Token Circulation Algorithm in AdHoc Ne...

Post Info
More Details (n/a)

Added	12 Dec 2010
Updated	12 Dec 2010
Type	Journal
Year	2006
Where	IEICET
Authors	Yoshiyuki Kusakari

Comments (0)