您要查找的是不是：
- partition of vertices set 顶点划分
- Classes of Upper-embeddable Graphs in Terms of C-partition of Vertices Set 与顶点C-划分有关的上可嵌入图类
- Gets the number of vertices in a mesh. 获取网格中的顶点的数量。
- Maximum number of vertices the buffer can hold. 缓冲区可以容纳的顶点的最大数目。
- Excessive number of vertices on a tessera. 计算溶剂效应出现如下错误怎么办？
- One who advocates partition of a country. 鼓吹政治瓜分的人
- Locks, sets, and unlocks a range of vertex data. 锁定、设置和取消锁定某一范围的顶点数据。
- Create surfaces. We use early created arrays as a set of vertices. 创建表面。我们用之前建立好的数组作为顶点的设置。
- Gets or sets the number of vertices in the attribute group. 获取或设置属性组中的顶点数。
- Only the last partition of a logical drive can be deleted. 仅可以删除逻辑驱动器的最后一个分区。
- The correct number of vertices is read out of the vertex buffer. 开始,从顶点缓冲区中读取正确数量的顶点。
- Locks a range of vertex data and obtains the vertex buffer memory. 锁定某一范围的顶点数据,并获取顶点缓冲区内存。
- They called for the partition of that country into two independent states. 他们要求把那个国家分割为独立的两个国家。
- In this paper, we study the minimum-weight feedback vertex set problem in outerplanar graphs and present a linear time algorithm to solve it. 本文主要考虑外平面图中的反馈点集并给出了一个求外平面图最小顶点赋权反馈点集的线性时间算法。
- The algorithm uses a group of connective nodes without loop as a generalized data gather vertex set. 算法选取网络中一组无环连通点集抽象为广义数据汇聚点集。
- They are against the partition of that country into two independent states. 他们反对把那个国家分割为独立的两个国家。
- S is also based Vertex Set T, T / S from the tree T Lieutenant General S vertex deletion the forest. 又设S 是T 的顶点集,T/S 是从树T 中 将S中顶点删去后得到的森林。
- Pay attention during the partitioning of the disk. 对磁盘进行分区时要小心。
- Also, try to minimize changes of vertex or index buffer. 同样也要尽量减少顶点缓存或者索引缓存的切换。
- Applications create a line list by filling an array of vertices. 程序通过填充一组顶点到顶点缓存中来创建线链表。
