메소드 | 설명 | |
---|---|---|
Circumference ( float radius ) : float | ||
Create9SlicedMesh ( float border = 1f, float width = 3f, float height = 3f, float marginUV = 1f ) : |
||
GetFibonacciSphereVertices ( int vertexCount = 1, bool randomize = true ) : List |
||
GetSubdividedIcosahedronVertices ( int subdivisions ) : List |
Creates a smoothly subdivided icosahedron. Vertex count is 2 + 10 * 4 ^ subdivisions (i.e. 12, 42, 162, 642, 2562, 10242...) Subdivision is slow above 3. Times: 0,1,2 = 0ms 3 = 43ms 4 = 605ms 5 = 9531ms 6 = ???? |
|
Icosahedron ( List |
create a regular icosahedron (20-sided polyhedron) You can create this programmatically instead of using the given vertex and index list, but it's kind of a pain and rather pointless beyond a learning exercise. |
|
PointOnCircle ( float radius, float angleInDegrees, |
||
Radius ( float circumference ) : float | ||
Subdivide ( List |
i0 / \ m02-m01 / \ / \ i2---m12---i1 |
메소드 | 설명 | |
---|---|---|
GetMidpointIndex ( int>.Dictionary |
public static Circumference ( float radius ) : float | ||
radius | float | |
리턴 | float |
public static Create9SlicedMesh ( float border = 1f, float width = 3f, float height = 3f, float marginUV = 1f ) : |
||
border | float | |
width | float | |
height | float | |
marginUV | float | |
리턴 |
public static GetFibonacciSphereVertices ( int vertexCount = 1, bool randomize = true ) : List |
||
vertexCount | int | |
randomize | bool | |
리턴 | List |
public static GetSubdividedIcosahedronVertices ( int subdivisions ) : List |
||
subdivisions | int | |
리턴 | List |
public static Icosahedron ( List |
||
vertices | List |
|
indices | List |
|
리턴 | void |
public static PointOnCircle ( float radius, float angleInDegrees, |
||
radius | float | |
angleInDegrees | float | |
origin | ||
리턴 |
public static Radius ( float circumference ) : float | ||
circumference | float | |
리턴 | float |
public static Subdivide ( List |
||
vectors | List |
|
indices | List |
|
removeSourceTriangles | bool | |
리턴 | void |