您要查找的是不是：
- merge triangular mesh 三角形合并
- Triangular mesh, Backface culling, Normal, Topological mapping, Surfaces trimming, Mesh simplification. 01三角网格,背向面去除,法向量,拓扑映射,曲面切割,网格简化
- An algorithm of triangular mesh simplification with vertex culling is proposed.The method is based on bounded error. 提出了以限定误差界为准则，运用顶点去除法简化三角网格的算法。
- In this process, a new coding method makes the genetic algorithm suitable for specificity of triangular mesh. 在此过程中以一种新的编码方式使遗传算法能够适应网格优化的特殊性；
- With regard to an arbitrary planar region, we decompose it into relatively uniform triangular mesh to produce triangles as the unit for texture synthesis. 对于任意平面区域需剖分成较均匀的三角网格，以剖分得到的三角形作为基本的合成单元来进行合成。
- On the basis of that, this paper ameliorates to form an improved method, namely, ameliorated advancing front approach (AAFA) as the algorithm of triangular mesh generation. 选择一种方法即边界推进算法，在此基础上提出了一种改进的边界推进算法，作为本论文生成三角形网格的算法。
- Spherical QTM (Quaternary Triangular Mesh) is efficient to deal with the global data because of its advantages of multi-resolution and hierarchy. 球面四元三角网具有多分辨率和层次组织的特性,已成为目前研究球面问题的有效方法之一,本文主要讨论任意球面三角格网p的三拓扑数计算。
- After vertex culling, triangular mesh reconstruction is conducted at the generated polygon to fill up hollows formed in the above steps. 对顶点去除后，还需对因此形成的多边形区域进行网格重建，填补空洞。
- Determining spatial relation between two spherical objects is approached in this paper by recursive refine based on QTM (Quaternary Triangular Mesh) hierarchical partition. 主要讨论了在基于四元三角网 ( quaternary Triangular Mesh,简称 QTM)球面层次格网剖分的基础上 ,通过单元递归细化来确定 2个球面实体的空间关系。
- A technique of nonstructured triangular mesh generation which is easy to be incor-porated in the technique of self adaptive mesh refinement is developed. 发展了一种易于和自适应网格加密技术相结合的非结构三角形网格生成技术。
- The 3D triangular mesh data provide important data structure for representing three-dimensional models.The mesh data consist of topologic data and geometric data. 完整的三维影像资料，包含几何资料及拓朴资料，整合这两部份之资讯才可以构成一个三维网格曲面。
- A preprocessing procedure, which is for detecting creases and corners through two adjacent triangles’ dihedral angles and simplifying triangular mesh, is described. 在三角形网格预处理部分，利用两相邻三角形的法向夹角来检测曲面上的棱和角点，同时利用面积标准来简化三角形网格。
- The solution to the correspondence problem is important for reconstruction of surface from contours, especially for validity of topology of the reconstructed triangular mesh. 轮廓对应问题的解决是基于轮廓数据曲面重构的关键工作，是保证重建网格模型拓扑关系正确性的基础。
- The above deformation of the triangular mesh is designed to keep the Delaunay properties in order to obtain good performance of coding efficiency and interpolated image quality. 近似模型的优化使恢复图像的主客观质量显著提高，从而使整个方案在相同信噪比条件下具有更高的数据压缩比。
- The roads merge a kilometre ahead. 这两条道路在前面一公处汇合成一条大道。
- After geometric operations such as decimation, defragmentation, cutting and mirroring are applied to the original triangular mesh, an RP model of same size as the bone is fabricated with LOM method. 对几何模型进行三角面精简、碎片清除、切割、镜像和合并等几何运算后,用LOM法制作实际大小的快速原型模型。
- This method is applicable to both arbitrary planar regions and 3D triangular mesh of any topology with convenient control of smooth changes in directions and scales shown in texture synthesis. 该算法适用于任意二维平面和任意拓扑的三维网格，可方便地控制纹理合成时方向和尺度的连续变化。
- Based on the advancing front technique developed for triangular mesh generation, quadrilateral mesh can be generated by dividing each triangular element into three quadrilateral elements. 该法在行波法生成平面三角形网格的基础上,将一个三角形单元分解为三个四边形单元。
- Abstract : Based on ideas of triangulation network growth algorithm and partition algorithm,a triangular mesh reconstruction algorithm in dishevelled points of planar domain is presented and realized. 摘要： 基于三角网生长算法和分治算法的思想，提出并实现了一个平面域散乱点的三角网格重构算法。
- A region-growing algorithm was proposed to reconstruct triangular meshes from unorganized point cloud. 摘要提出一种对无规则点云进行三角网格重构的区域增长算法。
