查询词典 vertices

Adjacency matrix: is that relations between the vertices adjacent matrix.

邻接矩阵：是表示顶点之间相邻关系的矩阵。

A set S of vertices in a graph G is a dominating set of G if each vertex of V-SV(G is adjacent to some vertex of S.

图G的点集S如果满足：V|G|-S中每个点相邻于S中的某个点，则称点集S是一个控制集。

A directed graph, or digraph G consists of a finite nonempty set of vertices V, and a finite set of edges E, where an edge is an ordered pair of vertices in V.

有向图，或图克组成的有限非空子集的顶点V和有限的一套边英，那里的优势是下令对顶点在五顶点也称为节点。

A configuration is a connected cluster of vertices of a plane graph together with the degrees of the vertices.

一个构形是面图的一连串连通的顶点与这些顶点的度。

To decompose prismoid subject into sweepable sub-volumes, the source vertices project into target surface and decompose target surface to many subdomains. The virtual surfaces are found by linking opposite vertices from source surface and target surface, finally cut volume to sub-volumes. It is also designed spheriform decomposition based on geometry character.

虚拟分解主要是通过将棱柱体的源曲面边界顶点映射到目标曲面，将目标曲面划分成和源曲面一一对应的区域，连接对应的顶点建立虚拟剖分曲面，利用虚拟曲面将复杂的几何体剖分成子几何体。

Considering the triangulation algorithm based only on the determination of convex-concave vertices is restricted to simple polygons, this paper presents a triangulation algorithm for the general plane polygon GTP(General Triangulation of Polygons) based on determination of convex-concave vertices and connecting the outer border of a polygon with its inner borders.

摘 要：针对基于凹凸顶点判定的三角剖分算法适用范围有限的缺点，提出了将凹凸顶点判定与连接多边形内外边界相结合的适用任意平面多边形的三角剖分算法GTP(General Triangulation of Polygons)。

I modeled each tooth starting from a polygonal box, pulling vertices and pushing vertices and I ended up with 4030 polys for the main tiger mesh and 3166 polys for eyeballs, teeth, gum and tongue.

我使用一个多边形的正方体建造每一颗牙齿，不断的调整顶点，最后老虎的身体使用了4030个面，眼球、牙齿、牙龈和舌头共使用了3166个面。

In this project, we propose a novel 3D morphing technique that avoids creating a merged embedding that contains the faces, edges and vertices of two given embeddings. This novel 3D morphing technique dynamically adds or removes vertices to gradually transform the connectivity of 3D polyhedrons from a source model into a target model and simultaneously creates the intermediate shapes.

中文摘要在本专题研究计画中，我们提出一项新的三维物体变形技术，此变形技术所能处理的资料型态为two-manifold 之三维网格物体，此技术不需产生一个共有的高复杂度的网格物体或对原始物体进行重新网格化以产生相同连接关系，取而代之的是直接进行来源与目的物体之间几何与连接结构之转换，我们称此项新技术称为渐进式连接结构之转换(progressive connectivity transformation)，此技术藉由动态增加或移除顶点的方式从来源物体到目的物体逐渐地进行连接结构转换同时使用线性位置内差来产生一序列中间物体。

In this project, we propose a novel 3D morphing technique that avoids creating a merged embedding that contains the faces, edges and vertices of two given embeddings. This novel 3D morphing technique dynamically adds or removes vertices to gradually transform the connectivity of 3D polyhedrons from a source model into a target model and simultaneously creates the intermediate shapes.

在本专题研究计画中，我们提出一项新的三维物体变形技术，此变形技术所能处理的资料型态为two-manifold 之三维网格物体，此技术不需产生一个共有的高复杂度的网格物体或对原始物体进行重新网格化以产生相同连接关系，取而代之的是直接进行来源与目的物体之间几何与连接结构之转换，我们称此项新技术称为渐进式连接结构之转换(progressive connectivity transformation)，此技术藉由动态增加或移除顶点的方式从来源物体到目的物体逐渐地进行连接结构转换同时使用线性位置内差来产生一序列中间物体。

Given right of a group of control vertices per three vertices adjacent to a group Marche line drawing.

即 为一组，为一组，…，为一组，所有曲线段连在一起即构成了整个B样条曲线。

The split between the two groups can hardly be papered over.

这两个团体间的分歧难以掩饰。

This approach not only encourages a greater number of responses, but minimizes the likelihood of stale groupthink.

这种做法不仅鼓励了更多的反应，而且减少跟风的可能性。