修复由不同类型元素组成的八叉树边界过渡区域

Esteban Daines, C. Lobos
{"title":"修复由不同类型元素组成的八叉树边界过渡区域","authors":"Esteban Daines, C. Lobos","doi":"10.1109/SCCC.2018.8705233","DOIUrl":null,"url":null,"abstract":"Octree–based algorithms recursively divide the space in 8 or 27 hexahedra (octants). The number of times the split process is applied over an octant is the Refinement Level (RL). When a mesh presents octants of different RL, it is required to manage the transition between fine and coarse regions of the mesh. To do this, transition patterns are applied over octants with neighbors of different RL. When using the 27– split process this can be done only using hexahedra, however in the case of 8–split process this must be done using different types of elements (mixed–elements). The validity of the elements in the transition is ensured when the octant is a regular hexahedron. However, this may not be true when the octant is at the boundary of the domain, specially in concave regions. In this work we introduce a novel node projection technique in order to repair the boundary elements of transition regions in the mesh. Tests results show that, in general, invalid elements can be eliminated without impacting adjacent elements.","PeriodicalId":235495,"journal":{"name":"2018 37th International Conference of the Chilean Computer Science Society (SCCC)","volume":"26 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2018-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Repairing Octree Boundary Transition Regions Composed of Different Types of Elements\",\"authors\":\"Esteban Daines, C. Lobos\",\"doi\":\"10.1109/SCCC.2018.8705233\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Octree–based algorithms recursively divide the space in 8 or 27 hexahedra (octants). The number of times the split process is applied over an octant is the Refinement Level (RL). When a mesh presents octants of different RL, it is required to manage the transition between fine and coarse regions of the mesh. To do this, transition patterns are applied over octants with neighbors of different RL. When using the 27– split process this can be done only using hexahedra, however in the case of 8–split process this must be done using different types of elements (mixed–elements). The validity of the elements in the transition is ensured when the octant is a regular hexahedron. However, this may not be true when the octant is at the boundary of the domain, specially in concave regions. In this work we introduce a novel node projection technique in order to repair the boundary elements of transition regions in the mesh. Tests results show that, in general, invalid elements can be eliminated without impacting adjacent elements.\",\"PeriodicalId\":235495,\"journal\":{\"name\":\"2018 37th International Conference of the Chilean Computer Science Society (SCCC)\",\"volume\":\"26 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2018-11-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2018 37th International Conference of the Chilean Computer Science Society (SCCC)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/SCCC.2018.8705233\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2018 37th International Conference of the Chilean Computer Science Society (SCCC)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/SCCC.2018.8705233","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

基于八叉树的算法递归地将空间划分为8或27个六面体(八分体)。分割过程在一个八分区上应用的次数是细化级别(RL)。当网格呈现不同RL的八角时,需要管理网格的精细区域和粗糙区域之间的过渡。为此,将转换模式应用于具有不同RL邻居的八域。当使用27分裂过程时,这只能使用六面体来完成,但是在8分裂过程的情况下,这必须使用不同类型的元素(混合元素)来完成。当八象限是正六面体时,过渡中元素的有效性得到保证。然而,当八象限位于域的边界时,特别是在凹区域时,这可能不成立。本文提出了一种新的节点投影技术来修复网格中过渡区域的边界元素。试验结果表明,在一般情况下,可以在不影响相邻单元的情况下消除无效单元。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Repairing Octree Boundary Transition Regions Composed of Different Types of Elements
Octree–based algorithms recursively divide the space in 8 or 27 hexahedra (octants). The number of times the split process is applied over an octant is the Refinement Level (RL). When a mesh presents octants of different RL, it is required to manage the transition between fine and coarse regions of the mesh. To do this, transition patterns are applied over octants with neighbors of different RL. When using the 27– split process this can be done only using hexahedra, however in the case of 8–split process this must be done using different types of elements (mixed–elements). The validity of the elements in the transition is ensured when the octant is a regular hexahedron. However, this may not be true when the octant is at the boundary of the domain, specially in concave regions. In this work we introduce a novel node projection technique in order to repair the boundary elements of transition regions in the mesh. Tests results show that, in general, invalid elements can be eliminated without impacting adjacent elements.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
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学术官方微信