Cone Rotation

A Cone is composed by a face list of triangles. The total number of vertices is (number of segments + 1) * 3. The vertices algorithm is:

v[0]= top x vertices;
v[1]= top y location;
v[2]= top z location;

counter = 3;
for every i < # of segments (
rotate to a new location to set the vertices
v[counter] = new x location;
v[counter+1] = new y location;
v[counter+2] = new z location;
counter+=3;
)

The number of faces is the number of segments. The face list algorithm is:

for every i < # of segments (
if(i==segments-1)
face[i] = face list of pts (0,i+1,1,0);
else
face[i] = face list of pts (0,i+1, i+2,0);
)