Show simple item record

dc.contributor.authorLiu, Yinchuen_US
dc.contributor.authorAndrews, Sheldonen_US
dc.contributor.editorPelechano, Nuriaen_US
dc.contributor.editorVanderhaeghe, Daviden_US
dc.date.accessioned2022-04-22T08:16:18Z
dc.date.available2022-04-22T08:16:18Z
dc.date.issued2022
dc.identifier.isbn978-3-03868-169-4
dc.identifier.issn1017-4656
dc.identifier.urihttps://doi.org/10.2312/egs.20221036
dc.identifier.urihttps://diglib.eg.org:443/handle/10.2312/egs20221036
dc.description.abstractWe propose several graph partitioning algorithms for improving the performance of rigid body simulations. The algorithms operate on the graph formed by rigid bodies (nodes) and constraints (edges), producing non-overlapping and contiguous sub-systems that can be simulated in parallel by a domain decomposition technique. We demonstrate that certain partitioning algorithms reduce the computational time of the solver, and graph refinement techniques that reduce coupling between sub-systems, such as the Kernighan-Lin and Fiduccia-Mattheyses algorithms, give additional performance improvements.en_US
dc.publisherThe Eurographics Associationen_US
dc.rightsAttribution 4.0 International License
dc.rights.urihttps://creativecommons.org/licenses/by/4.0/
dc.subjectCCS Concepts: Computing methodologies --> Physical simulation; Mathematics of computing --> Graph algorithms
dc.subjectComputing methodologies
dc.subjectPhysical simulation
dc.subjectMathematics of computing
dc.subjectGraph algorithms
dc.titleGraph Partitioning Algorithms for Rigid Body Simulationsen_US
dc.description.seriesinformationEurographics 2022 - Short Papers
dc.description.sectionheadersAnimation and Simulation
dc.identifier.doi10.2312/egs.20221036
dc.identifier.pages73-76
dc.identifier.pages4 pages


Files in this item

Thumbnail
Thumbnail

This item appears in the following Collection(s)

Show simple item record

Attribution 4.0 International License
Except where otherwise noted, this item's license is described as Attribution 4.0 International License