Part-Aware Distance Fields for Easy Inbetweening in Arbitrary Dimensions
- 448 Downloads
The motivation for this work is to explore a possible computer graphics application for a part aware distance field developed recently. Computing in-between shapes is chosen as a toy application. Rather than presenting a highly competitive scheme which continuously morphs one shape into another, our aim is to investigate whether in-betweens may be defined as ordinary averages once a proper shape representation (e.g. a part aware field) is established. The constructions are independent of the dimension of the space in which the shape is embedded as well as the number of shapes to be averaged.
KeywordsShape Boundary Symmetric Positive Definite Matrix Euclidean Distance Function Flat Mode Homogeneous Dirichlet Condition
I thank M. Genctav for providing a faster code for the ω-field computation. The work is funded by TUBITAK 112E208.
- 3.Cohen-Or, D., Levin, D., Solomovici, A.: Contour blending using warp-guided distance field interpolation. In: IEEE Visualization, San Francisco, pp. 165–172 (1996)Google Scholar
- 8.Pasko, A., Adzhiev, V.: Function-based shape modeling: mathematical framework and specialized language. In: Automated Deduction in Geometry, vol. 2930, pp. 132–160. Springer, Berlin/New York (2004)Google Scholar
- 10.Tari, S.: Hierarchical shape decomposition via level sets. In: ISMM, Groningen pp. 215–225 (2009)Google Scholar
- 11.Tari, S.: Fluctuating distance fields, parts, three-partite skeletons. In: Innovations for Shape Analysis, pp. 439–466. Springer, Berlin/New York (2013)Google Scholar
- 14.Tari, S., Burgeth, B., Tari, I.: Components of the shape revisited. In: Cognitive Shape Processing, American Association Artificial Intelligence Spring Symposium, Stanford (2010)Google Scholar