View-dependent adaptive cloth simulation

This paper describes a method for view-dependent cloth simulation using dynamically adaptive mesh refinement and coarsening. Given a prescribed camera motion, the method adjusts the criteria controlling refinement to account for visibility and apparent size in the camera's view. Objectionable dynamic artifacts are avoided by anticipative refinement and smoothed coarsening. This approach preserves the appearance of detailed cloth throughout the animation while avoiding the wasted effort of simulating details that would not be discernible to the viewer. The computational savings realized by this method increase as scene complexity grows, producing a 2× speed-up for a single character and more than 4× for a small group

Transforming Dress

In this paper, we produce a fashion show in which a dress is transformed over time, with a storyline of a robot that experiences some emotional changes after falling in love, sheds a symbolic teardrop and at the end becomes a lovely woman. This transformability, which cannot be done in a real fashion show, could open the potential for a new kind of creativity in the fashion industry

Parallelized Incomplete Poisson Preconditioner in Cloth Simulation

Efficient cloth simulation is an important problem for interactive applications that involve virtual humans, such as computer games. A common aspect of many methods that have been developed to simulate cloth is a linear system of equations, which is commonly solved using conjugate gradient or multi-grid approaches. In this paper, we introduce to the computer gaming community a recently proposed preconditioner, the incomplete Poisson preconditioner, for conjugate gradient solvers. We show that the parallelized incomplete Poisson preconditioner (PIPP) performs as well as the current state-of-the-art preconditioners, while being much more amenable to standard thread-level parallelism. We demonstrate our results on an 8-core Apple* Mac* Pro and a 32-core code name Emerald Ridge system

Efficient Clothing Fitting from Data.

A major drawback of shopping for clothes on-line is that the customer cannot try on clothes and see if they fit or suit them. One solution is to display clothing on an avatar, a 3D graphical model of the customer. However the normal technique for modeling clothing in computer graphics, cloth dynamics, suffers from being too processor intensive and is not practical for real time applications. Hence, retailers normally rely on a fixed set of body models to which clothes are pre-fitted. As the customer has to choose from this limited set the fit is typicallly not very representative of how the real clothes will fit. We propose a method that uses a compromise between these two methods. We generate a set of example avatars by performing Principal Component Analysis on a dataset of avatars. Clothes are pre-fitted to these examples off-line. Instead of asking the customer to choose from the set of examples we are able to represent the users avatar as a weighted sum of the examples, we then fit clothes as the same weighted sum over the clothes fitted to the examples

Fast Image-Based Model of Mitral Valve Closure for Surgical Planning

Surgical repair of the mitral valve results in better outcomes than valve replacement, yet diseased valves are often replaced due to the technical difficulty of the repair process. A surgical planning system based on patient-specific medical images that allows surgeons to simulate and compare potential repair strategies could greatly improve surgical outcomes. The system must simulate valve closure quickly and handle the complex boundary conditions imposed by the chords that tether the valve leaflets. We have developed a process for generating a triangulated mesh of the valve surface from volumetric image data of the opened valve. The closed position of the mesh is then computed using a mass-spring model of dynamics. In the mass-spring model, triangle sides are treated as linear springs supporting only tension. Chords are also treated as linear springs, and self-collisions are detected and handled inelastically. The equations of motion are solved using implicit numerical integration. The simulated closed state is compared with an image of the same valve taken in the closed state to assess accuracy of the model. The model exhibits rapid valve closure and is able to predict the closed state of the valve with reasonable accuracy.Engineering and Applied Science

대칭적인 의상의 시뮬레이션 가속을 위한 패턴 미러링 알고리즘

