一种提高3D模型浅浮雕建模质量的方法

顶点数较少的3D模型本身细节不够丰富,浅浮雕建模生成的浮雕效果较差.针对低分辨率3D模型本身细节不够丰富的问题,引入深度学习的方法对3D模型生成的法向图做超分辨率放大,设计出一种基于法向图的超分辨率卷积神经网络,丰富低分辨率法向图的细节,网络的输入是低分辨率3D模型的法向图,输出是高分辨率法向图.实验结果表明:该算法可以有效提升低分辨率法向图的细节,显著提升低分辨率3D模型的浅浮雕建模质量.     

基于边收缩的渐进网格模型生成算法

为了实现3D模型的渐进式网格模型表示,改进基于边收缩方式模型简化的收缩代价计算方法。本算法首先从SMF数据文件中读取模型数据信息,然后在内存中快速建立起3D模型,重新设计Garland算法中QEM的权值计算方法。以顶点相邻三角平面法向量最大偏差的平方作为顶点的重要程度并将其加入到误差测度公式中,通过简化最终生成渐进式网格模型。实验结果表明,本算法简练,网格模型生成速度快,模型轮廓信息保持完整。     

基于GeoMipMap的分形地形的动态生成算法研究

三维真实感地形的生成一直是计算机图形学领域中的焦点课题,介绍一种同时采用GeoMipMap算法与分形算法来生成动态的随机地形的新方法,提出同时结合地形中点替换法和GeoMipMap算法的实时优化算法,讨论地形生成过程中的裂缝、突跳问题和顶点数据的存储问题,利用可见性剔除的简化策略和纹理混合贴图方式的渲染方法,并给出了该层次细节模型在地形渲染中的实现方法.通过对此算法的实现和优化,在保证一定的地形渲染效果的前提下,减少开销达到了提高实时渲染速度的目的.     

基于CREW遍历图的一种并行算法

针对串行算法模型下基于顶点遍历图的情况,提出了一种在CREWPRAM并行模型下遍历无向图的算法。该算法是找出无向图的一棵最短路径生成树,由向上和向下两条有向边替换最短路径生成树的每条边形成欧拉回路,运用欧拉回路技术计算前缀和,前缀和所对应的顶点即为遍历无向图的顺序。得出了该算法时间复杂度为O（n＋logn）的结论。     

艺术化立体图像的渲染

目前的艺术化渲染算法会使结果图像具有较强的随机性,因此无法直接应用于立体图像的渲染.文章针对虚拟三维场景,给出了一个通用的艺术风格立体图像的渲染框架.首先对单个物体渲染包括双眼视域范围的艺术风格图像,在投影过程中同时记录模型顶点对应的纹理坐标;然后将艺术风格图像映射到物体表面生成艺术化效果的三维模型;最后将艺术化三维模型直接投影到左右眼相机生成立体图像.为创建用于纹理映射的艺术化纹理图像,提出了在透视投影中颠倒像素遮挡关系的方法来获取模型的双眼视域范围图像.该文提出的艺术化立体图像生成方法不仅可保证双眼图像的一致性,而且具有良好的通用性,可适用于各类已有的艺术化渲染算法.     

GPU实现的快速分层地形渲染算法

随着GPU性能的飞速提升,越来越多的地形渲染算法能够完全由GPU实现.本文提出了一种新的完全基于GPU的地形渲染算法.该算法使用顶点着色器完成中间数据生成,在几何着色器中使用之前生成的信息完成地形的LOD操作和网格的动态生成.该算法不仅具有易于在GPU上实现的特点,同时能够提供无缝的、自适应地形起伏的渲染效果.这也顺应了图形学的主流:将图形计算或对几何体的操作从CPU转移到GPU上,从而做到无需CPU的干预,降低数据传输量,节约通信带宽的目的.实验证明,该算法适合于处理较大规模地形块.     

一种基于不平滑度的网格简化算法

在三维建模中,一个物体的网格模型常常包含数以百万计的三角形面片,给模型的存储、绘制、渲染、传输及交互处理带来诸多不便。提出一种三角形折叠法,计算各个顶点的不平滑度,基于顶点不平滑度确定各三角形的权值,并对符合折叠要求的三角形求解折叠后新顶点的位置及累积不平滑度,通过实例验证证明该算法在简化网格时能较好地保持模型整体特征。     

基于改进型四叉树算法的室外大规模场景实时渲染

