2020
DOI: 10.1145/3384539
|View full text |Cite
|
Sign up to set email alerts
|

A Time-independent Deformer for Elastic-rigid Contacts

Abstract: We introduce a new tool that assists artists in deforming an elastic object when it comes in intersection with a rigid one. As opposed to methods that rely on time-resolved simulations, our approach is entirely based on time-independent geometric operators. It thus restarts from scratch at every frame from a pair of objects in intersection and works in two stages: the intersected regions are first matched and a contact region is identified on the rigid object; the elastic object is then deformed to match the c… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
18
0

Year Published

2021
2021
2022
2022

Publication Types

Select...
3

Relationship

2
1

Authors

Journals

citations
Cited by 3 publications
(18 citation statements)
references
References 29 publications
0
18
0
Order By: Relevance
“…For the sake of simplicity, we will start in this overview with a pair of distinct objects (e.g., the blue plane and green sphere in Figure 2). In this case, our method follows the general pipeline introduced by Brunel et al [2020] for elastic-rigid contacts, but we entirely revisit the contact surface computation (Section 4), as well as the computation of the displacement direction (Section 5.2).…”
Section: Methods Overviewmentioning
confidence: 99%
See 4 more Smart Citations
“…For the sake of simplicity, we will start in this overview with a pair of distinct objects (e.g., the blue plane and green sphere in Figure 2). In this case, our method follows the general pipeline introduced by Brunel et al [2020] for elastic-rigid contacts, but we entirely revisit the contact surface computation (Section 4), as well as the computation of the displacement direction (Section 5.2).…”
Section: Methods Overviewmentioning
confidence: 99%
“…To this end, d p q each object is projected onto the other by matching every vertex with the most distant point on the opposite mesh, when it exists, along the associated mapping direction (inset figure). Note that these points (e.g., p in the inset) do not necessarily belong to the intersection zones; unlike [Brunel et al 2020], our mapping regions M 𝑙 can thus be larger than I 𝑙 . The simplest approach to compute this matching consists in casting a ray along d (resp.…”
Section: Mapping Computationmentioning
confidence: 96%
See 3 more Smart Citations