Efficient simulation of inextensible cloth

Goldenthal, Rony; Harmon, David; Fattal, Raanan; Bercovier, Michel; Grinspun, Eitan

doi:10.1145/1239451.1239500

Cited by 51 publications

(73 citation statements)

References 21 publications

(32 reference statements)

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Most existing methods for this kind of simulations are physically based (cf., [26], [27], [28], [29], [30], [31], and [32]), which usually require extremely long computing time and in most cases are not capable of maintaining developability on the cloth since the cloth is always assumed to be elastic (extensible). In their recent impressive work [33], Goldenthal et al improved it by forbidding the extensibility in two mutually orthogonal directions, warp and weft, on the cloth; nevertheless, the developability is neither explicitly addressed nor analyzed in [33]. As an alternative, our algorithm offers a pure geometric solution to this task.…”

Section: Resultsmentioning

confidence: 99%

Quasi-Developable Mesh Surface Interpolation via Mesh Deformation

Tang

Chen

2009

IEEE Trans. Visual. Comput. Graphics

View full text Add to dashboard Cite

Abstract-We present a new algorithm for finding a most "developable" smooth mesh surface to interpolate a given set of arbitrary points or space curves. Inspired by the recent progress in mesh editing that employs the concepts of preserving the Laplacian coordinates and handle-based shape editing, we formulate the interpolation problem as a mesh deformation process that transforms an initial developable mesh surface, such as a planar figure, to a final mesh surface that interpolates the given points and/or curves. During the deformation, the developability of the intermediate mesh is maintained by means of preserving the zero-valued Gaussian curvature on the mesh. To treat the high nonlinearity of the geometric constrains owing to the preservation of Gaussian curvature, we linearize those nonlinear constraints using Taylor expansion and eventually construct a sparse and overdetermined linear system that is subsequently solved by a robust least squares solution. By iteratively performing this procedure, the initial mesh is gradually and smoothly "dragged" to the given points and/or curves. The initial experimental tests have shown some promising aspects of the proposed algorithm as a general quasi-developable surface interpolation tool.

show abstract

Section: Resultsmentioning

confidence: 99%

Quasi-Developable Mesh Surface Interpolation via Mesh Deformation

Tang

Chen

2009

IEEE Trans. Visual. Comput. Graphics

View full text Add to dashboard Cite

show abstract

“…Due to its robustness, speed, and simplicity, PBD has become very popular in the game and visual effects industries. The spring projection concept of PBD is also found in the Nucleus system [Stam 2009] and is also closely related to strain limiting [Provot 1995;Goldenthal et al 2007;Thomaszewski et al 2009;Wang et al 2010;Narain et al 2012]. PBD presents certain trade-offs by departing from the traditional elasticity models and relying on heuristic constraint projection, which utilizes parameters incompatible with standard models.…”

Section: Related Workmentioning

confidence: 99%

Fast simulation of mass-spring systems

et al. 2013

View full text Add to dashboard Cite

We describe a scheme for time integration of mass-spring systems that makes use of a solver based on block coordinate descent. This scheme provides a fast solution for classical linear (Hookean) springs. We express the widely used implicit Euler method as an energy minimization problem and introduce spring directions as auxiliary unknown variables. The system is globally linear in the node positions, and the non-linear terms involving the directions are strictly local. Because the global linear system does not depend on run-time state, the matrix can be pre-factored, allowing for very fast iterations. Our method converges to the same final result as would be obtained by solving the standard form of implicit Euler using Newton's method. Although the asymptotic convergence of Newton's method is faster than ours, the initial ratio of work to error reduction with our method is much faster than Newton's. For real-time visual applications, where speed and stability are more important than precision, we obtain visually acceptable results at a total cost per timestep that is only a fraction of that required for a single Newton iteration. When higher accuracy is required, our algorithm can be used to compute a good starting point for subsequent Newton's iteration. AbstractWe describe a scheme for time integration of mass-spring systems that makes use of a solver based on block coordinate descent. This scheme provides a fast solution for classical linear (Hookean) springs. We express the widely used implicit Euler method as an energy minimization problem and introduce spring directions as auxiliary unknown variables. The system is globally linear in the node positions, and the non-linear terms involving the directions are strictly local. Because the global linear system does not depend on run-time state, the matrix can be pre-factored, allowing for very fast iterations. Our method converges to the same final result as would be obtained by solving the standard form of implicit Euler using Newton's method. Although the asymptotic convergence of Newton's method is faster than ours, the initial ratio of work to error reduction with our method is much faster than Newton's. For real-time visual applications, where speed and stability are more important than precision, we obtain visually acceptable results at a total cost per timestep that is only a fraction of that required for a single Newton iteration. When higher accuracy is required, our algorithm can be used to compute a good starting point for subsequent Newton's iteration.

show abstract

“…A fully inextensible material can be modeled through strain limiting [Provot 1995;Goldenthal et al 2007;Thomaszewski et al 2009;Wang et al 2010] or the use of nonconforming elements [English and Bridson 2008], but dealing with materials that have high but finite in-plane stiffness is not addressed in these previous methods. In our work, we do not modify the finite element model, and instead avoid locking through the use of an adaptive mesh that conforms to the deformation of the material.…”

Section: Related Workmentioning

confidence: 99%

Folding and crumpling adaptive sheets

2013

View full text Add to dashboard Cite

Figure 1: Crumpling a sheet of paper is a challenging process to simulate as it produces geometry with both sharp creases and smooth areas. We efficiently resolve the emerging detail in the material through adaptive remeshing. AbstractWe present a technique for simulating plastic deformation in sheets of thin materials, such as crumpled paper, dented metal, and wrinkled cloth. Our simulation uses a framework of adaptive mesh refinement to dynamically align mesh edges with folds and creases. This framework allows efficient modeling of sharp features and avoids bend locking that would be otherwise caused by stiff in-plane behavior. By using an explicit plastic embedding space we prevent remeshing from causing shape diffusion. We include several examples demonstrating that the resulting method realistically simulates the behavior of thin sheets as they fold and crumple.

show abstract

Efficient simulation of inextensible cloth

Cited by 51 publications

References 21 publications

Quasi-Developable Mesh Surface Interpolation via Mesh Deformation

Quasi-Developable Mesh Surface Interpolation via Mesh Deformation

Fast simulation of mass-spring systems

Folding and crumpling adaptive sheets

Contact Info

Product

Resources

About