skip to main content
US FlagAn official website of the United States government
dot gov icon
Official websites use .gov
A .gov website belongs to an official government organization in the United States.
https lock icon
Secure .gov websites use HTTPS
A lock ( lock ) or https:// means you've safely connected to the .gov website. Share sensitive information only on official, secure websites.

Explore Research Products in the PAR
It may take a few hours for recently added research products to appear in PAR search results.


Title: Real-time Physically Guided Hair Interpolation
Strand-based hair simulations have recently become increasingly popular for a range of real-time applications. However, accurately simulating the full number of hair strands remains challenging. A commonly employed technique involves simulating a subset of guide hairs to capture the overall behavior of the hairstyle. Details are then enriched by interpolation using linear skinning. Hair interpolation enables fast real-time simulations but frequently leads to various artifacts during runtime. As the skinning weights are often pre-computed, substantial variations between the initial and deformed shapes of the hair can cause severe deviations in fine hair geometry. Straight hairs may become kinked, and curly hairs may become zigzags. This work introduces a novel physical-driven hair interpolation scheme that utilizes existing simulated guide hair data. Instead of directly operating on positions, we interpolate the internal forces from the guide hairs before efficiently reconstructing the rendered hairs based on their material model. We formulate our problem as a constraint satisfaction problem for which we present an efficient solution. Further practical considerations are addressed using regularization terms that regulate penetration avoidance and drift correction. We have tested various hairstyles to illustrate that our approach can generate visually plausible rendered hairs with only a few guide hairs and minimal computational overhead, amounting to only about 20% of conventional linear hair interpolation. This efficiency underscores the practical viability of our method for real-time applications.  more » « less
Award ID(s):
1956085
PAR ID:
10541589
Author(s) / Creator(s):
; ; ; ; ;
Publisher / Repository:
ACM
Date Published:
Journal Name:
ACM Transactions on Graphics
Volume:
43
Issue:
4
ISSN:
0730-0301
Page Range / eLocation ID:
1 to 11
Format(s):
Medium: X
Sponsoring Org:
National Science Foundation
More Like this
  1. ; (, ACM Transactions on Graphics)
    We proposequasi-harmonic weightsfor interpolating geometric data, which are orders of magnitude faster to compute than state-of-the-art. Currently, interpolation (or, skinning) weights are obtained by solving large-scale constrained optimization problems with explicit constraints to suppress oscillative patterns, yielding smooth weights only after a substantial amount of computation time. As an alternative, our weights are obtained as minima of an unconstrained problem that can be optimized quickly using straightforward numerical techniques. We consider weights that can be obtained as solutions to a parameterized family of second-order elliptic partial differential equations. By leveraging the maximum principle and careful parameterization, we pose weight computation as an inverse problem of recovering optimal anisotropic diffusivity tensors. In addition, we provide a customized ADAM solver that significantly reduces the number of gradient steps; our solver only requires inverting tens of linear systems that share the same sparsity pattern. Overall, our approach achieves orders of magnitude acceleration compared to previous methods, allowing weight computation in near real-time. 
    more » « less
  2. ; ; ; ; ; ; ; ; (, Journal of Experimental Botany)
    Abstract As with phenotyping of any microscopic appendages, such as cilia or antennae, phenotyping of root hairs has been a challenge due to their complex intersecting arrangements in two-dimensional images and the technical limitations of automated measurements. Digital Imaging of Root Traits at Microscale (DIRT/μ) is a newly developed algorithm that addresses this issue by computationally resolving intersections and extracting individual root hairs from two-dimensional microscopy images. This solution enables automatic and precise trait measurements of individual root hairs. DIRT/μ rigorously defines a set of rules to resolve intersecting root hairs and minimizes a newly designed cost function to combinatorically identify each root hair in the microscopy image. As a result, DIRT/μ accurately measures traits such as root hair length distribution and root hair density, which are impractical for manual assessment. We tested DIRT/μ on three datasets to validate its performance and showcase potential applications. By measuring root hair traits in a fraction of the time manual methods require, DIRT/μ eliminates subjective biases from manual measurements. Automating individual root hair extraction accelerates phenotyping and quantifies trait variability within and among plants, creating new possibilities to characterize root hair function and their underlying genetics. 
    more » « less
  3. ; ; ; ; ; (, ACM Transactions on Graphics)
    Butterflies are not only ubiquitous around the world but are also widely known for inspiring thrill resonance, with their elegant and peculiar flights. However, realistically modeling and simulating butterfly flights—in particular, for real-time graphics and animation applications—remains an under-explored problem. In this article, we propose an efficient and practical model to simulate butterfly flights. We first model a butterfly with parametric maneuvering functions, including wing-abdomen interaction. Then, we simulate dynamic maneuvering control of the butterfly through our force-based model, which includes both the aerodynamics force and the vortex force. Through many simulation experiments and comparisons, we demonstrate that our method can efficiently simulate realistic butterfly flight motions in various real-world settings. 
    more » « less
  4. ; ; ; (, The Anatomical Record)
    Abstract Bat wing membranes are composed of specialized skin that is covered with small sensory hairs which are likely mechanosensory and have been suggested to help bats sense airflow during flight. These sensory hairs have to date been studied in only a few of the more than 1,400 bat species around the world. Little is known about the diversity of the sensory hair network across the bat phylogeny. In this study, we use high‐resolution photomicrographs of preserved bat wings from 17 species in 12 families to characterize the distribution of sensory hairs along the wing and among species. We identify general patterns of sensory hair distribution across species, including the apparent relationships of sensory hairs to intramembranous wing muscles, the network of connective tissues in the wing membrane, and the bones of the forelimb. We also describe distinctive clustering of these sensory structures in some species. We also quantified sensory hair density in several regions of interest in the propatagium, plagiopatagium, and dactylopagatia, finding that sensory hair density was higher proximally than distally. This examination of the anatomical organization of the sensory hair network in a comparative context provides a framework for existing research on sensory hair function and highlights avenues for further research. 
    more » « less
  5. ; (, ACM Transactions on Graphics)
    We present a hard-real-time multi-resolution mesh shape deformation technique for skeleton-driven soft-body characters. Producing mesh deformations at multiple levels of detail is very important in many applications in computer graphics. Our work targets applications where the multi-resolution shapes must be generated at fast speeds (“hard-real-time”, e.g., a few milliseconds at most and preferably under 1 millisecond), as commonly needed in computer games, virtual reality and Metaverse applications. We assume that the character mesh is driven by a skeleton, and that high-quality character shapes are available in a set of training poses originating from a high-quality (slow) rig such as volumetric FEM simulation. Our method combines multi-resolution analysis, mesh partition of unity, and neural networks, to learn the pre-skinning shape deformations in an arbitrary character pose. Combined with linear blend skinning, this makes it possible to reconstruct the training shapes, as well as interpolate and extrapolate them. Crucially, we simultaneously achieve this at hard real-time rates and at multiple mesh resolution levels. Our technique makes it possible to trade deformation quality for memory and computation speed, to accommodate the strict requirements of modern real-time systems. Furthermore, we propose memory layout and code improvements to boost computation speeds. Previous methods for real-time approximations of quality shape deformations did not focus on hard real-time, or did not investigate the multi-resolution aspect of the problem. Compared to a "naive" approach of separately processing each hierarchical level of detail, our method offers a substantial memory reduction as well as computational speedups. It also makes it possible to construct the shape progressively level by level and interrupt the computation at any time, enabling graceful degradation of the deformation detail. We demonstrate our technique on several examples, including a stylized human character, human hands, and an inverse-kinematics-driven quadruped animal. 
    more » « less
  • Citation Formats
  • MLA
  • APA
  • Chicago
  • BibTeX
  • Save / Share this Record
  • Send to Email