Multi-Constraint Mesh Partitioning for Contact/Impact Computations
2003-05-05
Loading...
View/Download File
Persistent link to this item
Statistics
View StatisticsJournal Title
Journal ISSN
Volume Title
Title
Multi-Constraint Mesh Partitioning for Contact/Impact Computations
Alternative title
Authors
Published Date
2003-05-05
Publisher
Type
Report
Abstract
We present a novel approach for decomposing contact/impact computations in which the mesh elements come in contact with each other during the course of the simulation. Effective decomposition of these computations poses a numberof challenges as it needs to both balance the computations and minimize the amount of communication that is performed during the finite element and the contact search phase. Our approach achieves the first goal by partitioning the underlying mesh such that it simultaneously balancesboth the work that is performed during the finite element phase and that performed during contact search phase, while producing subdomains whose boundaries consist of piecewise axes-parallel lines or planes. The second goal is achieved by using a decision tree to decompose the space intorectangular or box-shaped regions that contain contact points from a single partition. Our experimental evaluation on a sequence of 100 meshes, shows that this new approach can significantly reduce the communication overhead over existing algorithms.
Keywords
Description
Related to
Replaces
License
Series/Report Number
Technical Report; 03-022
Funding information
Isbn identifier
Doi identifier
Previously Published Citation
Other identifiers
Suggested citation
Karypis, George. (2003). Multi-Constraint Mesh Partitioning for Contact/Impact Computations. Retrieved from the University Digital Conservancy, https://hdl.handle.net/11299/215565.
Content distributed via the University Digital Conservancy may be subject to additional license and use restrictions applied by the depositor. By using these files, users agree to the Terms of Use. Materials in the UDC may contain content that is disturbing and/or harmful. For more information, please see our statement on harmful content in digital repositories.