Zobrazeno 1 - 8
of 8
pro vyhledávání: '"Hayley N. Iben"'
Publikováno v:
SIGGRAPH Talks
Hair simulation models are based on physics, but require additional controls to achieve certain looks or art directions. A common simulation control is to use hard or soft constraints on the kinematic points provided by the articulation of the scalp
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::4d4b67abf404f4c5fd85e37abcc1c39c
https://doi.org/10.1145/3306307.3328166
https://doi.org/10.1145/3306307.3328166
Publikováno v:
Geological Society London Special Publications, vol 459, iss 1
Geological Society, London, Special Publications, vol 459, iss 1
Geological Society, London, Special Publications, vol 459, iss 1
Author(s): Gillespie, P; Casini, G; Iben, H; O'Brien, JF | Abstract: Flow simulations of fractured and faulted reservoirs require representation of subseismic structures about which subsurface data are limited. We describe a method for simulating fra
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::3c176e71e28630cd24b8cbe3d7705b41
https://escholarship.org/uc/item/7js8t0xq
https://escholarship.org/uc/item/7js8t0xq
Autor:
Colin Doncaster, Rob Vogt, Sean Palmer, Gaelle Morand, Oba Ameziane-Hassani, Hayley N. Iben, Steve Marschner, Damon Crowe
Publikováno v:
SIGGRAPH Panels
Computer generated hair has historically been a challenging element in the feature film and visual effects industry. Technology and workflow challenges in authoring, animation, simulation, shading, lighting and rendering have motivated studios and so
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::7e5c295fd437498e331c48dbe31b6eb8
https://doi.org/10.1145/3084847.3084848
https://doi.org/10.1145/3084847.3084848
Publikováno v:
Symposium on Computer Animation
Artistic simulation of hair presents many challenges - ranging from incorporating artistic control to dealing with extreme motions of characters. Additionally, in a production environment, the simulation needs to be fast and results need to be usable
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::d8b02922f4b378d5cf81a37aba0a6e31
https://doi.org/10.1145/2485895.2485913
https://doi.org/10.1145/2485895.2485913
Publikováno v:
SIGGRAPH Talks
In Brave, Merida's hair is an important extension of her character. Like Merida, it is fierce, tempestuous, and unpredictable. We were tasked with the challenge of creating hair that possesses its own dramatic and expressive personality, but still ap
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::519f5c4b4daf46d8cf018176aed7cde0
https://doi.org/10.1145/2343045.2343076
https://doi.org/10.1145/2343045.2343076
Publikováno v:
Iben, Hayley N.; O’Brien, James F.; & Demaine, Erik D.(2009). Refolding Planar Polygons. Discrete & Computational Geometry, 41(3), pp 444-460. doi: 10.1007/s00454-009-9145-7. Retrieved from: http://www.escholarship.org/uc/item/2qr126wp
Symposium on Computational Geometry
Discrete and Computational Geometry, vol 41, iss 3
SIGGRAPH Sketches
Symposium on Computational Geometry
Discrete and Computational Geometry, vol 41, iss 3
SIGGRAPH Sketches
This paper describes an algorithm for generating a guaranteed intersection-free interpolation sequence between any pair of compatible polygons. Our algorithm builds on prior results from linkage unfolding, and if desired it can ensure that every edge
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::75da140fac742ed8b9fca6f6df7ee62b
http://www.escholarship.org/uc/item/2qr126wp
http://www.escholarship.org/uc/item/2qr126wp
Autor:
James F. O'Brien, Hayley N. Iben
Publikováno v:
Graphical Models, vol 71, iss 6
We present a method for generating surface crack patterns that appear in materials such as mud, ceramic glaze, and glass. To model these phenomena, we build upon existing physically based methods. Our algorithm generates cracks from a stress field de
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::0dd658a18cf348699193e2e1559ec284
https://escholarship.org/uc/item/6g1770qg
https://escholarship.org/uc/item/6g1770qg
Publikováno v:
Symposium on Computational Geometry
We present a new algorithm for unfolding planar polygonal linkages without self-intersection based on following the gradient flow of a "repulsive" energy function. This algorithm has several advantages over previous methods. (1) The output motion is
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::3bea3804e00ed5b0024a1ae76baac082
https://doi.org/10.1145/997817.997840
https://doi.org/10.1145/997817.997840