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

行进曲面:使用G $^1$多边曲面的等值面逼近

Marching Surfaces: Isosurface Approximation using G$^1$ Multi-Sided Surfaces

Gustavo Chávez, Alyn Rockwood

摘要:

推进曲面是一种基于$G^1$多边面片插值方案的等值面提取和逼近方法。给定标量值的3D网格,使用二阶信息和三次Hermite样条形成底层曲线网络。圆弧拟合定义Hermite曲线在指定等值线处的切向量。一旦形成边界曲线网络,将为每个网格单元确定曲线环,然后使用多边曲面片进行插值,这些曲面片在连接处是连续的$G^1$。该方法的数据经济性及其连续性保持特性提供了一种有效的压缩方案,非常适合移动设备上的间接体渲染,或在互联网上协作,同时增强了视觉保真度。使用多边形补丁,使一个更自然的方式来近似的等值面比使用固定数量的边或多边形的文献中提出的。通过与传统的Marching Cubes算法和其他$G^1$方法的比较,可以支持此断言。

英文摘要:

Marching surfaces is a method for isosurface extraction and approximation based on a $G^1$ multi-sided patch interpolation scheme. Given a 3D grid of scalar values, an underlying curve network is formed using second order information and cubic Hermite splines. Circular arc fitting defines the tangent vectors for the Hermite curves at specified isovalues. Once the boundary curve network is formed, a loop of curves is determined for each grid cell and then interpolated with multi-sided surface patches, which are $G^1$ continuous at the joins. The data economy of the method and its continuity preserving properties provide an effective compression scheme, ideal for indirect volume rendering on mobile devices, or collaborating on the Internet, while enhancing visual fidelity. The use of multi-sided patches enables a more natural way to approximate the isosurfaces than using a fixed number of sides or polygons as is proposed in the literature. This assertion is supported with comparisons to the traditional Marching Cubes algorithm and other $G^1$ methods.

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

↑