Tanglement Resolution in Clothing Simulation With Explicit Convergence.

Area of Science:

• Computer Graphics
• Computational Physics
• Geometric Modeling

Background:

• Clothing simulation often encounters complex tanglements.
• Existing continuous collision handling (CCH) methods have limitations in resolving these issues.
• Round-off errors in CCH methods necessitate tolerance values, which can sometimes lead to false negatives.

Purpose of the Study:

• To propose a novel discrete collision handling (DCH) method for clothing simulation.
• To address the limitations of continuous collision handling (CCH) methods in resolving tanglements.
• To develop a DCH method that utilizes tolerance values for effective tanglemenet resolution.

Main Methods:

• Introduced a discrete collision handling (DCH) method based on continuous collision handling (CCH) principles.
• Implemented intersection analysis of the clothing mesh at each time step.
• Stored analysis results via vertex, edge, and triangle coloring.
• Developed triangle shrinkage and vertex pull operations for tanglemenet resolution.
• Re-evaluated the role of tolerance values, using them for resolution rather than just error prevention.

Main Results:

• The proposed DCH method effectively analyzes mesh intersections and identifies tanglemenet paths.
• Tanglemenets are resolved in an out-to-in manner using triangle shrinkage and vertex pull operations.
• The DCH method leverages tolerance values for the specific purpose of tanglemenet resolution.
• Under specific conditions, the method guarantees tanglemenet resolution within a finite number of time steps.

Conclusions:

• The new discrete collision handling (DCH) method offers an effective approach to resolving tanglemenets in clothing simulation.
• By repurposing tolerance values, the DCH method improves upon existing CCH techniques.
• The proposed method provides a robust and guaranteed solution for tanglemenet resolution in simulated clothing.