面向网格CSG的精确谓词、精确构造与组合数学
Exact predicates, exact constructions and combinatorics for mesh CSG
AI总结:
本文提出一种基于Weiler模型的精确网格求交与CSG算法,通过精确谓词、径向排序和约束Delaunay三角剖分处理复杂病态情形,并在thingi10K和新公开的thingiCSG数据集上验证了其布尔运算与网格修复能力。
摘要:
本文介绍了一种通用的网格求交算法,该算法精确计算所谓的Weiler模型(也称为arrangement),并利用该模型实现任意多操作数表达式的布尔运算、CSG(构造实体几何)以及一些网格修复操作。从输入的多边形汤开始,该算法首先计算共细化,并精确表示交点。然后,通过使用专门的精确谓词对非流形交边周围的面片进行排序(径向排序),构造三维空间到体积区域(Weiler模型)的分解。最后,根据输入的布尔表达式,对属于结果边界的三角形面片进行分类。为了实现所有涉及的谓词和构造,本文提出、测试并讨论了两种几何内核(算术展开和多精度浮点数)。作为指导原则,每一步之间共享的组合信息尽可能保持简单。这通过在几何内核中处理所有特殊情况而成为可能。特别地,带有交点的三角形使用(唯一定义的)约束Delaunay三角剖分进行重新网格化,并利用符号扰动来消除具有共圆点的构型的歧义。这使得在重新网格化重叠面片时容易丢弃重复的三角形。该方法在现有的“thingi10K”数据集(用于测试共细化和网格修复)和新公开的“thingiCSG”数据集(用于测试完整的CSG流程)上进行了测试,并与先前工作进行了比较,涵盖了各种具有不同类型“病态”特征的有趣示例。
英文摘要:
This article introduces a general mesh intersection algorithm that exactly computes the so-called Weiler model (also called an arrangement) and that uses it to implement boolean operations with arbitrary multi-operand expressions, CSG (constructive solid geometry) and some mesh repair operations. From an input polygon soup, the algorithm first computes the co-refinement, with an exact representation of the intersection points. Then, the decomposition of 3D space into volumetric regions (Weiler model) is constructed, by sorting the facets around the non-manifold intersection edges (radial sort), using specialized exact predicates. Finally, based on the input boolean expression, the triangular facets that belong to the boundary of the result are classified. To implement all the involved predicates and constructions, two geometric kernels are proposed, tested and discussed (arithmetic expansions and multi-precision floating-point). As a guiding principle,the combinatorial information shared between each step is kept as simple as possible. It is made possible by treating all the particular cases in the kernel. In particular, triangles with intersections are remeshed using the (uniquely defined) Constrained Delaunay Triangulation, with symbolic perturbations to disambiguate configurations with co-cyclic points. It makes it easy to discard the duplicated triangles that appear when remeshing overlapping facets. The method is tested and compared with previous work, on the existing "thingi10K" dataset (to test co-refinement and mesh repair) and on a new "thingiCSG" dataset made publicly available (to test the full CSG pipeline) on a variety of interesting examples featuring different types of "pathologies"
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。