Structure simplification of planar quadrilateral meshes

Q4 Computer Science
Muhammad Naeem Akram, Kaoji Xu, Guoning Chen
{"title":"Structure simplification of planar quadrilateral meshes","authors":"Muhammad Naeem Akram, Kaoji Xu, Guoning Chen","doi":"10.2139/ssrn.4167992","DOIUrl":null,"url":null,"abstract":"In this paper, we present a structure simplification framework for planar all-quad meshes with open boundaries. Our simplification framework can handle quad meshes with complex structures (e.g., quad meshes obtained via Catmull-Clark subdivision of the triangle meshes) to produce simpler meshes while preserving the boundary features. To achieve that, we introduce a set of separatrix-based semi-global operations and combine them with existing local operations to develop a new simplification framework. Additionally, we organize and order the individual simplification operations into groups and employ ranking strategies for each group to sort these operations to produce quad meshes with better quality and simpler structure. We provide a comprehensive evaluation of our framework using different input parameters on a number of representative planar quad meshes with various boundary configurations. To demonstrate the advantages of our method, we compare it with a few existing frameworks. Our comparison shows that our simplification framework usually produces simpler structure with faster computation than the state-of-the-art methods. © 2023 Elsevier B.V. All rights reserved.","PeriodicalId":51003,"journal":{"name":"Computer Graphics World","volume":"95 1","pages":"1-14"},"PeriodicalIF":0.0000,"publicationDate":"2022-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Computer Graphics World","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.2139/ssrn.4167992","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"Computer Science","Score":null,"Total":0}
引用次数: 1

Abstract

In this paper, we present a structure simplification framework for planar all-quad meshes with open boundaries. Our simplification framework can handle quad meshes with complex structures (e.g., quad meshes obtained via Catmull-Clark subdivision of the triangle meshes) to produce simpler meshes while preserving the boundary features. To achieve that, we introduce a set of separatrix-based semi-global operations and combine them with existing local operations to develop a new simplification framework. Additionally, we organize and order the individual simplification operations into groups and employ ranking strategies for each group to sort these operations to produce quad meshes with better quality and simpler structure. We provide a comprehensive evaluation of our framework using different input parameters on a number of representative planar quad meshes with various boundary configurations. To demonstrate the advantages of our method, we compare it with a few existing frameworks. Our comparison shows that our simplification framework usually produces simpler structure with faster computation than the state-of-the-art methods. © 2023 Elsevier B.V. All rights reserved.
平面四边形网格的结构简化
本文提出了一种开放边界平面全四边形网格的结构简化框架。我们的简化框架可以处理具有复杂结构的四边形网格(例如,通过三角形网格的Catmull-Clark细分获得的四边形网格),在保留边界特征的同时生成更简单的网格。为了实现这一目标,我们引入了一组基于分离矩阵的半全局操作,并将它们与现有的局部操作结合起来,开发了一个新的简化框架。此外,我们将单个化简操作组织并排序成组,并对每组使用排序策略对这些操作进行排序,从而生成质量更好、结构更简单的四元网格。我们在许多具有不同边界配置的代表性平面四边形网格上使用不同的输入参数对我们的框架进行了全面的评估。为了证明我们的方法的优点,我们将其与一些现有框架进行了比较。我们的比较表明,我们的简化框架通常比最先进的方法产生更简单的结构和更快的计算速度。©2023 Elsevier B.V.版权所有
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
Computer Graphics World
Computer Graphics World 工程技术-计算机:软件工程
CiteScore
0.03
自引率
0.00%
发文量
0
审稿时长
>12 weeks
×
引用
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学术官方微信