“Engineering Full-Fidelity Hair for Incredibles 2”

  • ©Andrew Butts, Ben Porter, Dirk Van Gelder, Mark Hessler, Venkateswaran Krishna, and Gary Monheit

Conference:


Type:


Entry Number: 14

Title:

    Engineering Full-Fidelity Hair for Incredibles 2

Presenter(s)/Author(s):



Abstract:


    For Incredibles 2, we achieved interactive full-fidelity procedurally-generated hair, yielding artist freedom and productivity surpassing our previous hair tools. We implemented highly parallel algorithms for hair growth and deformation and used fast, modern techniques for graph evaluation, subdivision surfaces, Poisson disk sampling, and scattered data interpolation. Working with full-fidelity hair presented a data scale challenge to our shot pipeline, but we overcame it by allowing a trade-off of control flexibility for speed, maintaining geometric complexity.

References:


    John Bowers, Rui Wang, Li-Yi Wei, and David Maletz. 2010. Parallel Poisson Disk Sampling with Spectrum Analysis on Surfaces. ACM Trans. Graph. 29, 6, Article 166 (Dec. 2010), 10 pages. hŠps://doi.org/10.1145/1882261.1866188
    Hayley Iben, Mark Meyer, Lena Petrovic, Olivier Soares, John Anderson, and Andrew Witkin. 2013. Artistic Simulation of Curly Hair. In Proceedings of the 12th ACM SIGGRAPH/Eurographics Symposium on Computer Animation (SCA ’13). ACM, New York, NY, USA, 63–71. hŠps://doi.org/10.1145/2485895.2485913
    Mike Seymour. 2015. Barbershop at Weta: Sci-tech winner explained. hŠps://www. fxguide.com/featured/barbershop-at-weta-sci-tech-winner-explained/. (2015). Ac cessed: 2018-05-14.
    Robin Sibson. 1981. A brief description of natural neighbour interpolation. Interpreting Multivariate Data (1981). Cem Yuksel. 2015. Sample Elimination for Generating Poisson Disk Sample Sets. Comput. Graph. Forum 34, 2 (May 2015), 25–32. hŠps://doi.org/10.1111/cgf.12538

Keyword(s):



Acknowledgements:


    The authors wish to thank Toby Jones and Frank Hanner at Disney Animation Studios for their contributions to our hair motion interpolation approach.


PDF:



ACM Digital Library Publication:



Overview Page: