arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2105.02507cs.GR
收藏

PH-CPF:使用坐标功率场的平面交错网格

PH-CPF: Planar Hexagonal Meshing using Coordinate Power Fields

Kacper Pluta, Michal Edelstein, Amir Vaxman, Mirela Ben-Chen

摘要:

我们提出了一种新的方法来计算平面六边形网格,近似一个给定的表面,表示为三角形网格。我们的方法是基于两个新的技术贡献。首先,我们介绍了坐标功率场,这是一对切向量场的表面上,满足一定的连续性约束。我们证明,这个约束的履行保证了一个无缝的参数化与量化的旋转跳跃,然后我们使用定期重新网格的表面的存在。此外,我们还提出了一个优化框架,找到坐标功率场,这也满足额外的约束,如对齐,大小和双射性。其次,我们建立在这个框架,以解决一个具有挑战性的网格划分问题:平面六边形网格。为此,我们建议结合共轭,缩放和对齐约束,这一起导致可平面化的六边形。我们证明了我们的方法在各种表面上,自动生成平面六边形网格的复杂网格,这是无法实现与现有的方法。

英文摘要:

We present a new approach for computing planar hexagonal meshes that approximate a given surface, represented as a triangle mesh. Our method is based on two novel technical contributions. First, we introduce Coordinate Power Fields, which are a pair of tangent vector fields on the surface that fulfill a certain continuity constraint. We prove that the fulfillment of this constraint guarantees the existence of a seamless parameterization with quantized rotational jumps, which we then use to regularly remesh the surface. We additionally propose an optimization framework for finding Coordinate Power Fields, which also fulfill additional constraints, such as alignment, sizing and bijectivity. Second, we build upon this framework to address a challenging meshing problem: planar hexagonal meshing. To this end, we suggest a combination of conjugacy, scaling and alignment constraints, which together lead to planarizable hexagons. We demonstrate our approach on a variety of surfaces, automatically generating planar hexagonal meshes on complicated meshes, which were not achievable with existing methods.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