[Oral Presentation]复杂域中任意凸多边形颗粒的高效生成

Organized By

Hohai University

Monash University

Co-organized by

Southeast University

Jiangxi University of Science and Technology

Northeast University

DUT-BSU Scientific Research and Innovation Center

Suzhou University of Science and Technology

State Key Laboratory of Structural Analysis, Optimization and CAE Software for Industrial Equipment

Sponsoring agency

KELI SDEM Software (Dalian) Co., Ltd.

Sugon Smart Computing Information Technology Co., Ltd.

Beijing Paratera Technology Co., Ltd.

Simpop Information Technology Co., Ltd.

Important Dates

Conference Announcement

December 2023, release First Round Announcement
Abstract Submission Deadline
March 31^th, 2024
Paper Submission Deadline
April 30^th, 2024
Registration
From January 1^st, 2024
Conference Schedule
May 31^st (Friday), 2024 On-Site Registration
June 1^st to 3^rd, 2024 Conference

复杂域中任意凸多边形颗粒的高效生成

ID：71 Submission ID：216 View Protection：ATTENDEE Updated Time：2024-04-09 22:36:08 Hits：459 Oral Presentation

Start Time：Pending （Asia/Shanghai）

Duration：Pending

Session：[No Session] » [No Session Block]

No files

Abstract

本文提出了一种基于Minkowski差的波前法（包括封闭、开放两种形式），可用于复杂域中任意凸多边形颗粒的高效生成。为确保外边界附近生成的凸颗粒与边界严格相切，提出了外边界附近凸颗粒的处理算法，消除了颗粒集合体的外边界空洞和非光滑性问题。针对新生成颗粒与前进面上已有颗粒的接触判断，比较了四种不同算法的效率，其中GJK算法效率最高，显式Minkowski差构造算法效率最低。发现了传统开放形式存在的单侧抬升问题，提出了相应的处理方法，进一步提高了计算效率和密实度。最后，通过含不同内/外域边界算例验证了提出方法的有效性与适用性。结果表明：所提方法具有非常高的计算效率和鲁棒性，在2.3GHz笔记本上分别生成100万矩形和八边形颗粒只需3.89秒和7.11秒，达到了0.72-0.80的高密实度。

Keywords

颗粒生成，任意凸多边形，波前法，闵可夫斯基差

Sponsored By

Hohai University

Panel of Computational Mechanics on Granular Materials, Working Party of Computational Mechanics, Chinese Society of Theoretical and Applied Mechanics

Jiangsu Society of Theoretical and Applied Mechanics