...
首页> 外文期刊>Computer Graphics Forum: Journal of the European Association for Computer Graphics >Multiresolution Surfaces having Arbitrary Topologies by a Reverse Doo Subdivision Method
【24h】

Multiresolution Surfaces having Arbitrary Topologies by a Reverse Doo Subdivision Method

机译:反向Doo细分方法的具有任意拓扑的多分辨率曲面

获取原文
获取原文并翻译 | 示例
   

获取外文期刊封面封底 >>

       

摘要

We have shown how to construct multiresolution structures for reversing subdivision rules using global least squares models (Samavati and Bartels, Computer Graphics Fourm, 18(2)):97-119, June 1999). As a result, semiorthogonal wavelet systems have also been generated. To construct a multiresolution surface of an arbitrary topology, however, biorthogonal wavelets are needed. In Bartels and Samavati (Journal of Computational and Applied Mathematics, 119:29-67, 2000) we introduced local least squares models for reversing subdivision rules to construct multiresolution curves and tensor product surfaces, noticing that the resulting wavelets were biorthogonal (under an induced inner product). Here, we construct multiresolution surfaces of arbitrary topologies by locally reversing the Doo subdivision scheme. In a Doo subdivision, a coarse surface is converted into a fine one by the contraction of coarse faces and the addition of new adjoining faces. We propose a novel reversing process to convert a fine surface into a coarse one plus an error. The conversion has the property that the subdivision of the resulting coarse surface is locally closest to the original fine surface, in the least squares sense, for two important face geometries. In this process, we first find those faces of the fine surface which might have been produced by the contraction of a coarse face in a Doo subdivision scheme. Then, we expand these faces. Since the expanded faces are not necessarily joined properly, several candidates are usually at hand for a single vertex of the coarse surface. To identify the set of candidates corresponding to a vertex, we construct a graph in such a way that any set of candidates corresponds to a connected component. The connected components can easily be identified by a depth first search traversal of the graph. Finally, vertices of the coarse surface are set to be the average of their corresponding candidates, and this is shown to be equivalent to local least squares approximation for regular arrangements of triangular and quadrilateral faces.
机译:我们已经展示了如何使用全局最小二乘模型构造用于反转细分规则的多分辨率结构(Samavati和Bartels,计算机图形学Fourm,18(2)):97-119,1999年6月)。结果,还产生了半正交小波系统。然而,为了构造任意拓扑的多分辨率表面,需要双正交小波。在Bartels和Samavati(计算与应用数学杂志,119:29-67,2000)中,我们引入了局部最小二乘模型来逆转细分规则,以构造多分辨率曲线和张量积曲面,并注意到所产生的小波是双正交的(在诱导下)。内部产品)。在这里,我们通过局部反转Doo细分方案来构造任意拓扑的多分辨率表面。在Doo细分中,通过收缩粗糙面并添加新的相邻面将粗糙表面转换为精细表面。我们提出了一种新颖的可逆过程,可以将精细表面转换为粗糙表面再加上误差。对于两个重要的面几何,转换具有以下特性:在最小二乘意义上,所得粗糙表面的细分在局部上最接近原始精细表面。在这个过程中,我们首先找到细表面的那些表面,这些表面可能是由于Doo细分方案中的粗糙表面的收缩而产生的。然后,我们扩展这些面孔。由于扩展面不一定正确地结合在一起,因此通常会为粗糙表面的单个顶点准备好几个候选对象。为了识别与顶点相对应的候选集,我们以任何候选集都与连接的组件相对应的方式构造图。通过图形的深度优先搜索遍历可以轻松识别连接的组件。最后,将粗糙表面的顶点设置为其对应候选对象的平均值,这对于三角形和四边形面的规则排列而言,等效于局部最小二乘近似。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号