vertices is vertex's Plural Form

vertex

US [ˈvɜrˌteks]
UK [ˈvɜː(r)teks]
  • n.【几】顶(点)；【解】颅顶；【天】天顶；绝顶
  • Web顶点；顶点数；绘制顶点
Plural Form：vertexs  Plural Form：vertices  Plural Form：vertexes  

Synonym

Antonym

E-C

E-E

Web Definition

n.
1.
【几】顶(点);【解】颅顶,头顶;【天】天顶
2.
顶(点),绝顶

Sample Sentence

Definition:
AllAll,顶顶,颅顶颅顶,天顶天顶,绝顶绝顶,顶点顶点,顶点数顶点数,绘制顶点绘制顶点
Category:AllAll,OralOral,WrittenWritten,TitleTitle,TechnicalTechnical
Source:AllAll,DictionaryDictionary,WebWeb
Difficulty:AllAll,EasyEasy,MiddleMiddle,HardHard
1.
How much world-space movement of the character will affect cloth vertices.
在世界空间角色有多少移动，将影响布料顶点。
zài shì jiè kōng jiān jué sè yǒu duō shao yí dòng , jiāng yǐng xiǎng bù liào dǐng diǎn 。
game.ceeger.com
2.
In a graph, a vertex in a tree can be connected to any number of other vertices, provided that no cycles are created.
在图中，树的顶点可以连接任意数量的顶点，只要不存在环即可。
zài tú zhōng , shù de dǐng diǎn kě yǐ lián jiē rèn yì shù liàng de dǐng diǎn , zhǐ yào bù cún zài huán jí kě 。
blog.sina.com.cn
3.
A closed path in a graph that does not pass through any vertex more than once and passes through at least three vertices.
图中经过三个以上顶点且经过每个顶点仅一次的一条封闭路径。
tú zhōng jīng guò sān gè yǐ shàng dǐng diǎn qiě jīng guò měi gè dǐng diǎn jǐn yī cì de yī tiáo fēng bì lù jìng 。
www.jukuu.com
4.
Single selected vertices which do not belong to selected edges are duplicated and a new edge is created between the two.
如果选择点，那么他将在新点与原始点之间生成边。
rú guǒ xuǎn zé diǎn , nà me tā jiāng zài xīn diǎn yǔ yuán shǐ diǎn zhī jiān shēng chéng biān 。
wiki.blendercn.org
5.
These new vertices introduced to decrease the total length of connection are known as Steiner points or Steiner vertices.
这些新的顶点介绍，以减少总长度的连接被称为斯坦纳点或施泰纳顶点。
zhè xiē xīn de dǐng diǎn jiè shào , yǐ jiǎn shǎo zǒng cháng dù de lián jiē bèi chēng wéi sī tǎn nà diǎn huò shī tài nà dǐng diǎn 。
blog.sina.com.cn
6.
How much world-space acceleration of the character will affect cloth vertices.
在世界空间角色有多少加速度，将影响布料顶点。
zài shì jiè kōng jiān jué sè yǒu duō shao jiā sù dù , jiāng yǐng xiǎng bù liào dǐng diǎn 。
game.ceeger.com
7.
For a graph G, f is a strong edge coloring if it is proper and any two vertices are incident with different sets of colors.
如果图G有一个合理边上色，使图G的所有相邻顶点的关联边上色集合都互不相同，则称图G为准强边着色。
rú guǒ tú G yǒu yī gè hé lǐ biān shàng sè , shǐ tú G de suǒ yǒu xiāng lín dǐng diǎn de guān lián biān shàng sè jí hé dōu hù bù xiāng tóng , zé chēng tú G wéi zhǔn qiáng biān zhuó sè 。
www.dictall.com
8.
There were twenty rooms, each connecting to three others, arranged like the vertices of a dodecahedron (or the faces of an icosahedron).
其中有20个房间，每个房间与另外三个相连接，排列像一个dodecahedron的顶点（或者是一个icosahedron的面）。
qí zhōng yǒu èr shí gè fáng jiān , měi gè fáng jiān yǔ lìng wài sān gè xiāng lián jiē , pái liè xiàng yī gè dodecahedron de dǐng diǎn ( huò zhě shì yī gè icosahedron de miàn ) 。
en.wikipedia.org
9.
if two edges of a graph are incident to the same pair of vertices , then these two edges are called parallel edges.
如果一个图的两条边关联于同一对顶点，则这两条边称为平行边。
rú guǒ yī gè tú de liǎng tiáo biān guān lián yú tóng yí duì dǐng diǎn , zé zhè liǎng tiáo biān chēng wéi píng xíng biān 。
www.ichacha.net
10.
of an unknown point, as in navigation, by the formation of a triangle having the unknown point and two known points as the vertices.
三角测量通过以分别作（顶点）的两个已知点和一个未知点形成一个三角形，来求出或定位该未知点，如在航海中。
sān jiǎo cè liáng tōng guò yǐ fēn bié zuò ( dǐng diǎn ) de liǎng gè yǐ zhī diǎn hé yī gè wèi zhī diǎn xíng chéng yī gè sān jiǎo xíng , lái qiú chū huò dìng wèi gāi wèi zhī diǎn , rú zài háng hǎi zhōng 。
dict.ebigear.com
Did you mean
Bing Dictionary App
Without any ads
Go to website
Download mobile dict apps
iOS
Windows Phone
Android
Download PC apps
Win32 VersionMicrosoft Store