Addressing concave boundaries in two-dimensional pointwise contact detection under the common-normal concept

IF 6.9 1区 工程技术 Q1 ENGINEERING, MULTIDISCIPLINARY
Lucas da Silva, Marina Vendl Craveiro, Alfredo Gay Neto
{"title":"Addressing concave boundaries in two-dimensional pointwise contact detection under the common-normal concept","authors":"Lucas da Silva,&nbsp;Marina Vendl Craveiro,&nbsp;Alfredo Gay Neto","doi":"10.1016/j.cma.2025.117865","DOIUrl":null,"url":null,"abstract":"<div><div>Contact search, the step where pairs of interacting points are identified, is crucial in computer methods for contact mechanics. This work explores the properties of contact pairs in a specific approach known as master-master method, combined with a hybrid-barrier enforcement method. The scope is on two-dimensional non-conformal contact, modeled as pointwise. Line-to-line and other instances of flat contact, for which a distribution of pressure over a region of finite size better represents their physics, are avoided. The main goal is to overcome the non-uniqueness of solutions when considering concave geometries. The bodies are defined by parameterized plane curves composed of strictly convex segments that represent either convex or concave boundaries. In the master-master approach, contact pairs are characterized by the common normal concept. Within this framework, contact pairs are classified into four types: convex-convex, matchable convex-concave, non-matchable convex-concave, and concave-concave. The Hessian of the squared distance function is analyzed for each type to further characterize them. Characterization using the Hessian matrix reveals that convex-convex and matchable convex-concave pairs are local minimizers of the squared distance function, while the other two types are either saddle points or maximizers. This enables a demonstration of the uniqueness of solutions for convex bodies. In the convex-concave case, projecting the concave boundary onto the convex one results in a univariate restricted objective function that distinguishes matchable pairs as minimizers and non-matchable pairs as maximizers. This function is used to propose a robust search algorithm that includes subdividing the domain into intervals with at most one minimizer, enabling the practical use of iterative minimization techniques to find all desired contact solutions. An algorithm for contact search that accommodates concave geometries is especially valuable in multibody applications.</div></div>","PeriodicalId":55222,"journal":{"name":"Computer Methods in Applied Mechanics and Engineering","volume":"438 ","pages":"Article 117865"},"PeriodicalIF":6.9000,"publicationDate":"2025-03-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Computer Methods in Applied Mechanics and Engineering","FirstCategoryId":"5","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0045782525001379","RegionNum":1,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"ENGINEERING, MULTIDISCIPLINARY","Score":null,"Total":0}
引用次数: 0

Abstract

Contact search, the step where pairs of interacting points are identified, is crucial in computer methods for contact mechanics. This work explores the properties of contact pairs in a specific approach known as master-master method, combined with a hybrid-barrier enforcement method. The scope is on two-dimensional non-conformal contact, modeled as pointwise. Line-to-line and other instances of flat contact, for which a distribution of pressure over a region of finite size better represents their physics, are avoided. The main goal is to overcome the non-uniqueness of solutions when considering concave geometries. The bodies are defined by parameterized plane curves composed of strictly convex segments that represent either convex or concave boundaries. In the master-master approach, contact pairs are characterized by the common normal concept. Within this framework, contact pairs are classified into four types: convex-convex, matchable convex-concave, non-matchable convex-concave, and concave-concave. The Hessian of the squared distance function is analyzed for each type to further characterize them. Characterization using the Hessian matrix reveals that convex-convex and matchable convex-concave pairs are local minimizers of the squared distance function, while the other two types are either saddle points or maximizers. This enables a demonstration of the uniqueness of solutions for convex bodies. In the convex-concave case, projecting the concave boundary onto the convex one results in a univariate restricted objective function that distinguishes matchable pairs as minimizers and non-matchable pairs as maximizers. This function is used to propose a robust search algorithm that includes subdividing the domain into intervals with at most one minimizer, enabling the practical use of iterative minimization techniques to find all desired contact solutions. An algorithm for contact search that accommodates concave geometries is especially valuable in multibody applications.
在共同法线概念下解决二维点接触检测中的凹面边界问题
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
CiteScore
12.70
自引率
15.30%
发文量
719
审稿时长
44 days
期刊介绍: Computer Methods in Applied Mechanics and Engineering stands as a cornerstone in the realm of computational science and engineering. With a history spanning over five decades, the journal has been a key platform for disseminating papers on advanced mathematical modeling and numerical solutions. Interdisciplinary in nature, these contributions encompass mechanics, mathematics, computer science, and various scientific disciplines. The journal welcomes a broad range of computational methods addressing the simulation, analysis, and design of complex physical problems, making it a vital resource for researchers in the field.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信