WindPoly: Polygonal Mesh Reconstruction via Winding Numbers

Xin He, Chenlei Lv, Pengdi Huang, Hui Huang
{"title":"WindPoly: Polygonal Mesh Reconstruction via Winding Numbers","authors":"Xin He, Chenlei Lv, Pengdi Huang, Hui Huang","doi":"arxiv-2407.19208","DOIUrl":null,"url":null,"abstract":"Polygonal mesh reconstruction of a raw point cloud is a valuable topic in the\nfield of computer graphics and 3D vision. Especially to 3D architectural\nmodels, polygonal mesh provides concise expressions for fundamental geometric\nstructures while effectively reducing data volume. However, there are some\nlimitations of traditional reconstruction methods: normal vector dependency,\nnoisy points and defective parts sensitivity, and internal geometric structure\nlost, which reduce the practicality in real scene. In this paper, we propose a\nrobust and efficient polygonal mesh reconstruction method to address the issues\nin architectural point cloud reconstruction task. It is an iterative adaptation\nprocess to detect planar shapes from scattered points. The initial structural\npolygonal mesh can be established in the constructed convex polyhedral space\nwithout assistance of normal vectors. Then, we develop an efficient\npolygon-based winding number strategy to orient polygonal mesh with global\nconsistency. The significant advantage of our method is to provide a structural\nreconstruction for architectural point clouds and avoid point-based normal\nvector analysis. It effectively improves the robustness to noisy points and\ndefective parts. More geometric details can be preserved in the reconstructed\npolygonal mesh. Experimental results show that our method can reconstruct\nconcise, oriented and faithfully polygonal mesh that are better than results of\nstate-of-the-art methods. More results and details can be found on\nhttps://vcc.tech/research/2024/WindPoly","PeriodicalId":501174,"journal":{"name":"arXiv - CS - Graphics","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2024-07-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"arXiv - CS - Graphics","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/arxiv-2407.19208","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

Polygonal mesh reconstruction of a raw point cloud is a valuable topic in the field of computer graphics and 3D vision. Especially to 3D architectural models, polygonal mesh provides concise expressions for fundamental geometric structures while effectively reducing data volume. However, there are some limitations of traditional reconstruction methods: normal vector dependency, noisy points and defective parts sensitivity, and internal geometric structure lost, which reduce the practicality in real scene. In this paper, we propose a robust and efficient polygonal mesh reconstruction method to address the issues in architectural point cloud reconstruction task. It is an iterative adaptation process to detect planar shapes from scattered points. The initial structural polygonal mesh can be established in the constructed convex polyhedral space without assistance of normal vectors. Then, we develop an efficient polygon-based winding number strategy to orient polygonal mesh with global consistency. The significant advantage of our method is to provide a structural reconstruction for architectural point clouds and avoid point-based normal vector analysis. It effectively improves the robustness to noisy points and defective parts. More geometric details can be preserved in the reconstructed polygonal mesh. Experimental results show that our method can reconstruct concise, oriented and faithfully polygonal mesh that are better than results of state-of-the-art methods. More results and details can be found on https://vcc.tech/research/2024/WindPoly
WindPoly:通过缠绕数重建多边形网格
原始点云的多边形网格重建是计算机图形学和三维视觉领域的一个重要课题。特别是对于三维建筑模型而言,多边形网格能提供基本几何结构的简洁表达,同时有效减少数据量。然而,传统的重建方法存在一些局限性:法向量依赖性、噪声点和缺陷部分敏感性、内部几何结构丢失等,降低了在真实场景中的实用性。本文针对建筑点云重建任务中存在的问题,提出了一种稳健高效的多边形网格重建方法。这是一个从散点检测平面形状的迭代适应过程。初始结构多边形网格可以在构建的凸多面体空间中建立,无需法向量的辅助。然后,我们开发了一种高效的基于多边形的缠绕数策略,用于定向具有全局一致性的多边形网格。我们的方法的显著优势在于为建筑点云提供了结构重建,避免了基于点的法向量分析。它有效提高了对噪声点和缺陷部分的鲁棒性。重建的多边形网格可以保留更多几何细节。实验结果表明,我们的方法可以重建精确、定向和忠实的多边形网格,其效果优于最先进的方法。更多结果和详情请访问:https://vcc.tech/research/2024/WindPoly。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
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学术官方微信