在大规模场景渲染过程中,场景中节点的存储、查找,以及视域剔除是影响渲染速度的重要因素。采用一种改进型四叉树算法存储和查找顶点,采用迭代算法替换了原有的递归生成算法，利用该四叉树算法实现了射线检测和视域剔除。实验结果表明,该方法能够有效提高室外场景的渲染帧数，利用它在视域剔除上能发挥本身的层次特性和编码的有序性优点，可以避免和减少视域剔除算法中大量直线与面相交的计算，提高视域剔除算法的效率。     

基于3DS室内模型虚拟漫游场景的管理方法

以3DS室内模型作为虚拟漫游场景,提出了一种基于Portal技术的入口生成新方法及视锥体裁剪算法。首先在3DS MAX建模时确定入口位置,然后在虚拟漫游时由入口位置计算生成入口平面,进而用入口平面裁剪视锥体创建物体可见集实现场景管理。实验结果表明,这种入口生成方法效率高,室内模型遮挡性越强,裁剪算法的优越性越突出,此方法可适用于任何3DS室内模型虚拟漫游的场景管理。     

稀疏三角网格模型的Gregory曲面光顺插值

稀疏网格模型精细光顺重建时,网格顶点的法曲率不一致问题仍没有解决,导致渲染阴影。通过推导获得四次三角域Gregory顶点拼接处法曲率变化一致的约束条件,并基于该约束条件对稀疏三角网格模型进行精细重建。重建后的模型不但保证所有相邻三角Gregory曲面片G¹光顺连续,而且拼接顶点处的法曲率变化最小,从而可获得高质量的视觉效果。实验结果验证了在只有原始模型1%~2%网格数目的情况下可获得光顺的视觉渲染效果,结果模型亦具有高精细特征。     

基于混合子分方法的曲面网格顶点与法向插值

顶点位置和法向插值是参数曲面造型的重要内容,文中基于混合子分方法生成三次B样条控制网格,使得相应的三次B样条曲面插值初始网格中指定的顶点,并通过引入插值模板的概念,把法向的插值转化为对模板的旋转变换,使得曲面在不改变2插值顶点的情况下插值法向,最后得到一张C^2连续的插值指定顶点和法向的曲面,与传统的逐片Bezier或Coons曲面片构造方法相比,此方法更为简洁且具有更高的连续阶,而且易于推广到高阶B样条和任意拓扑情形,具有较强的实用性。     

Generalized View-Dependent Simplification

We propose a technique for performing view-dependent geometry and topology simplifications for level-of-detail-based renderings of large models. The algorithm proceeds by preprocessing the input dataset into a binary tree, the view-dependence tree of general vertex-pair collapses. A subset of the Delaunay edges is used to limit the number of vertex pairs considered for topology simplification. Dependencies to avoid mesh foldovers in manifold regions of the input object are stored in the view-dependence tree in an implicit fashion. We have observed that this not only reduces the space requirements by a factor of two, it also highly localizes the memory accesses at run time. The view-dependence tree is used at run time to generate the triangles for display. We also propose a cubic-spline-based distance metric that can be used to unify the geometry and topology simplifications by considering the vertex positions and normals in an integrated manner.     

Fast and effective feature-preserving mesh denoising

We present a simple and fast mesh denoising method, which can remove noise effectively, while preserving mesh features such as sharp edges and corners. The method consists of two stages. Firstly, noisy face normals are filtered iteratively by weighted averaging of neighboring face normals. Secondly, vertex positions are iteratively updated to agree with the denoised face normals. The weight function used during normal filtering is much simpler than that used in previous similar approaches, being simply a trimmed quadratic. This makes the algorithm both fast and simple to implement. Vertex position updating is based on the integration of surface normals using a least-squares error criterion. Like previous algorithms, we solve the least-squares problem by gradient descent, but whereas previous methods needed user input to determine the iteration step size, we determine it automatically. In addition, we prove the convergence of the vertex position updating approach. Analysis and experiments show the advantages of our proposed method over various earlier surface denoising methods.     

Surface interpolation of meshes by geometric subdivision

