Abstract
We present a system for efficiently dressing animated 3D models with feathers. While there have been several works on generating static feathers, few methods can incrementally adjust the feathers when the model is animated. Our system makes several important improvements to achieve the goal. We first propose a simple yet effective algorithm to sample the roots based on the orientation field, as the distribution of feather roots has a great impact on the final look. To enable reordering the roots during animation, we analyze and improve the definition of the growth priority. Finally, we propose a method to incrementally adjust minimal feathers to collision-free for each frame of animation. Our system is easy to implement, and the results show that it is efficient and robust.








Similar content being viewed by others
Explore related subjects
Discover the latest articles, news and stories from top researchers in related subjects.References
Alpern, B., Hoover, R., Rosen, B.K., Sweeney, P.F., Zadeck, F.K.: Incremental evaluation of computational circuits. In: Proceedings of the First Annual ACM-SIAM Symposium on Discrete Algorithms, SODA ’90, pp. 32–42 (1990)
Bangay, S.: Animated feather coats using field lines. In: Proceedings of the 5th International Conference on Computer Graphics, Virtual Reality, Visualisation and Interaction in Africa, AFRIGRAPH ’07, pp. 169–176 (2007)
Bowers, J., Wang, R., Wei, L.Y., Maletz, D.: Parallel Poisson disk sampling with spectrum analysis on surfaces. ACM Trans. Graph. 29(6), 166:1–166:10 (2010)
Chen, Y., Xu, Y., Guo, B., Shum, H.Y.: Modeling and rendering of realistic feathers. ACM Trans. Graph. 21(3), 630–636 (2002)
Franco, C.G., Walter, M.: Modeling the structure of feathers. In: SIBGRAPI, p. 381 (2001)
Hadap, S., Magnenat-Thalmann, N.: Modeling dynamic hair as a continuum. Comput. Graph. Forum 20(3), 329–338 (2001)
Jacobson, A., Panozzo, D., et al.: libigl: a simple C++ geometry processing library. http://libigl.github.io/libigl/ (2014)
Kaufman, D., Chan, J.: Stuart little 2: let the feathers fly. In: ACM SIGGRAPH 2002 Course Notes (2002)
Knöppel, F., Crane, K., Pinkall, U., Schröder, P.: Stripe patterns on surfaces. ACM Trans. Graph. 34, 39:1–39:11 (2015)
Liu, L., Li, X., Chen, Y., Liu, X., Zhang, J.J., Wu, E.: An efficient feathering system with collision control. Comput. Graph. Forum 34(7), 279–288 (2015)
Marchetti-Spaccamela, A., Nanni, U., Rohnert, H.: Maintaining a topological order under edge insertions. Inf. Process. Lett. 59(1), 53–58 (1996)
Pearce, D.J., Kelly, P.H.J.: A dynamic topological sort algorithm for directed acyclic graphs. J. Exp. Algorithmics 11(1.7), 1–24 (2007)
Peyrot, J.L., Payan, F., Antonini, M.: Feature-preserving direct blue noise sampling for surface meshes. Eurographics (Short Paper Session), Girona, Spain, pp 9–12 (2013)
Streit, L., Heidrich, W.: A biologically-parameterized feather model. Comput. Graph. Forum 21(3), 565–573 (2002)
Surazhsky, V., Surazhsky, T., Kirsanov, D., Gortler, S.J., Hoppe, H.: Fast exact and approximate geodesics on meshes. ACM Trans. Graph. 24(3), 553–560 (2005)
Weber, A.J., Gornowicz, G.: Collision-free construction of animated feathers using implicit constraint surfaces. ACM Trans. Graph. 28(2), 12:1–12:8 (2009)
Xin, S.Q., Wang, G.J.: Improving Chen and Han’s algorithm on the discrete geodesic problem. ACM Trans. Graph. 28(4), 104:1–104:8 (2009)
Xu, Y., Hu, R., Gotsman, C., Liu, L.: Blue noise sampling of surfaces. Comput. Graph. 36(4), 232–240 (2012)
Acknowledgements
We would like to thank the anonymous reviewers for their insightful comments and suggestions to improve the quality of the paper. This research is supported by NSFC (61632003, 61672502, 61572316), Macao FDCT Grants (068/2015/A2, 136/2014/A3) and Univ. of Macau Grant (MYRG2014-00139-FST).
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Liu, L., Liu, X., Sheng, B. et al. Incremental collision-free feathering for animated surfaces. Vis Comput 33, 883–890 (2017). https://doi.org/10.1007/s00371-017-1369-6
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00371-017-1369-6