Abstract
In many fields 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 finally represent a set of algorithms to automatically balance multi-articulated objects with tree topologies. Given the geometric configurations and masses at the leaf nodes of target multi-articulated objects, our algorithms achieve their balanced state through adjusting the mass of each node. To minimize the mass changes from the initial configuration, we use constraints of minimizing the norms of the mass differences between the initial masses and the final balanced masses. Actually, we use three different metrics, l 1, l 2 and l ∞ norms. These norms show slightly different 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.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Bayer, R.: Symmetric binary B-trees: Data structure and maintenance algorithms. Acta Inf. 1, 290–306 (1972)
Bayer, R., McCreight, E.: Organization and maintenance of large ordered indexes, pp. 245–262. Springer-Verlag New York, Inc. (2002)
Gonzalez-Ochoa, C., McCammon, S., Peters, J.: Computing moments of objects enclosed by piecewise polynomial surfaces. ACM Trans. Graph. 17(3), 143–157 (1998)
Kim, J., Kim, S., Ko, H., Terzopoulos, D.: Fast GPU computation of the mass properties of a general shape and its application to buoyancy simulation. Vis. Comput. 22(9), 856–864 (2006)
Lee, D., et al.: Reproducing works of calder. J. of Visualization and Computer Animation 12(2), 81–91 (2001)
Lee, Y.T., Requicha, A.: Algorithms for computing the volume and other integral properties of solids. I. known methods and open issues. Commun. ACM 25(9), 635–641 (1982)
Lee, Y.T., Requicha, A.: Algorithms for computing the volume and other integral properties of solids. II. A family of algorithms based on representation conversion and cellular approximation. Commun. ACM 25(9), 642–650 (1982)
Lien, S.L., Kajiya, J.T.: A symbolic method for calculating the integral properties of arbitrary nonconvex polyhedra. IEEE Computer Graphics and Applications 4, 35–41 (1984)
Mirtich, B.: Fast and accurate computation of polyhedral mass properties. J. Graph. Tools 1(2), 31–50 (1996)
Narayanaswami, C., Franklin, W.: Determination of mass properties of polygonal CSG objects in parallel. In: SMA 1991: Proc. the First ACM Symp. on Solid Modeling Foundations and CAD/CAM Applications, pp. 279–288 (1991)
Sleator, D., Tarjan, R.: A data structure for dynamic trees. J. Comput. Syst. Sci. 26(3), 362–391 (1983)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Baek, N., Yoo, KH. (2011). Physically Balancing Multi-articulated Objects. In: Kim, Th., et al. Multimedia, Computer Graphics and Broadcasting. MulGraB 2011. Communications in Computer and Information Science, vol 262. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-27204-2_22
Download citation
DOI: https://doi.org/10.1007/978-3-642-27204-2_22
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-27203-5
Online ISBN: 978-3-642-27204-2
eBook Packages: Computer ScienceComputer Science (R0)