The DOI matches its Crossref record.
A virtual node algorithm for changing mesh topology during simulation
Abstract
We propose a virtual node algorithm that allows material to separate along arbitrary (possibly branched) piecewise linear paths through a mesh. The material within an element is fragmented by creating several replicas of the element and assigning a portion of real material to each replica. This results in elements that contain both real material and empty regions. The missing material is contained in another copy (or copies) of this element. Our new virtual node algorithm automatically determines the number of replicas and the assignment of material to each. Moreover, it provides the degrees of freedom required to simulate the partially or fully fragmented material in a fashion consistent with the embedded geometry. This approach enables efficient simulation of complex geometry with a simple mesh, i.e. the geometry need not align itself with element boundaries. It also alleviates many shortcomings of traditional Lagrangian simulation techniques for meshes with changing topology. For example, slivers do not require small CFL time step restrictions since they are embedded in well shaped larger elements. To enable robust simulation of embedded geometry, we propose new algorithms for handling rigid body and self collisions. In addition, we present several mechanisms for influencing and controlling fracture with grain boundaries, prescoring, etc. We illustrate our method for both volumetric and thin-shell simulations.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cited by
Physically Based Deformable Models in Computer Graphics
Nealen, A., Müller, M., Keiser, R., Boxerman, E., & Carlson, M. (2006) · Computer Graphics Forum · doi:10.1111/j.1467-8659.2006.01000.x · Cited by 759
Invertible finite elements for robust simulation of large deformation
Irving, G., Teran, J., & Fedkiw, R. (2004) · Proceedings of the 2004 ACM SIGGRAPH/Eurographics symposium on Computer animation - SCA '04 · doi:10.1145/1028523.1028541 · Cited by 350
Self-citationHu, Y., Fang, Y., Ge, Z., Qu, Z., Zhu, Y., Pradhana, A., & Jiang, C. (2018) · ACM Transactions on Graphics · doi:10.1145/3197517.3201293 · Cited by 274
DiSECt: A Differentiable Simulation Engine for Autonomous Robotic Cutting
Heiden, E., Macklin, M., Narang, Y., Fox, D., Garg, A., & Ramos, F. (2021) · Robotics: Science and Systems XVII · doi:10.15607/rss.2021.xvii.067 · Cited by 66
Metadata
- Authors
- Molino, N., Bao, Z., & Fedkiw, R.
- Venue
- ACM Transactions on Graphics
- Published
- 2004-08
- Volume
- 23
- Issue
- 3
- Pages
- 385-392
- ISSN
- 0730-0301 (ISSN-L)
- 1557-7368
- OpenAlex
- W2121542165
- Cited by
- 221
- References
- 0
- FWCI
- 20.00
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: A virtual node algorithm for changing mesh topology during simulation. https://app.cochat.ai/papers/10.1145/1015706.1015734
- The paper
- Molino, N., Bao, Z., & Fedkiw, R. (2004). A virtual node algorithm for changing mesh topology during simulation. ACM Transactions on Graphics. https://doi.org/10.1145/1015706.1015734
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.