Part-Aware Distance Fields for Easy Inbetweening in Arbitrary Dimensions

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.
Citation Formats
Z. S. Tarı, “Part-Aware Distance Fields for Easy Inbetweening in Arbitrary Dimensions,” 2013, vol. 1, Accessed: 00, 2020. [Online]. Available: