Earticle

초록

영어

In many elds of computer science and other engineering areas, we often need to balance multi-articulated structures. In this paper, we formalize this kind of balancing problem from a more physical and theoretical point of view. Through describing details of all the solution steps, we nally represent a set of algorithms to automatically balance multi-articulated ob- jects with tree topologies. Given the geometric congurations and masses at the leaf nodes of target multi-articulated objects, our algorithms achieve their balanced state through adjust- ing the mass of each node. To minimize the mass changes from the initial conguration, we use constraints of minimizing the norms of the mass dierences between the initial masses and the nal balanced masses. Actually, we use three dierent metrics, l1, l2 and l1 norms. These norms show slightly dierent behaviors in the minimization process, and users can select one of them according to their preferences and application purposes. We show all the details of algorithms, their time complexity analyses, and experimental results. keywords: balancing, tree-topology, minimization

목차

Abstract
 1. Introduction
 2. Problem Denition
 3. Balancing Algorithms
  3.1 Variable Substitution
  3.2 Minimization of l1-norm
  3.3 Minimization of l2-norm
  3.4 Minimization of l∞-norm
 4. Experimental Results
 5. Conclusion
 Acknowledgements
 References

키워드

저자

• Nakhoon Baek [ Kyungpook Nat'l Univ. ]
• Kwan-Hee Yoo [ Chungbuk Nat'l Univ ]

참고문헌

발행기관

간행물

표지보기 관심저널 등록

• 간행물명

  International Journal of Multimedia and Ubiquitous Engineering

• 간기

  월간

• pISSN

  1975-0080

• 수록기간

  2008~2016

• 등재여부

  SCOPUS

• 십진분류

  KDC 505 DDC 605