通过宽度优先遍历进行网格分析

ACM SE '10 Pub Date : 2010-04-15 DOI:10.1145/1900008.1900102
David O'Gwynn, J. Johnstone
{"title":"通过宽度优先遍历进行网格分析","authors":"David O'Gwynn, J. Johnstone","doi":"10.1145/1900008.1900102","DOIUrl":null,"url":null,"abstract":"This paper describes a novel tool for analysis of polygonal surface meshes, based on a modified breadth-first traversal of mesh vertices. The value of this technique lies in the fact that it relies only on mesh connectivity, making it invariant to model pose and transformation. It does this by leveraging the close relationship between geometry and connectivity in polygonal meshes. A breadth-first traversal of the mesh is used to construct a simplified graph representation of the mesh, where each vertex in the new graph is associated with some subset of vertices in the original mesh. This graph provides valuable information about the nature of the mesh's shape. This paper discusses the modified breadth-first traversal, the construction of the new graph and some ways in which this graph can be used for shape analysis on the original mesh.","PeriodicalId":333104,"journal":{"name":"ACM SE '10","volume":"46 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2010-04-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Mesh analysis via breadth-first traversal\",\"authors\":\"David O'Gwynn, J. Johnstone\",\"doi\":\"10.1145/1900008.1900102\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This paper describes a novel tool for analysis of polygonal surface meshes, based on a modified breadth-first traversal of mesh vertices. The value of this technique lies in the fact that it relies only on mesh connectivity, making it invariant to model pose and transformation. It does this by leveraging the close relationship between geometry and connectivity in polygonal meshes. A breadth-first traversal of the mesh is used to construct a simplified graph representation of the mesh, where each vertex in the new graph is associated with some subset of vertices in the original mesh. This graph provides valuable information about the nature of the mesh's shape. This paper discusses the modified breadth-first traversal, the construction of the new graph and some ways in which this graph can be used for shape analysis on the original mesh.\",\"PeriodicalId\":333104,\"journal\":{\"name\":\"ACM SE '10\",\"volume\":\"46 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2010-04-15\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"ACM SE '10\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1145/1900008.1900102\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"ACM SE '10","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/1900008.1900102","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

本文描述了一种基于改进的网格顶点宽度优先遍历的多边形曲面网格分析新工具。这种技术的价值在于它只依赖于网格连接,使其不受模型姿态和变换的影响。它通过利用多边形网格中几何和连通性之间的密切关系来实现这一点。网格的宽度优先遍历用于构建网格的简化图表示,其中新图中的每个顶点与原始网格中顶点的某个子集相关联。这张图提供了关于网格形状性质的有价值的信息。本文讨论了改进的宽度优先遍历法、新图的构造以及利用新图对原网格进行形状分析的几种方法。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Mesh analysis via breadth-first traversal
This paper describes a novel tool for analysis of polygonal surface meshes, based on a modified breadth-first traversal of mesh vertices. The value of this technique lies in the fact that it relies only on mesh connectivity, making it invariant to model pose and transformation. It does this by leveraging the close relationship between geometry and connectivity in polygonal meshes. A breadth-first traversal of the mesh is used to construct a simplified graph representation of the mesh, where each vertex in the new graph is associated with some subset of vertices in the original mesh. This graph provides valuable information about the nature of the mesh's shape. This paper discusses the modified breadth-first traversal, the construction of the new graph and some ways in which this graph can be used for shape analysis on the original mesh.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Teaching software engineering using open source software Dynamic ontology version control Visualization of the CreSIS Greenland data sets Java nano patterns: a set of reusable objects Towards power efficient consolidation and distribution of virtual machines
×
引用
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