Subdivision surfaces are generated by repeated approximation or interpolation from initial control meshes. In this paper, two new non-linear subdivision schemes, face based subdivision scheme and normal based subdivision scheme, are introduced for surface interpolation of triangular meshes. With a given coarse mesh more and more details will be added to the surface when the triangles have been split and refined. Because every intermediate mesh is a piecewise linear approximation to the final surface, the first type of subdivision scheme computes each new vertex as the solution to a least square fitting problem of selected old vertices and their neighboring triangles. Consequently, sharp features as well as smooth regions are generated automatically. For the second type of subdivision, the displacement for every new vertex is computed as a combination of normals at old vertices. By computing the vertex normals adaptively, the limit surface is G¹ smooth. The fairness of the interpolating surface can be improved further by using the neighboring faces. Because the new vertices by either of these two schemes depend on the local geometry, but not the vertex valences, the interpolating surface inherits the shape of the initial control mesh more fairly and naturally. Several examples are also presented to show the efficiency of the new algorithms.     

Rendering continuous level-of-detail meshes by Masking Strips

In this paper we present a new continuous multiresolution approach which has been developed for the interactive visualization of meshes in real-time applications. Our interest is to offer an efficient solution which considers submeshes, textures, normals and bones for skeletal animations. The model has been designed to give view-independent continuous levels-of-detail and uses triangle strips for exploiting vertex cache and coherence for minimizing bus traffic. Furthermore, its data structures allow for an efficient extraction process where all unnecessary information is eliminated and also for progressive transmission. A new simplification strategy has also been developed, which preserves appearance and attributes. In the results section we present different images to show the visual quality obtained with this simplification method, as well as a study of the storage and rendering costs.     

Efficient mesh denoising via robust normal filtering and alternate vertex updating

The most challenging problem in mesh denoising is to distinguish features from noise. Based on the robust guided normal estimation and alternate vertex updating strategy, we investigate a new feature-preserving mesh denoising method. To accurately capture local structures around features, we propose a corner-aware neighborhood (CAN) scheme. By combining both overall normal distribution of all faces in a CAN and individual normal influence of the interested face, we give a new consistency measuring method, which greatly improves the reliability of the estimated guided normals. As the noise level lowers, we take as guidance the previous filtered normals, which coincides with the emerging rolling guidance idea. In the vertex updating process, we classify vertices according to filtered normals at each iteration and reposition vertices of distinct types alternately with individual regularization constraints. Experiments on a variety of synthetic and real data indicate that our method adapts to various noise, both Gaussian and impulsive, no matter in the normal direction or in a random direction, with few triangles flipped.     

Robust Feature-Preserving Mesh Denoising Based on Consistent Subneighborhoods

In this paper, we introduce a feature-preserving denoising algorithm. It is built on the premise that the underlying surface of a noisy mesh is piecewise smooth, and a sharp feature lies on the intersection of multiple smooth surface regions. A vertex close to a sharp feature is likely to have a neighborhood that includes distinct smooth segments. By defining the consistent subneighborhood as the segment whose geometry and normal orientation most consistent with those of the vertex, we can completely remove the influence from neighbors lying on other segments during denoising. Our method identifies piecewise smooth subneighborhoods using a robust density-based clustering algorithm based on shared nearest neighbors. In our method, we obtain an initial estimate of vertex normals and curvature tensors by robustly fitting a local quadric model. An anisotropic filter based on optimal estimation theory is further applied to smooth the normal field and the curvature tensor field. This is followed by second-order bilateral filtering, which better preserves curvature details and alleviates volume shrinkage during denoising. The support of these filters is defined by the consistent subneighborhood of a vertex. We have applied this algorithm to both generic and CAD models, and sharp features, such as edges and corners, are very well preserved.     

A robust hole-filling algorithm for triangular mesh

This paper presents a novel hole-filling algorithm that can fill arbitrary holes in triangular mesh models. First, the advancing front mesh technique is used to cover the hole with newly created triangles. Next, the desirable normals of the new triangles are approximated using our desirable normal computing schemes. Finally, the three coordinates of every new vertex are re-positioned by solving the Poisson equation based on the desirable normals and the boundary vertices of the hole. Many experimental results and error evaluations are given to show the robustness and efficiency of the algorithm.     

基于两步的网格平滑

在三角网格的生成过程中,不可避免地会出现噪声,如何有效地消除这些噪声已经成为当前计算机图形学领域的一个重要课题,提出了一个简单的,能有效去除噪声,同时能很好的保持网格尖边特征的算法.该算法通过两步来实现,第一步对三角网格的三角面面法矢量进行平滑,第二步依据面法矢量调整新的顶点坐标.此算法在伪三角的帮助下,能很好保持曲面的几何特征,防止曲面收缩.实验结果说明了实验的有效性.