未验证 提交 38bf141e 编写于 作者: M Mr.doob 提交者: GitHub

Merge pull request #19006 from Mugen87/dev41

Docs: Clean up.
......@@ -18,10 +18,11 @@
<h3>[method:Array triangulate]( data, holeIndices, dim )</h3>
<p>
data -- A flat array of vertice coordinates.<br /><br />
holeIndices -- An array of hole indices if any.<br /><br />
dim -- The number of coordinates per vertice in the input array.<br /><br />
data -- A flat array of vertex coordinates.<br />
holeIndices -- An array of hole indices if any.<br />
dim -- The number of coordinates per vertex in the input array.<br /><br />
Triangulates the given shape definition by returning an array of triangles. A triangle is defined by three consecutive integers representing vertex indices.
</p>
<h2>Source</h2>
......
......@@ -24,8 +24,7 @@
<p>
contour -- 2D polygon. An array of THREE.Vector2()<br /><br />
Calculate area of a ( 2D ) contour polygon.<br /><br />
Calculate area of a ( 2D ) contour polygon.
</p>
<h3>[method:Boolean isClockWise]( pts )</h3>
......
......@@ -18,10 +18,11 @@
<h3>[method:Array triangulate]( data, holeIndices, dim )</h3>
<p>
data -- 一个顶点坐标的平面数组。<br /><br />
holeIndices -- 空洞索引的数组(如果有的话)。<br /><br />
data -- 一个顶点坐标的平面数组。<br />
holeIndices -- 空洞索引的数组(如果有的话)。<br />
dim -- 输入数组中每个顶点的坐标数。<br /><br />
Triangulates the given shape definition by returning an array of triangles. A triangle is defined by three consecutive integers representing vertex indices.
</p>
<h2>源代码</h2>
......
......@@ -23,8 +23,7 @@
<p>
contour -- 2D多边形,一个THREE.Vector2()数组。<br /><br />
计算(2D)轮廓多边形的面积。<br /><br />
计算(2D)轮廓多边形的面积。
</p>
<h3>[method:Boolean isClockWise]( pts )</h3>
......
Markdown is supported
0% .
You are about to add 0 people to the discussion. Proceed with caution.
先完成此消息的编辑!
想要评论请 注册