학위논문 (석사)-- 서울대학교 대학원 : 공과대학 전기·정보공학부, 2019. 2. 고형석.본 논문은 의상-바디 시뮬레이션의 속도 향상을 위한 패턴미러링 방법을 제시한다. 이 방법은 몸 매쉬와 옷의 패널이 위치한 Y-Z평면에 대해 대칭일 경우에 사용가능하다. 보통의 남성복이나 기성복과 같은 옷이 좌우가 대칭인 경우가 많다. 기존 시뮬레이션에서는 모든 옷의 정점들에 대해 conjugate gradient 방법을 이용해 시스템 행렬을 풀었다. 문제는 conjugate gradient 방법은 정점 수에 대해 지수적인 시간 복잡도를 가지므로, 고해상도를 위해 정점의 수가 증가할수록 시뮬레이션 시간이 지수적으로 증가한다는 것이다. Pattern Mirroring 방법을 이용하면 계산해야하는 시스템 방정식의 양이 반절로 줄어들기 때문에, 시뮬레이션에 필요한 시간도 줄어들거라고 기대할 수 있다. 결과적으로 패턴미러링 알고리즘을 이용하면 1.4배 (37%)의 속도 향상을 보였다. 1장 도입에서는 옷을 시뮬레이션하는 과정인 시스템 방정식을 푸는 방법, 충돌처리를 하는 방법에 대해 설명한다. iterative method인 conjugate gradient가 옷의 정점들의 속도를 결정하기 위해 사용되었다. 2장 관련 연구에서는 시뮬레이션 가속화를 위한 연구를 소개한다. 3장에서 pattern mirroring 알고리즘을 소개한다. 4장에서는 패턴 미러링 방법을 사용한다면 발생할 수 있는 문제가 몇가지 있는데, 이 문제를 해결하는 방법에 대해 설명한다. 5장에서는 패턴 미러링 방법을 기존의 시뮬레이션 방법과 비교해서 속도 향상을 도표로 제시하고, 결과 이미지를 비교한다.This paper describes the Pattern mirroring algorithm to reduce simulation time for cloth body simulation. This method is applicable for symmetric panel and symmetric body meshes centered on YZ plane: typically, man's suit and ready-make cloth is target of this method. As the ordinal simulation method, apply conjugate gradient method to every vertices on cloth mesh in order to solve system matrix. The problem is that the time for simulation is getting longer as the number of cloth vertices increases for high resolution. This is because the time complexity of conjugate gradient is exponential. Using pattern mirroring method, size of system matrix equation is half comparing ordinal method. So I can expect that the time for simulation reduces. The proposed method reduces simulation time up to 1.4 times (37%), by halving the matrix size of the linear equation. At chapter 1 introduction, describe the process of simulation, method of solving system equation and collision handling. An iterative method 'conjugate gradient method' is used to determine velocity of vertices of clothes. At chapter 2 relative work, explain about previous acceleration research for cloth simulation. At chapter 3, explain Pattern mirroring algorithm. But some problems could occur when using this method. At chapter 4, suggest solutions to handle these artifact as post-process step. At chapter 5, represent table to comparing the average time to simulate cloth in ordinal method and pattern mirroring method. Also represent image to difference of two result. Finally at chapter 6, describe conclusion and limitation of Pattern mirroring algorithm.Abstract Contents List of Figures List of Tables 1 Introduction 1.1 Time integration method 1.2 System matrix 1.3 Conjugate gradient method 1.4 Collision handling method 1.5 Overview of Pattern mirroring algorithm 2 Previous Work 3 Pattern Mirroring Method 3.1 1st step: Set Constraint Plane and Halving Mesh 3.2 2nd step: Simulation for Half Pane 3.3 3rd step: Mirroring Half Mesh 4 Artifacts Handling 4.1 Project crossed vertices at halving step 4.2 Penetration between original and mirrored mesh 5 Experiment Result 5.1 T-shirt 5.2 Jacket 6 Conclusion Bibliography 초록 감사의글Maste

Fast Simulation of Mass-Spring Systems

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

Automatic modeling of virtual humans and body clothing

Highly realistic virtual human models are rapidly becoming commonplace in computer graphics. These models, often represented by complex shape and requiring labor-intensive process, challenge the problem of automatic modeling. The problem and solutions to automatic modeling of animatable virtual humans are studied. Methods for capturing the shape of real people, parameterization techniques for modeling static shape (the variety of human body shapes) and dynamic shape (how the body shape changes as it moves) of virtual humans are classified, summarized and compared. Finally, methods for clothed virtual humans are reviewe