2009
DOI: 10.1109/tvcg.2008.79
|View full text |Cite
|
Sign up to set email alerts
|

Robust High-Resolution Cloth Using Parallelism, History-Based Collisions, and Accurate Friction

Abstract: In this paper we simulate high resolution cloth consisting of up to 2 million triangles which allows us to achieve highly detailed folds and wrinkles. Since the level of detail is also influenced by object collision and self collision, we propose a more accurate model for cloth-object friction. We also propose a robust history-based repulsion/collision framework where repulsions are treated accurately and efficiently on a per time step basis. Distributed memory parallelism is used for both time evolution and c… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
4
1

Citation Types

1
81
0
1

Year Published

2010
2010
2023
2023

Publication Types

Select...
5
3
2

Relationship

0
10

Authors

Journals

citations
Cited by 103 publications
(83 citation statements)
references
References 39 publications
(64 reference statements)
1
81
0
1
Order By: Relevance
“…Bender and Bayer [2008] simulate inextensible cloth by decomposing it into strips of constraints that can be processed in parallel. Selle et al [2009] efficiently handle very high resolution cloth by parallelizing and extending Bridson's method [2002] to reduce the number of geometric tests needed during collision detection. Our method stands apart in offering ACM's three guarantees of safety, progress, and correctness.…”
Section: Related Workmentioning
confidence: 99%
“…Bender and Bayer [2008] simulate inextensible cloth by decomposing it into strips of constraints that can be processed in parallel. Selle et al [2009] efficiently handle very high resolution cloth by parallelizing and extending Bridson's method [2002] to reduce the number of geometric tests needed during collision detection. Our method stands apart in offering ACM's three guarantees of safety, progress, and correctness.…”
Section: Related Workmentioning
confidence: 99%
“…Another solution to the untangling problem is to handle the meshes before intersection. Such a history-based method was proposed by Selle et al [Selle et al 2009] to solve the force apply on the collision pairs, but this method need to reinitialize the memory of mesh state for every time step. Müller et al [Müller et al 2015] handled this problem by generating the space collision tetrahedron, and this method can robustly simulate the collision of large mesh in realtime with initializing once before the simulation.…”
Section: Related Workmentioning
confidence: 99%
“…Depth-first traversal of bounding volumes tree traversal (BVTT) [21] and parallel cloth simulation [20] are good instances of this kind of work. Few papers also presented multi-threading use on single processor (Lewis et al [16] propose a multithreaded algorithm to simulate planetary rings).…”
Section: Cpu-based Algorithmsmentioning
confidence: 99%