On Dihedral Angle Sums of Prisms and Hexahedra

Sergey Korotov, Jon Eivind Vatne
{"title":"On Dihedral Angle Sums of Prisms and Hexahedra","authors":"Sergey Korotov, Jon Eivind Vatne","doi":"10.1142/s0218195923500036","DOIUrl":null,"url":null,"abstract":"Various angle characteristics are used (e.g. in finite element methods or computer graphics) when evaluating the quality of computational meshes which may consist, in the three-dimensional case, of tetrahedra, prisms, hexahedra and pyramids. Thus, it is of interest to derive (preferably tight) bounds for dihedral angle sums, i.e. sums of angles between faces, of such mesh elements. For tetrahedra this task was solved by Gaddum in 1952. For pyramids, this was resolved by Korotov, Lund and Vatne in 2022. In this paper, we compute tight bounds for the remaining two cases, hexahedra and prisms.","PeriodicalId":285210,"journal":{"name":"International Journal of Computational Geometry and Applications","volume":"107 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2023-11-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"International Journal of Computational Geometry and Applications","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1142/s0218195923500036","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

Various angle characteristics are used (e.g. in finite element methods or computer graphics) when evaluating the quality of computational meshes which may consist, in the three-dimensional case, of tetrahedra, prisms, hexahedra and pyramids. Thus, it is of interest to derive (preferably tight) bounds for dihedral angle sums, i.e. sums of angles between faces, of such mesh elements. For tetrahedra this task was solved by Gaddum in 1952. For pyramids, this was resolved by Korotov, Lund and Vatne in 2022. In this paper, we compute tight bounds for the remaining two cases, hexahedra and prisms.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
关于棱镜与六面体的二面角和
在评估计算网格的质量时,使用了各种角度特征(例如在有限元方法或计算机图形学中),在三维情况下,计算网格可能由四面体、棱镜、六面体和金字塔组成。因此,导出(最好是严格的)二面角和的边界是有意义的,即这种网格元素的面之间的角度和。对于四面体,这个问题在1952年由Gaddum解决了。对于金字塔,Korotov, Lund和Vatne在2022年解决了这个问题。在本文中,我们计算了剩下的两种情况,六面体和棱镜的紧界。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
On Dihedral Angle Sums of Prisms and Hexahedra Some Results on Semi-Symmetric Spaces Bottleneck Convex Subsets: Finding k Large Convex Sets in a Point Set Navigating Weighted Regions with Scattered Skinny Tetrahedra On the Most Likely Voronoi Diagram and Nearest Neighbor Searching
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1