arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1608.04082cs.GR
收藏

点法线对的加权二元平均及其在细分格式中的应用

A weighted binary average of point-normal pairs with application to subdivision schemes

Evgeny Lipovetsky, Nira Dyn

摘要:

细分是一种公知的和建立的方法,用于通过反复细化从离散数据生成光滑曲线和曲面。这种过程的典型输入是顶点的网格。在这项工作中,我们提出了完善的2D数据组成的多边形的顶点和正常的每个顶点。我们的核心细化过程是基于一个圆平均,这是一个新的非线性加权平均的两个点和它们相应的法线。证明了圆平均局部逼近曲线的能力。有了这种能力,圆平均是一个候选人修改线性细分方案细化点,计划细化点法向对。这是通过将线性细分方案中的加权二进制算术平均值(以重复的二进制平均值表示)替换为具有相同权重的圆平均值来实现的。在这里,我们研究修改的Lane-Riesenfeld算法和4点格式。对于初始数据仅由控制多边形组成的情况,提出了一种初始法线的简单选取方法。一个例子证明了上述两个修改方案的优越性,与天真的选择初始法线在相应的线性计划,当应用到一个控制多边形的边缘显着不同的长度。

英文摘要:

Subdivision is a well-known and established method for generating smooth curves and surfaces from discrete data by repeated refinements. The typical input for such a process is a mesh of vertices. In this work we propose to refine 2D data consisting of vertices of a polygon and a normal at each vertex. Our core refinement procedure is based on a circle average, which is a new non-linear weighted average of two points and their corresponding normals. The ability to locally approximate curves by the circle average is demonstrated. With this ability, the circle average is a candidate for modifying linear subdivision schemes refining points, to schemes refining point-normal pairs. This is done by replacing the weighted binary arithmetic means in a linear subdivision scheme, expressed in terms of repeated binary averages, by circle averages with the same weights. Here we investigate the modified Lane-Riesenfeld algorithm and the 4-point scheme. For the case that the initial data consists of a control polygon only, a naive method for choosing initial normals is proposed. An example demonstrates the superiority of the above two modified schemes, with the naive choice of initial normals over the corresponding linear schemes, when applied to a control polygon with edges of significantly different lengths.

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

↑