计算广义绕组数的一次性方法

Cedric Martens, Mikhail Bessmeltsev
{"title":"计算广义绕组数的一次性方法","authors":"Cedric Martens, Mikhail Bessmeltsev","doi":"arxiv-2408.04466","DOIUrl":null,"url":null,"abstract":"The generalized winding number is an essential part of the geometry\nprocessing toolkit, allowing to quantify how much a given point is inside a\nsurface, often represented by a mesh or a point cloud, even when the surface is\nopen, noisy, or non-manifold. Parameterized surfaces, which often contain\nintentional and unintentional gaps and imprecisions, would also benefit from a\ngeneralized winding number. Standard methods to compute it, however, rely on a\nsurface integral, challenging to compute without surface discretization,\nleading to loss of precision characteristic of parametric surfaces. We propose an alternative method to compute a generalized winding number,\nbased only on the surface boundary and the intersections of a single ray with\nthe surface. For parametric surfaces, we show that all the necessary operations\ncan be done via a Sum-of-Squares (SOS) formulation, thus computing generalized\nwinding numbers without surface discretization with machine precision. We show\nthat by discretizing only the boundary of the surface, this becomes an\nefficient method. We demonstrate an application of our method to the problem of computing a\ngeneralized winding number of a surface represented by a curve network, where\neach curve loop is surfaced via Laplace equation. We use the Boundary Element\nMethod to express the solution as a parametric surface, allowing us to apply\nour method without meshing the surfaces. As a bonus, we also demonstrate that\nfor meshes with many triangles and a simple boundary, our method is faster than\nthe hierarchical evaluation of the generalized winding number while still being\nprecise. We validate our algorithms theoretically, numerically, and by demonstrating a\ngallery of results \\new{on a variety of parametric surfaces and meshes}, as\nwell uses in a variety of applications, including voxelizations and boolean\noperations.","PeriodicalId":501174,"journal":{"name":"arXiv - CS - Graphics","volume":"14 1","pages":""},"PeriodicalIF":0.0000,"publicationDate":"2024-08-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"One-Shot Method for Computing Generalized Winding Numbers\",\"authors\":\"Cedric Martens, Mikhail Bessmeltsev\",\"doi\":\"arxiv-2408.04466\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The generalized winding number is an essential part of the geometry\\nprocessing toolkit, allowing to quantify how much a given point is inside a\\nsurface, often represented by a mesh or a point cloud, even when the surface is\\nopen, noisy, or non-manifold. Parameterized surfaces, which often contain\\nintentional and unintentional gaps and imprecisions, would also benefit from a\\ngeneralized winding number. Standard methods to compute it, however, rely on a\\nsurface integral, challenging to compute without surface discretization,\\nleading to loss of precision characteristic of parametric surfaces. We propose an alternative method to compute a generalized winding number,\\nbased only on the surface boundary and the intersections of a single ray with\\nthe surface. For parametric surfaces, we show that all the necessary operations\\ncan be done via a Sum-of-Squares (SOS) formulation, thus computing generalized\\nwinding numbers without surface discretization with machine precision. We show\\nthat by discretizing only the boundary of the surface, this becomes an\\nefficient method. We demonstrate an application of our method to the problem of computing a\\ngeneralized winding number of a surface represented by a curve network, where\\neach curve loop is surfaced via Laplace equation. We use the Boundary Element\\nMethod to express the solution as a parametric surface, allowing us to apply\\nour method without meshing the surfaces. As a bonus, we also demonstrate that\\nfor meshes with many triangles and a simple boundary, our method is faster than\\nthe hierarchical evaluation of the generalized winding number while still being\\nprecise. We validate our algorithms theoretically, numerically, and by demonstrating a\\ngallery of results \\\\new{on a variety of parametric surfaces and meshes}, as\\nwell uses in a variety of applications, including voxelizations and boolean\\noperations.\",\"PeriodicalId\":501174,\"journal\":{\"name\":\"arXiv - CS - Graphics\",\"volume\":\"14 1\",\"pages\":\"\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2024-08-08\",\"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-2408.04466\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"arXiv - CS - Graphics","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/arxiv-2408.04466","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

广义卷绕数是几何处理工具包的重要组成部分,它可以量化给定点在曲面(通常由网格或点云表示)内部的位置,即使曲面是开放的、嘈杂的或非曲面。参数化曲面通常包含有意或无意的间隙和不精确,因此也会受益于通用的卷绕数。然而,计算它的标准方法依赖于表面积分,在没有表面离散化的情况下计算具有挑战性,导致参数化表面特有的精度损失。我们提出了一种计算广义缠绕数的替代方法,它只基于曲面边界和单条射线与曲面的交点。对于参数曲面,我们证明所有必要的运算都可以通过求和公式(SOS)完成,因此无需曲面离散化就能计算出机器精度的广义绕组数。我们证明,只对曲面的边界进行离散化,这将成为一种高效的方法。我们演示了将我们的方法应用于计算由曲线网络表示的曲面的广义缠绕数问题,其中每个曲线环通过拉普拉斯方程进行曲面化。我们使用边界元法将解表达为参数曲面,这样就可以在不对曲面进行网格划分的情况下应用我们的方法。另外,我们还证明,对于具有许多三角形和简单边界的网格,我们的方法比广义卷绕数的分层评估更快,同时仍然精确。我们从理论和数值上验证了我们的算法,并在各种参数化曲面和网格上演示了一系列新结果,以及在各种应用中的使用,包括体素化和布尔运算。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
One-Shot Method for Computing Generalized Winding Numbers
The generalized winding number is an essential part of the geometry processing toolkit, allowing to quantify how much a given point is inside a surface, often represented by a mesh or a point cloud, even when the surface is open, noisy, or non-manifold. Parameterized surfaces, which often contain intentional and unintentional gaps and imprecisions, would also benefit from a generalized winding number. Standard methods to compute it, however, rely on a surface integral, challenging to compute without surface discretization, leading to loss of precision characteristic of parametric surfaces. We propose an alternative method to compute a generalized winding number, based only on the surface boundary and the intersections of a single ray with the surface. For parametric surfaces, we show that all the necessary operations can be done via a Sum-of-Squares (SOS) formulation, thus computing generalized winding numbers without surface discretization with machine precision. We show that by discretizing only the boundary of the surface, this becomes an efficient method. We demonstrate an application of our method to the problem of computing a generalized winding number of a surface represented by a curve network, where each curve loop is surfaced via Laplace equation. We use the Boundary Element Method to express the solution as a parametric surface, allowing us to apply our method without meshing the surfaces. As a bonus, we also demonstrate that for meshes with many triangles and a simple boundary, our method is faster than the hierarchical evaluation of the generalized winding number while still being precise. We validate our algorithms theoretically, numerically, and by demonstrating a gallery of results \new{on a variety of parametric surfaces and meshes}, as well uses in a variety of applications, including voxelizations and boolean operations.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
GaussianHeads: End-to-End Learning of Drivable Gaussian Head Avatars from Coarse-to-fine Representations A Missing Data Imputation GAN for Character Sprite Generation Visualizing Temporal Topic Embeddings with a Compass Playground v3: Improving Text-to-Image Alignment with Deep-Fusion Large Language Models Phys3DGS: Physically-based 3D Gaussian Splatting for Inverse Rendering
×
引用
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