4 * Freeglut geometry rendering methods.
6 * Copyright (c) 1999-2000 Pawel W. Olszta. All Rights Reserved.
7 * Written by Pawel W. Olszta, <olszta@sourceforge.net>
8 * Creation date: Fri Dec 3 1999
10 * Permission is hereby granted, free of charge, to any person obtaining a
11 * copy of this software and associated documentation files (the "Software"),
12 * to deal in the Software without restriction, including without limitation
13 * the rights to use, copy, modify, merge, publish, distribute, sublicense,
14 * and/or sell copies of the Software, and to permit persons to whom the
15 * Software is furnished to do so, subject to the following conditions:
17 * The above copyright notice and this permission notice shall be included
18 * in all copies or substantial portions of the Software.
20 * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS
21 * OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
22 * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL
23 * PAWEL W. OLSZTA BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER
24 * IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN
25 * CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
28 #include <GL/freeglut.h>
29 #include "fg_internal.h"
34 * Need more types of polyhedra? See CPolyhedron in MRPT
37 /* VC++6 in C mode doesn't have C99's sinf/cos/sqrtf */
39 #define sinf(x) (float)sin((double)(x))
42 #define cosf(x) (float)cos((double)(x))
45 #define sqrtf(x) (float)sqrt((double)(x))
48 /* General functions for drawing geometry
49 * Solids are drawn by glDrawArrays if composed of triangles, or by
50 * glDrawElements if consisting of squares or pentagons that were
51 * decomposed into triangles (some vertices are repeated in that case).
52 * WireFrame drawing will have to be done per face, using GL_LINE_LOOP and
53 * issuing one draw call per face. Always use glDrawArrays as no triangle
54 * decomposition needed. We use the "first" parameter in glDrawArrays to go
58 /* Version for OpenGL (ES) 1.1 */
59 #ifndef GL_ES_VERSION_2_0
60 static void fghDrawGeometryWire11(GLfloat *vertices, GLfloat *normals,
61 GLushort *vertIdxs, GLsizei numParts, GLsizei numVertPerPart, GLenum vertexMode,
62 GLushort *vertIdxs2, GLsizei numParts2, GLsizei numVertPerPart2
67 glEnableClientState(GL_VERTEX_ARRAY);
68 glEnableClientState(GL_NORMAL_ARRAY);
70 glVertexPointer(3, GL_FLOAT, 0, vertices);
71 glNormalPointer(GL_FLOAT, 0, normals);
75 /* Draw per face (TODO: could use glMultiDrawArrays if available) */
76 for (i=0; i<numParts; i++)
77 glDrawArrays(vertexMode, i*numVertPerPart, numVertPerPart);
79 for (i=0; i<numParts; i++)
80 glDrawElements(vertexMode,numVertPerPart,GL_UNSIGNED_SHORT,vertIdxs+i*numVertPerPart);
83 for (i=0; i<numParts2; i++)
84 glDrawElements(GL_LINE_LOOP,numVertPerPart2,GL_UNSIGNED_SHORT,vertIdxs2+i*numVertPerPart2);
86 glDisableClientState(GL_VERTEX_ARRAY);
87 glDisableClientState(GL_NORMAL_ARRAY);
91 /* Version for OpenGL (ES) >= 2.0 */
92 static void fghDrawGeometryWire20(GLfloat *vertices, GLfloat *normals,
93 GLushort *vertIdxs, GLsizei numParts, GLsizei numVertPerPart, GLenum vertexMode,
94 GLushort *vertIdxs2, GLsizei numParts2, GLsizei numVertPerPart2,
95 GLint attribute_v_coord, GLint attribute_v_normal
98 GLuint vbo_coords = 0, vbo_normals = 0;
99 GLuint numVertices = numParts * numVertPerPart;
103 if (numVertices > 0 && attribute_v_coord != -1) {
104 fghGenBuffers(1, &vbo_coords);
105 fghBindBuffer(FGH_ARRAY_BUFFER, vbo_coords);
106 fghBufferData(FGH_ARRAY_BUFFER, numVertices * 3 * sizeof(vertices[0]),
107 vertices, FGH_STATIC_DRAW);
110 if (numVertices > 0 && attribute_v_normal != -1) {
111 fghGenBuffers(1, &vbo_normals);
112 fghBindBuffer(FGH_ARRAY_BUFFER, vbo_normals);
113 fghBufferData(FGH_ARRAY_BUFFER, numVertices * 3 * sizeof(normals[0]),
114 normals, FGH_STATIC_DRAW);
118 fghEnableVertexAttribArray(attribute_v_coord);
119 fghBindBuffer(FGH_ARRAY_BUFFER, vbo_coords);
120 fghVertexAttribPointer(
121 attribute_v_coord, /* attribute */
122 3, /* number of elements per vertex, here (x,y,z) */
123 GL_FLOAT, /* the type of each element */
124 GL_FALSE, /* take our values as-is */
125 0, /* no extra data between each position */
126 0 /* offset of first element */
131 fghEnableVertexAttribArray(attribute_v_normal);
132 fghBindBuffer(FGH_ARRAY_BUFFER, vbo_normals);
133 fghVertexAttribPointer(
134 attribute_v_normal, /* attribute */
135 3, /* number of elements per vertex, here (x,y,z) */
136 GL_FLOAT, /* the type of each element */
137 GL_FALSE, /* take our values as-is */
138 0, /* no extra data between each position */
139 0 /* offset of first element */
143 /* Draw per face (TODO: could use glMultiDrawArrays if available) */
144 for (i=0; i<numParts; i++)
145 glDrawArrays(vertexMode, i*numVertPerPart, numVertPerPart);
149 fghDisableVertexAttribArray(attribute_v_coord);
150 if (vbo_normals != 0)
151 fghDisableVertexAttribArray(attribute_v_normal);
154 fghDeleteBuffers(1, &vbo_coords);
155 if (vbo_normals != 0)
156 fghDeleteBuffers(1, &vbo_normals);
159 static void fghDrawGeometryWire(GLfloat *vertices, GLfloat *normals,
160 GLushort *vertIdxs, GLsizei numParts, GLsizei numVertPerPart, GLenum vertexMode,
161 GLushort *vertIdxs2, GLsizei numParts2, GLsizei numVertPerPart2
164 GLint attribute_v_coord = fgStructure.CurrentWindow->Window.attribute_v_coord;
165 GLint attribute_v_normal = fgStructure.CurrentWindow->Window.attribute_v_normal;
167 if (fgState.HasOpenGL20 && (attribute_v_coord != -1 || attribute_v_normal != -1))
168 /* User requested a 2.0 draw */
169 fghDrawGeometryWire20(vertices, normals,
170 vertIdxs, numParts, numVertPerPart, vertexMode,
171 vertIdxs2, numParts2, numVertPerPart2,
172 attribute_v_coord, attribute_v_normal);
173 #ifndef GL_ES_VERSION_2_0
175 fghDrawGeometryWire11(vertices, normals,
176 vertIdxs, numParts, numVertPerPart, vertexMode,
177 vertIdxs2, numParts2, numVertPerPart2);
182 /* Draw the geometric shape with filled triangles
184 * - If the shape is naturally triangulated (numEdgePerFace==3), each
185 * vertex+normal pair is used only once, so no vertex indices.
187 * - If the shape was triangulated (DECOMPOSE_TO_TRIANGLE), some
188 * vertex+normal pairs are reused, so use vertex indices.
191 /* Version for OpenGL (ES) 1.1 */
192 #ifndef GL_ES_VERSION_2_0
193 static void fghDrawGeometrySolid11(GLfloat *vertices, GLfloat *normals, GLushort *vertIdxs,
194 GLsizei numVertices, GLsizei numParts, GLsizei numVertIdxsPerPart)
198 glEnableClientState(GL_VERTEX_ARRAY);
199 glEnableClientState(GL_NORMAL_ARRAY);
201 glVertexPointer(3, GL_FLOAT, 0, vertices);
202 glNormalPointer(GL_FLOAT, 0, normals);
203 if (vertIdxs == NULL)
204 glDrawArrays(GL_TRIANGLES, 0, numVertices);
207 for (i=0; i<numParts; i++)
208 glDrawElements(GL_TRIANGLE_STRIP, numVertIdxsPerPart, GL_UNSIGNED_SHORT, vertIdxs+i*numVertIdxsPerPart);
210 glDrawElements(GL_TRIANGLES, numVertIdxsPerPart, GL_UNSIGNED_SHORT, vertIdxs);
212 glDisableClientState(GL_VERTEX_ARRAY);
213 glDisableClientState(GL_NORMAL_ARRAY);
217 /* Version for OpenGL (ES) >= 2.0 */
218 static void fghDrawGeometrySolid20(GLfloat *vertices, GLfloat *normals, GLushort *vertIdxs,
219 GLsizei numVertices, GLsizei numParts, GLsizei numVertIdxsPerPart,
220 GLint attribute_v_coord, GLint attribute_v_normal)
222 GLuint vbo_coords = 0, vbo_normals = 0, ibo_elements = 0;
224 if (numVertices > 0 && attribute_v_coord != -1) {
225 fghGenBuffers(1, &vbo_coords);
226 fghBindBuffer(FGH_ARRAY_BUFFER, vbo_coords);
227 fghBufferData(FGH_ARRAY_BUFFER, numVertices * 3 * sizeof(vertices[0]),
228 vertices, FGH_STATIC_DRAW);
231 if (numVertices > 0 && attribute_v_normal != -1) {
232 fghGenBuffers(1, &vbo_normals);
233 fghBindBuffer(FGH_ARRAY_BUFFER, vbo_normals);
234 fghBufferData(FGH_ARRAY_BUFFER, numVertices * 3 * sizeof(normals[0]),
235 normals, FGH_STATIC_DRAW);
238 if (vertIdxs != NULL) {
239 fghGenBuffers(1, &ibo_elements);
240 fghBindBuffer(FGH_ELEMENT_ARRAY_BUFFER, ibo_elements);
241 fghBufferData(FGH_ELEMENT_ARRAY_BUFFER, numVertIdxsPerPart * sizeof(vertIdxs[0]),
242 vertIdxs, FGH_STATIC_DRAW);
246 fghEnableVertexAttribArray(attribute_v_coord);
247 fghBindBuffer(FGH_ARRAY_BUFFER, vbo_coords);
248 fghVertexAttribPointer(
249 attribute_v_coord, /* attribute */
250 3, /* number of elements per vertex, here (x,y,z) */
251 GL_FLOAT, /* the type of each element */
252 GL_FALSE, /* take our values as-is */
253 0, /* no extra data between each position */
254 0 /* offset of first element */
259 fghEnableVertexAttribArray(attribute_v_normal);
260 fghBindBuffer(FGH_ARRAY_BUFFER, vbo_normals);
261 fghVertexAttribPointer(
262 attribute_v_normal, /* attribute */
263 3, /* number of elements per vertex, here (x,y,z) */
264 GL_FLOAT, /* the type of each element */
265 GL_FALSE, /* take our values as-is */
266 0, /* no extra data between each position */
267 0 /* offset of first element */
271 if (vertIdxs == NULL) {
272 glDrawArrays(GL_TRIANGLES, 0, numVertices);
274 fghBindBuffer(FGH_ELEMENT_ARRAY_BUFFER, ibo_elements);
275 glDrawElements(GL_TRIANGLES, numVertIdxsPerPart, GL_UNSIGNED_SHORT, 0);
278 /* Clean existing bindings before clean-up */
279 /* Android showed instability otherwise */
280 fghBindBuffer(FGH_ARRAY_BUFFER, 0);
281 fghBindBuffer(FGH_ELEMENT_ARRAY_BUFFER, 0);
284 fghDisableVertexAttribArray(attribute_v_coord);
285 if (vbo_normals != 0)
286 fghDisableVertexAttribArray(attribute_v_normal);
289 fghDeleteBuffers(1, &vbo_coords);
290 if (vbo_normals != 0)
291 fghDeleteBuffers(1, &vbo_normals);
292 if (ibo_elements != 0)
293 fghDeleteBuffers(1, &ibo_elements);
296 static void fghDrawGeometrySolid(GLfloat *vertices, GLfloat *normals, GLushort *vertIdxs,
297 GLsizei numVertices, GLsizei numParts, GLsizei numVertIdxsPerPart)
299 GLint attribute_v_coord = fgStructure.CurrentWindow->Window.attribute_v_coord;
300 GLint attribute_v_normal = fgStructure.CurrentWindow->Window.attribute_v_normal;
302 if (fgState.HasOpenGL20 && (attribute_v_coord != -1 || attribute_v_normal != -1))
303 /* User requested a 2.0 draw */
304 fghDrawGeometrySolid20(vertices, normals, vertIdxs,
305 numVertices, numParts, numVertIdxsPerPart,
306 attribute_v_coord, attribute_v_normal);
307 #ifndef GL_ES_VERSION_2_0
309 fghDrawGeometrySolid11(vertices, normals, vertIdxs,
310 numVertices, numParts, numVertIdxsPerPart);
314 /* Shape decomposition to triangles
315 * We'll use glDrawElements to draw all shapes that are not naturally
316 * composed of triangles, so generate an index vector here, using the
317 * below sampling scheme.
318 * Be careful to keep winding of all triangles counter-clockwise,
319 * assuming that input has correct winding...
321 static GLubyte vert4Decomp[6] = {0,1,2, 0,2,3}; /* quad : 4 input vertices, 6 output (2 triangles) */
322 static GLubyte vert5Decomp[9] = {0,1,2, 0,2,4, 4,2,3}; /* pentagon: 5 input vertices, 9 output (3 triangles) */
324 static void fghGenerateGeometryWithIndexArray(int numFaces, int numEdgePerFace, GLfloat *vertices, GLubyte *vertIndices, GLfloat *normals, GLfloat *vertOut, GLfloat *normOut, GLushort *vertIdxOut)
326 int i,j,numEdgeIdxPerFace;
327 GLubyte *vertSamps = NULL;
328 switch (numEdgePerFace)
331 /* nothing to do here, we'll draw with glDrawArrays */
334 vertSamps = vert4Decomp;
335 numEdgeIdxPerFace = 6; /* 6 output vertices for each face */
338 vertSamps = vert5Decomp;
339 numEdgeIdxPerFace = 9; /* 9 output vertices for each face */
343 * Build array with vertices using vertex coordinates and vertex indices
344 * Do same for normals.
345 * Need to do this because of different normals at shared vertices.
347 for (i=0; i<numFaces; i++)
350 int faceIdxVertIdx = i*numEdgePerFace; /* index to first element of "row" in vertex indices */
351 for (j=0; j<numEdgePerFace; j++)
353 int outIdx = i*numEdgePerFace*3+j*3;
354 int vertIdx = vertIndices[faceIdxVertIdx+j]*3;
356 vertOut[outIdx ] = vertices[vertIdx ];
357 vertOut[outIdx+1] = vertices[vertIdx+1];
358 vertOut[outIdx+2] = vertices[vertIdx+2];
360 normOut[outIdx ] = normals [normIdx ];
361 normOut[outIdx+1] = normals [normIdx+1];
362 normOut[outIdx+2] = normals [normIdx+2];
365 /* generate vertex indices for each face */
367 for (j=0; j<numEdgeIdxPerFace; j++)
368 vertIdxOut[i*numEdgeIdxPerFace+j] = faceIdxVertIdx + vertSamps[j];
372 static void fghGenerateGeometry(int numFaces, int numEdgePerFace, GLfloat *vertices, GLubyte *vertIndices, GLfloat *normals, GLfloat *vertOut, GLfloat *normOut)
374 /* This function does the same as fghGenerateGeometryWithIndexArray, just skipping the index array generation... */
375 fghGenerateGeometryWithIndexArray(numFaces, numEdgePerFace, vertices, vertIndices, normals, vertOut, normOut, NULL);
379 /* -- INTERNAL SETUP OF GEOMETRY --------------------------------------- */
380 /* -- stuff that can be cached -- */
381 /* Cache of input to glDrawArrays or glDrawElements
382 * In general, we build arrays with all vertices or normals.
383 * We cant compress this and use glDrawElements as all combinations of
384 * vertices and normals are unique.
386 #define DECLARE_SHAPE_CACHE(name,nameICaps,nameCaps)\
387 static GLboolean name##Cached = FALSE;\
388 static GLfloat name##_verts[nameCaps##_VERT_ELEM_PER_OBJ];\
389 static GLfloat name##_norms[nameCaps##_VERT_ELEM_PER_OBJ];\
390 static void fgh##nameICaps##Generate()\
392 fghGenerateGeometry(nameCaps##_NUM_FACES, nameCaps##_NUM_EDGE_PER_FACE,\
393 name##_v, name##_vi, name##_n,\
394 name##_verts, name##_norms);\
396 #define DECLARE_SHAPE_CACHE_DECOMPOSE_TO_TRIANGLE(name,nameICaps,nameCaps)\
397 static GLboolean name##Cached = FALSE;\
398 static GLfloat name##_verts[nameCaps##_VERT_ELEM_PER_OBJ];\
399 static GLfloat name##_norms[nameCaps##_VERT_ELEM_PER_OBJ];\
400 static GLushort name##_vertIdxs[nameCaps##_VERT_PER_OBJ_TRI];\
401 static void fgh##nameICaps##Generate()\
403 fghGenerateGeometryWithIndexArray(nameCaps##_NUM_FACES, nameCaps##_NUM_EDGE_PER_FACE,\
404 name##_v, name##_vi, name##_n,\
405 name##_verts, name##_norms, name##_vertIdxs);\
409 #define CUBE_NUM_VERT 8
410 #define CUBE_NUM_FACES 6
411 #define CUBE_NUM_EDGE_PER_FACE 4
412 #define CUBE_VERT_PER_OBJ (CUBE_NUM_FACES*CUBE_NUM_EDGE_PER_FACE)
413 #define CUBE_VERT_ELEM_PER_OBJ (CUBE_VERT_PER_OBJ*3)
414 #define CUBE_VERT_PER_OBJ_TRI (CUBE_VERT_PER_OBJ+CUBE_NUM_FACES*2) /* 2 extra edges per face when drawing quads as triangles */
415 /* Vertex Coordinates */
416 static GLfloat cube_v[CUBE_NUM_VERT*3] =
428 static GLfloat cube_n[CUBE_NUM_FACES*3] =
438 /* Vertex indices, as quads, before triangulation */
439 static GLubyte cube_vi[CUBE_VERT_PER_OBJ] =
448 DECLARE_SHAPE_CACHE_DECOMPOSE_TO_TRIANGLE(cube,Cube,CUBE)
450 /* -- Dodecahedron -- */
451 /* Magic Numbers: It is possible to create a dodecahedron by attaching two
452 * pentagons to each face of of a cube. The coordinates of the points are:
453 * (+-x,0, z); (+-1, 1, 1); (0, z, x )
454 * where x = (-1 + sqrt(5))/2, z = (1 + sqrt(5))/2 or
455 * x = 0.61803398875 and z = 1.61803398875.
457 #define DODECAHEDRON_NUM_VERT 20
458 #define DODECAHEDRON_NUM_FACES 12
459 #define DODECAHEDRON_NUM_EDGE_PER_FACE 5
460 #define DODECAHEDRON_VERT_PER_OBJ (DODECAHEDRON_NUM_FACES*DODECAHEDRON_NUM_EDGE_PER_FACE)
461 #define DODECAHEDRON_VERT_ELEM_PER_OBJ (DODECAHEDRON_VERT_PER_OBJ*3)
462 #define DODECAHEDRON_VERT_PER_OBJ_TRI (DODECAHEDRON_VERT_PER_OBJ+DODECAHEDRON_NUM_FACES*4) /* 4 extra edges per face when drawing pentagons as triangles */
463 /* Vertex Coordinates */
464 static GLfloat dodecahedron_v[DODECAHEDRON_NUM_VERT*3] =
466 0.0f, 1.61803398875f, 0.61803398875f,
468 -0.61803398875f, 0.0f, 1.61803398875f,
469 0.61803398875f, 0.0f, 1.61803398875f,
471 0.0f, 1.61803398875f, -0.61803398875f,
473 0.61803398875f, 0.0f, -1.61803398875f,
474 -0.61803398875f, 0.0f, -1.61803398875f,
475 - 1.0f, 1.0f, - 1.0f,
476 0.0f, -1.61803398875f, 0.61803398875f,
478 - 1.0f, - 1.0f, 1.0f,
479 0.0f, -1.61803398875f, -0.61803398875f,
480 - 1.0f, - 1.0f, - 1.0f,
481 1.0f, - 1.0f, - 1.0f,
482 1.61803398875f, -0.61803398875f, 0.0f,
483 1.61803398875f, 0.61803398875f, 0.0f,
484 -1.61803398875f, 0.61803398875f, 0.0f,
485 -1.61803398875f, -0.61803398875f, 0.0f
488 static GLfloat dodecahedron_n[DODECAHEDRON_NUM_FACES*3] =
490 0.0f, 0.525731112119f, 0.850650808354f,
491 0.0f, 0.525731112119f, -0.850650808354f,
492 0.0f, -0.525731112119f, 0.850650808354f,
493 0.0f, -0.525731112119f, -0.850650808354f,
495 0.850650808354f, 0.0f, 0.525731112119f,
496 -0.850650808354f, 0.0f, 0.525731112119f,
497 0.850650808354f, 0.0f, -0.525731112119f,
498 -0.850650808354f, 0.0f, -0.525731112119f,
500 0.525731112119f, 0.850650808354f, 0.0f,
501 0.525731112119f, -0.850650808354f, 0.0f,
502 -0.525731112119f, 0.850650808354f, 0.0f,
503 -0.525731112119f, -0.850650808354f, 0.0f,
507 static GLubyte dodecahedron_vi[DODECAHEDRON_VERT_PER_OBJ] =
524 DECLARE_SHAPE_CACHE_DECOMPOSE_TO_TRIANGLE(dodecahedron,Dodecahedron,DODECAHEDRON)
527 /* -- Icosahedron -- */
528 #define ICOSAHEDRON_NUM_VERT 12
529 #define ICOSAHEDRON_NUM_FACES 20
530 #define ICOSAHEDRON_NUM_EDGE_PER_FACE 3
531 #define ICOSAHEDRON_VERT_PER_OBJ (ICOSAHEDRON_NUM_FACES*ICOSAHEDRON_NUM_EDGE_PER_FACE)
532 #define ICOSAHEDRON_VERT_ELEM_PER_OBJ (ICOSAHEDRON_VERT_PER_OBJ*3)
533 #define ICOSAHEDRON_VERT_PER_OBJ_TRI ICOSAHEDRON_VERT_PER_OBJ
534 /* Vertex Coordinates */
535 static GLfloat icosahedron_v[ICOSAHEDRON_NUM_VERT*3] =
538 0.447213595500f, 0.894427191000f, 0.0f,
539 0.447213595500f, 0.276393202252f, 0.850650808354f,
540 0.447213595500f, -0.723606797748f, 0.525731112119f,
541 0.447213595500f, -0.723606797748f, -0.525731112119f,
542 0.447213595500f, 0.276393202252f, -0.850650808354f,
543 -0.447213595500f, -0.894427191000f, 0.0f,
544 -0.447213595500f, -0.276393202252f, 0.850650808354f,
545 -0.447213595500f, 0.723606797748f, 0.525731112119f,
546 -0.447213595500f, 0.723606797748f, -0.525731112119f,
547 -0.447213595500f, -0.276393202252f, -0.850650808354f,
551 * icosahedron_n[i][0] = ( icosahedron_v[icosahedron_vi[i][1]][1] - icosahedron_v[icosahedron_vi[i][0]][1] ) * ( icosahedron_v[icosahedron_vi[i][2]][2] - icosahedron_v[icosahedron_vi[i][0]][2] ) - ( icosahedron_v[icosahedron_vi[i][1]][2] - icosahedron_v[icosahedron_vi[i][0]][2] ) * ( icosahedron_v[icosahedron_vi[i][2]][1] - icosahedron_v[icosahedron_vi[i][0]][1] ) ;
552 * icosahedron_n[i][1] = ( icosahedron_v[icosahedron_vi[i][1]][2] - icosahedron_v[icosahedron_vi[i][0]][2] ) * ( icosahedron_v[icosahedron_vi[i][2]][0] - icosahedron_v[icosahedron_vi[i][0]][0] ) - ( icosahedron_v[icosahedron_vi[i][1]][0] - icosahedron_v[icosahedron_vi[i][0]][0] ) * ( icosahedron_v[icosahedron_vi[i][2]][2] - icosahedron_v[icosahedron_vi[i][0]][2] ) ;
553 * icosahedron_n[i][2] = ( icosahedron_v[icosahedron_vi[i][1]][0] - icosahedron_v[icosahedron_vi[i][0]][0] ) * ( icosahedron_v[icosahedron_vi[i][2]][1] - icosahedron_v[icosahedron_vi[i][0]][1] ) - ( icosahedron_v[icosahedron_vi[i][1]][1] - icosahedron_v[icosahedron_vi[i][0]][1] ) * ( icosahedron_v[icosahedron_vi[i][2]][0] - icosahedron_v[icosahedron_vi[i][0]][0] ) ;
555 static GLfloat icosahedron_n[ICOSAHEDRON_NUM_FACES*3] =
557 0.760845213037948f, 0.470228201835026f, 0.341640786498800f,
558 0.760845213036861f, -0.179611190632978f, 0.552786404500000f,
559 0.760845213033849f, -0.581234022404097f, 0.0f,
560 0.760845213036861f, -0.179611190632978f, -0.552786404500000f,
561 0.760845213037948f, 0.470228201835026f, -0.341640786498800f,
562 0.179611190628666f, 0.760845213037948f, 0.552786404498399f,
563 0.179611190634277f, -0.290617011204044f, 0.894427191000000f,
564 0.179611190633958f, -0.940456403667806f, 0.0f,
565 0.179611190634278f, -0.290617011204044f, -0.894427191000000f,
566 0.179611190628666f, 0.760845213037948f, -0.552786404498399f,
567 -0.179611190633958f, 0.940456403667806f, 0.0f,
568 -0.179611190634277f, 0.290617011204044f, 0.894427191000000f,
569 -0.179611190628666f, -0.760845213037948f, 0.552786404498399f,
570 -0.179611190628666f, -0.760845213037948f, -0.552786404498399f,
571 -0.179611190634277f, 0.290617011204044f, -0.894427191000000f,
572 -0.760845213036861f, 0.179611190632978f, -0.552786404500000f,
573 -0.760845213033849f, 0.581234022404097f, 0.0f,
574 -0.760845213036861f, 0.179611190632978f, 0.552786404500000f,
575 -0.760845213037948f, -0.470228201835026f, 0.341640786498800f,
576 -0.760845213037948f, -0.470228201835026f, -0.341640786498800f,
580 static GLubyte icosahedron_vi[ICOSAHEDRON_VERT_PER_OBJ] =
603 DECLARE_SHAPE_CACHE(icosahedron,Icosahedron,ICOSAHEDRON)
605 /* -- Octahedron -- */
606 #define OCTAHEDRON_NUM_VERT 6
607 #define OCTAHEDRON_NUM_FACES 8
608 #define OCTAHEDRON_NUM_EDGE_PER_FACE 3
609 #define OCTAHEDRON_VERT_PER_OBJ (OCTAHEDRON_NUM_FACES*OCTAHEDRON_NUM_EDGE_PER_FACE)
610 #define OCTAHEDRON_VERT_ELEM_PER_OBJ (OCTAHEDRON_VERT_PER_OBJ*3)
611 #define OCTAHEDRON_VERT_PER_OBJ_TRI OCTAHEDRON_VERT_PER_OBJ
613 /* Vertex Coordinates */
614 static GLfloat octahedron_v[OCTAHEDRON_NUM_VERT*3] =
625 static GLfloat octahedron_n[OCTAHEDRON_NUM_FACES*3] =
627 0.577350269189f, 0.577350269189f, 0.577350269189f, /* sqrt(1/3) */
628 0.577350269189f, 0.577350269189f,-0.577350269189f,
629 0.577350269189f,-0.577350269189f, 0.577350269189f,
630 0.577350269189f,-0.577350269189f,-0.577350269189f,
631 -0.577350269189f, 0.577350269189f, 0.577350269189f,
632 -0.577350269189f, 0.577350269189f,-0.577350269189f,
633 -0.577350269189f,-0.577350269189f, 0.577350269189f,
634 -0.577350269189f,-0.577350269189f,-0.577350269189f
639 static GLubyte octahedron_vi[OCTAHEDRON_VERT_PER_OBJ] =
650 DECLARE_SHAPE_CACHE(octahedron,Octahedron,OCTAHEDRON)
652 /* -- RhombicDodecahedron -- */
653 #define RHOMBICDODECAHEDRON_NUM_VERT 14
654 #define RHOMBICDODECAHEDRON_NUM_FACES 12
655 #define RHOMBICDODECAHEDRON_NUM_EDGE_PER_FACE 4
656 #define RHOMBICDODECAHEDRON_VERT_PER_OBJ (RHOMBICDODECAHEDRON_NUM_FACES*RHOMBICDODECAHEDRON_NUM_EDGE_PER_FACE)
657 #define RHOMBICDODECAHEDRON_VERT_ELEM_PER_OBJ (RHOMBICDODECAHEDRON_VERT_PER_OBJ*3)
658 #define RHOMBICDODECAHEDRON_VERT_PER_OBJ_TRI (RHOMBICDODECAHEDRON_VERT_PER_OBJ+RHOMBICDODECAHEDRON_NUM_FACES*2) /* 2 extra edges per face when drawing quads as triangles */
660 /* Vertex Coordinates */
661 static GLfloat rhombicdodecahedron_v[RHOMBICDODECAHEDRON_NUM_VERT*3] =
664 0.707106781187f, 0.0f, 0.5f,
665 0.0f, 0.707106781187f, 0.5f,
666 -0.707106781187f, 0.0f, 0.5f,
667 0.0f, -0.707106781187f, 0.5f,
668 0.707106781187f, 0.707106781187f, 0.0f,
669 -0.707106781187f, 0.707106781187f, 0.0f,
670 -0.707106781187f, -0.707106781187f, 0.0f,
671 0.707106781187f, -0.707106781187f, 0.0f,
672 0.707106781187f, 0.0f, -0.5f,
673 0.0f, 0.707106781187f, -0.5f,
674 -0.707106781187f, 0.0f, -0.5f,
675 0.0f, -0.707106781187f, -0.5f,
679 static GLfloat rhombicdodecahedron_n[RHOMBICDODECAHEDRON_NUM_FACES*3] =
681 0.353553390594f, 0.353553390594f, 0.5f,
682 -0.353553390594f, 0.353553390594f, 0.5f,
683 -0.353553390594f, -0.353553390594f, 0.5f,
684 0.353553390594f, -0.353553390594f, 0.5f,
689 0.353553390594f, 0.353553390594f, -0.5f,
690 -0.353553390594f, 0.353553390594f, -0.5f,
691 -0.353553390594f, -0.353553390594f, -0.5f,
692 0.353553390594f, -0.353553390594f, -0.5f
696 static GLubyte rhombicdodecahedron_vi[RHOMBICDODECAHEDRON_VERT_PER_OBJ] =
711 DECLARE_SHAPE_CACHE_DECOMPOSE_TO_TRIANGLE(rhombicdodecahedron,RhombicDodecahedron,RHOMBICDODECAHEDRON)
713 /* -- Tetrahedron -- */
714 /* Magic Numbers: r0 = ( 1, 0, 0 )
715 * r1 = ( -1/3, 2 sqrt(2) / 3, 0 )
716 * r2 = ( -1/3, - sqrt(2) / 3, sqrt(6) / 3 )
717 * r3 = ( -1/3, - sqrt(2) / 3, -sqrt(6) / 3 )
718 * |r0| = |r1| = |r2| = |r3| = 1
719 * Distance between any two points is 2 sqrt(6) / 3
721 * Normals: The unit normals are simply the negative of the coordinates of the point not on the surface.
723 #define TETRAHEDRON_NUM_VERT 4
724 #define TETRAHEDRON_NUM_FACES 4
725 #define TETRAHEDRON_NUM_EDGE_PER_FACE 3
726 #define TETRAHEDRON_VERT_PER_OBJ (TETRAHEDRON_NUM_FACES*TETRAHEDRON_NUM_EDGE_PER_FACE)
727 #define TETRAHEDRON_VERT_ELEM_PER_OBJ (TETRAHEDRON_VERT_PER_OBJ*3)
728 #define TETRAHEDRON_VERT_PER_OBJ_TRI TETRAHEDRON_VERT_PER_OBJ
730 /* Vertex Coordinates */
731 static GLfloat tetrahedron_v[TETRAHEDRON_NUM_VERT*3] =
734 -0.333333333333f, 0.942809041582f, 0.0f,
735 -0.333333333333f, -0.471404520791f, 0.816496580928f,
736 -0.333333333333f, -0.471404520791f, -0.816496580928f
739 static GLfloat tetrahedron_n[TETRAHEDRON_NUM_FACES*3] =
742 0.333333333333f, -0.942809041582f, 0.0f,
743 0.333333333333f, 0.471404520791f, -0.816496580928f,
744 0.333333333333f, 0.471404520791f, 0.816496580928f
748 static GLubyte tetrahedron_vi[TETRAHEDRON_VERT_PER_OBJ] =
755 DECLARE_SHAPE_CACHE(tetrahedron,Tetrahedron,TETRAHEDRON)
757 /* -- Sierpinski Sponge -- */
758 static unsigned int ipow (int x, unsigned int y)
760 return y==0? 1: y==1? x: (y%2? x: 1) * ipow(x*x, y/2);
763 static void fghSierpinskiSpongeGenerate ( int numLevels, double offset[3], GLfloat scale, GLfloat* vertices, GLfloat* normals )
766 if ( numLevels == 0 )
768 for (i=0; i<TETRAHEDRON_NUM_FACES; i++)
771 int faceIdxVertIdx = i*TETRAHEDRON_NUM_EDGE_PER_FACE;
772 for (j=0; j<TETRAHEDRON_NUM_EDGE_PER_FACE; j++)
774 int outIdx = i*TETRAHEDRON_NUM_EDGE_PER_FACE*3+j*3;
775 int vertIdx = tetrahedron_vi[faceIdxVertIdx+j]*3;
777 vertices[outIdx ] = (GLfloat)offset[0] + scale * tetrahedron_v[vertIdx ];
778 vertices[outIdx+1] = (GLfloat)offset[1] + scale * tetrahedron_v[vertIdx+1];
779 vertices[outIdx+2] = (GLfloat)offset[2] + scale * tetrahedron_v[vertIdx+2];
781 normals [outIdx ] = tetrahedron_n[normIdx ];
782 normals [outIdx+1] = tetrahedron_n[normIdx+1];
783 normals [outIdx+2] = tetrahedron_n[normIdx+2];
787 else if ( numLevels > 0 )
789 double local_offset[3] ; /* Use a local variable to avoid buildup of roundoff errors */
790 unsigned int stride = ipow(4,--numLevels)*TETRAHEDRON_VERT_ELEM_PER_OBJ;
792 for ( i = 0 ; i < TETRAHEDRON_NUM_FACES ; i++ )
795 local_offset[0] = offset[0] + scale * tetrahedron_v[idx ];
796 local_offset[1] = offset[1] + scale * tetrahedron_v[idx+1];
797 local_offset[2] = offset[2] + scale * tetrahedron_v[idx+2];
798 fghSierpinskiSpongeGenerate ( numLevels, local_offset, scale, vertices+i*stride, normals+i*stride );
803 /* -- Now the various shapes involving circles -- */
805 * Compute lookup table of cos and sin values forming a circle
806 * (or half circle if halfCircle==TRUE)
809 * It is the responsibility of the caller to free these tables
810 * The size of the table is (n+1) to form a connected loop
811 * The last entry is exactly the same as the first
812 * The sign of n can be flipped to get the reverse loop
814 static void fghCircleTable(GLfloat **sint, GLfloat **cost, const int n, const GLboolean halfCircle)
818 /* Table size, the sign of n flips the circle direction */
819 const int size = abs(n);
821 /* Determine the angle between samples */
822 const GLfloat angle = (halfCircle?1:2)*(GLfloat)M_PI/(GLfloat)( ( n == 0 ) ? 1 : n );
824 /* Allocate memory for n samples, plus duplicate of first entry at the end */
825 *sint = malloc(sizeof(GLfloat) * (size+1));
826 *cost = malloc(sizeof(GLfloat) * (size+1));
828 /* Bail out if memory allocation fails, fgError never returns */
829 if (!(*sint) || !(*cost))
833 fgError("Failed to allocate memory in fghCircleTable");
836 /* Compute cos and sin around the circle */
840 for (i=1; i<size; i++)
842 (*sint)[i] = sinf(angle*i);
843 (*cost)[i] = cosf(angle*i);
849 (*sint)[size] = 0.0f; /* sin PI */
850 (*cost)[size] = -1.0f; /* cos PI */
854 /* Last sample is duplicate of the first (sin or cos of 2 PI) */
855 (*sint)[size] = (*sint)[0];
856 (*cost)[size] = (*cost)[0];
860 static void fghGenerateSphere(GLfloat radius, GLint slices, GLint stacks, GLfloat **vertices, GLfloat **normals, int* nVert)
863 int idx = 0; /* idx into vertex/normal buffer */
866 /* Pre-computed circle */
867 GLfloat *sint1,*cost1;
868 GLfloat *sint2,*cost2;
870 /* number of unique vertices */
871 if (slices==0 || stacks<2)
873 /* nothing to generate */
877 *nVert = slices*(stacks-1)+2;
878 if ((*nVert) > 65535) /* TODO: must have a better solution than this low limit, at least for architectures where gluint is available */
879 fgWarning("fghGenerateSphere: too many slices or stacks requested, indices will wrap");
881 /* precompute values on unit circle */
882 fghCircleTable(&sint1,&cost1,-slices,FALSE);
883 fghCircleTable(&sint2,&cost2, stacks,TRUE);
885 /* Allocate vertex and normal buffers, bail out if memory allocation fails */
886 *vertices = malloc((*nVert)*3*sizeof(GLfloat));
887 *normals = malloc((*nVert)*3*sizeof(GLfloat));
888 if (!(*vertices) || !(*normals))
892 fgError("Failed to allocate memory in fghGenerateSphere");
896 (*vertices)[0] = 0.f;
897 (*vertices)[1] = 0.f;
898 (*vertices)[2] = radius;
899 (*normals )[0] = 0.f;
900 (*normals )[1] = 0.f;
901 (*normals )[2] = 1.f;
905 for( i=1; i<stacks; i++ )
907 for(j=0; j<slices; j++, idx+=3)
909 x = cost1[j]*sint2[i];
910 y = sint1[j]*sint2[i];
913 (*vertices)[idx ] = x*radius;
914 (*vertices)[idx+1] = y*radius;
915 (*vertices)[idx+2] = z*radius;
916 (*normals )[idx ] = x;
917 (*normals )[idx+1] = y;
918 (*normals )[idx+2] = z;
923 (*vertices)[idx ] = 0.f;
924 (*vertices)[idx+1] = 0.f;
925 (*vertices)[idx+2] = -radius;
926 (*normals )[idx ] = 0.f;
927 (*normals )[idx+1] = 0.f;
928 (*normals )[idx+2] = -1.f;
930 /* Done creating vertices, release sin and cos tables */
937 void fghGenerateCone(
938 GLfloat base, GLfloat height, GLint slices, GLint stacks, /* input */
939 GLfloat **vertices, GLfloat **normals, int* nVert /* output */
943 int idx = 0; /* idx into vertex/normal buffer */
945 /* Pre-computed circle */
948 /* Step in z and radius as stacks are drawn. */
950 GLfloat r = (GLfloat)base;
952 const GLfloat zStep = (GLfloat)height / ( ( stacks > 0 ) ? stacks : 1 );
953 const GLfloat rStep = (GLfloat)base / ( ( stacks > 0 ) ? stacks : 1 );
955 /* Scaling factors for vertex normals */
956 const GLfloat cosn = ( (GLfloat)height / sqrtf( height * height + base * base ));
957 const GLfloat sinn = ( (GLfloat)base / sqrtf( height * height + base * base ));
961 /* number of unique vertices */
962 if (slices==0 || stacks<1)
964 /* nothing to generate */
968 *nVert = slices*(stacks+2)+1; /* need an extra stack for closing off bottom with correct normals */
970 if ((*nVert) > 65535)
971 fgWarning("fghGenerateCone: too many slices or stacks requested, indices will wrap");
973 /* Pre-computed circle */
974 fghCircleTable(&sint,&cost,-slices,FALSE);
976 /* Allocate vertex and normal buffers, bail out if memory allocation fails */
977 *vertices = malloc((*nVert)*3*sizeof(GLfloat));
978 *normals = malloc((*nVert)*3*sizeof(GLfloat));
979 if (!(*vertices) || !(*normals))
983 fgError("Failed to allocate memory in fghGenerateSphere");
987 (*vertices)[0] = 0.f;
988 (*vertices)[1] = 0.f;
990 (*normals )[0] = 0.f;
991 (*normals )[1] = 0.f;
992 (*normals )[2] = -1.f;
994 /* other on bottom (get normals right) */
995 for (j=0; j<slices; j++, idx+=3)
997 (*vertices)[idx ] = cost[j]*r;
998 (*vertices)[idx+1] = sint[j]*r;
999 (*vertices)[idx+2] = z;
1000 (*normals )[idx ] = 0.f;
1001 (*normals )[idx+1] = 0.f;
1002 (*normals )[idx+2] = -1.f;
1006 for (i=0; i<stacks+1; i++ )
1008 for (j=0; j<slices; j++, idx+=3)
1010 (*vertices)[idx ] = cost[j]*r;
1011 (*vertices)[idx+1] = sint[j]*r;
1012 (*vertices)[idx+2] = z;
1013 (*normals )[idx ] = cost[j]*sinn;
1014 (*normals )[idx+1] = sint[j]*sinn;
1015 (*normals )[idx+2] = cosn;
1022 /* Release sin and cos tables */
1027 void fghGenerateCylinder(
1028 GLfloat radius, GLfloat height, GLint slices, GLint stacks, /* input */
1029 GLfloat **vertices, GLfloat **normals, int* nVert /* output */
1033 int idx = 0; /* idx into vertex/normal buffer */
1035 /* Step in z as stacks are drawn. */
1036 GLfloat radf = (GLfloat)radius;
1038 const GLfloat zStep = (GLfloat)height / ( ( stacks > 0 ) ? stacks : 1 );
1040 /* Pre-computed circle */
1041 GLfloat *sint,*cost;
1043 /* number of unique vertices */
1044 if (slices==0 || stacks<1)
1046 /* nothing to generate */
1050 *nVert = slices*(stacks+3)+2; /* need two extra stacks for closing off top and bottom with correct normals */
1052 if ((*nVert) > 65535)
1053 fgWarning("fghGenerateCylinder: too many slices or stacks requested, indices will wrap");
1055 /* Pre-computed circle */
1056 fghCircleTable(&sint,&cost,-slices,FALSE);
1058 /* Allocate vertex and normal buffers, bail out if memory allocation fails */
1059 *vertices = malloc((*nVert)*3*sizeof(GLfloat));
1060 *normals = malloc((*nVert)*3*sizeof(GLfloat));
1061 if (!(*vertices) || !(*normals))
1065 fgError("Failed to allocate memory in fghGenerateCylinder");
1070 (*vertices)[0] = 0.f;
1071 (*vertices)[1] = 0.f;
1072 (*vertices)[2] = 0.f;
1073 (*normals )[0] = 0.f;
1074 (*normals )[1] = 0.f;
1075 (*normals )[2] = -1.f;
1077 /* other on top (get normals right) */
1078 for (j=0; j<slices; j++, idx+=3)
1080 (*vertices)[idx ] = cost[j]*radf;
1081 (*vertices)[idx+1] = sint[j]*radf;
1082 (*vertices)[idx+2] = z;
1083 (*normals )[idx ] = 0.f;
1084 (*normals )[idx+1] = 0.f;
1085 (*normals )[idx+2] = -1.f;
1089 for (i=0; i<stacks+1; i++ )
1091 for (j=0; j<slices; j++, idx+=3)
1093 (*vertices)[idx ] = cost[j]*radf;
1094 (*vertices)[idx+1] = sint[j]*radf;
1095 (*vertices)[idx+2] = z;
1096 (*normals )[idx ] = cost[j];
1097 (*normals )[idx+1] = sint[j];
1098 (*normals )[idx+2] = 0.f;
1104 /* other on bottom (get normals right) */
1106 for (j=0; j<slices; j++, idx+=3)
1108 (*vertices)[idx ] = cost[j]*radf;
1109 (*vertices)[idx+1] = sint[j]*radf;
1110 (*vertices)[idx+2] = z;
1111 (*normals )[idx ] = 0.f;
1112 (*normals )[idx+1] = 0.f;
1113 (*normals )[idx+2] = 1.f;
1117 (*vertices)[idx ] = 0.f;
1118 (*vertices)[idx+1] = 0.f;
1119 (*vertices)[idx+2] = height;
1120 (*normals )[idx ] = 0.f;
1121 (*normals )[idx+1] = 0.f;
1122 (*normals )[idx+2] = 1.f;
1124 /* Release sin and cos tables */
1129 void fghGenerateTorus(
1130 double dInnerRadius, double dOuterRadius, GLint nSides, GLint nRings, /* input */
1131 GLfloat **vertices, GLfloat **normals, int* nVert /* output */
1134 GLfloat iradius = (float)dInnerRadius;
1135 GLfloat oradius = (float)dOuterRadius;
1138 /* Pre-computed circle */
1139 GLfloat *spsi, *cpsi;
1140 GLfloat *sphi, *cphi;
1142 /* number of unique vertices */
1143 if (nSides<2 || nRings<2)
1145 /* nothing to generate */
1149 *nVert = nSides * nRings;
1151 if ((*nVert) > 65535)
1152 fgWarning("fghGenerateTorus: too many slices or stacks requested, indices will wrap");
1154 /* precompute values on unit circle */
1155 fghCircleTable(&spsi,&cpsi, nRings,FALSE);
1156 fghCircleTable(&sphi,&cphi,-nSides,FALSE);
1158 /* Allocate vertex and normal buffers, bail out if memory allocation fails */
1159 *vertices = malloc((*nVert)*3*sizeof(GLfloat));
1160 *normals = malloc((*nVert)*3*sizeof(GLfloat));
1161 if (!(*vertices) || !(*normals))
1165 fgError("Failed to allocate memory in fghGenerateTorus");
1168 for( j=0; j<nRings; j++ )
1170 for( i=0; i<nSides; i++ )
1172 int offset = 3 * ( j * nSides + i ) ;
1174 (*vertices)[offset ] = cpsi[j] * ( oradius + cphi[i] * iradius ) ;
1175 (*vertices)[offset+1] = spsi[j] * ( oradius + cphi[i] * iradius ) ;
1176 (*vertices)[offset+2] = sphi[i] * iradius ;
1177 (*normals )[offset ] = cpsi[j] * cphi[i] ;
1178 (*normals )[offset+1] = spsi[j] * cphi[i] ;
1179 (*normals )[offset+2] = sphi[i] ;
1183 /* Release sin and cos tables */
1190 /* -- INTERNAL DRAWING functions --------------------------------------- */
1191 #define _DECLARE_INTERNAL_DRAW_DO_DECLARE(name,nameICaps,nameCaps,vertIdxs)\
1192 static void fgh##nameICaps( GLboolean useWireMode )\
1196 fgh##nameICaps##Generate();\
1197 name##Cached = GL_TRUE;\
1202 fghDrawGeometryWire (name##_verts,name##_norms,\
1203 NULL,nameCaps##_NUM_FACES,nameCaps##_NUM_EDGE_PER_FACE,GL_LINE_LOOP,\
1208 fghDrawGeometrySolid(name##_verts,name##_norms,vertIdxs,\
1209 nameCaps##_VERT_PER_OBJ, 1, nameCaps##_VERT_PER_OBJ_TRI); \
1212 #define DECLARE_INTERNAL_DRAW(name,nameICaps,nameCaps) _DECLARE_INTERNAL_DRAW_DO_DECLARE(name,nameICaps,nameCaps,NULL)
1213 #define DECLARE_INTERNAL_DRAW_DECOMPOSED_TO_TRIANGLE(name,nameICaps,nameCaps) _DECLARE_INTERNAL_DRAW_DO_DECLARE(name,nameICaps,nameCaps,name##_vertIdxs)
1215 static void fghCube( GLfloat dSize, GLboolean useWireMode )
1222 cubeCached = GL_TRUE;
1227 /* Need to build new vertex list containing vertices for cube of different size */
1230 vertices = malloc(CUBE_VERT_ELEM_PER_OBJ * sizeof(GLfloat));
1232 /* Bail out if memory allocation fails, fgError never returns */
1236 fgError("Failed to allocate memory in fghCube");
1239 for (i=0; i<CUBE_VERT_ELEM_PER_OBJ; i++)
1240 vertices[i] = dSize*cube_verts[i];
1243 vertices = cube_verts;
1246 fghDrawGeometryWire(vertices, cube_norms,
1247 NULL,CUBE_NUM_FACES, CUBE_NUM_EDGE_PER_FACE,GL_LINE_LOOP,
1250 fghDrawGeometrySolid(vertices, cube_norms, cube_vertIdxs,
1251 CUBE_VERT_PER_OBJ, 1, CUBE_VERT_PER_OBJ_TRI);
1254 /* cleanup allocated memory */
1258 DECLARE_INTERNAL_DRAW_DECOMPOSED_TO_TRIANGLE(dodecahedron,Dodecahedron,DODECAHEDRON)
1259 DECLARE_INTERNAL_DRAW(icosahedron,Icosahedron,ICOSAHEDRON)
1260 DECLARE_INTERNAL_DRAW(octahedron,Octahedron,OCTAHEDRON)
1261 DECLARE_INTERNAL_DRAW_DECOMPOSED_TO_TRIANGLE(rhombicdodecahedron,RhombicDodecahedron,RHOMBICDODECAHEDRON)
1262 DECLARE_INTERNAL_DRAW(tetrahedron,Tetrahedron,TETRAHEDRON)
1264 static void fghSierpinskiSponge ( int numLevels, double offset[3], GLfloat scale, GLboolean useWireMode )
1268 GLsizei numTetr = numLevels<0? 0 : ipow(4,numLevels); /* No sponge for numLevels below 0 */
1269 GLsizei numVert = numTetr*TETRAHEDRON_VERT_PER_OBJ;
1270 GLsizei numFace = numTetr*TETRAHEDRON_NUM_FACES;
1274 /* Allocate memory */
1275 vertices = malloc(numVert*3 * sizeof(GLfloat));
1276 normals = malloc(numVert*3 * sizeof(GLfloat));
1277 /* Bail out if memory allocation fails, fgError never returns */
1278 if (!vertices || !normals)
1282 fgError("Failed to allocate memory in fghSierpinskiSponge");
1285 /* Generate elements */
1286 fghSierpinskiSpongeGenerate ( numLevels, offset, scale, vertices, normals );
1288 /* Draw and cleanup */
1290 fghDrawGeometryWire (vertices,normals,
1291 NULL,numFace,TETRAHEDRON_NUM_EDGE_PER_FACE,GL_LINE_LOOP,
1294 fghDrawGeometrySolid(vertices,normals,NULL,numVert,1,0);
1302 static void fghSphere( double radius, GLint slices, GLint stacks, GLboolean useWireMode )
1305 GLfloat *vertices, *normals;
1307 /* Generate vertices and normals */
1308 fghGenerateSphere((GLfloat)radius,slices,stacks,&vertices,&normals,&nVert);
1311 /* nothing to draw */
1316 GLushort *sliceIdx, *stackIdx;
1317 /* First, generate vertex index arrays for drawing with glDrawElements
1318 * We have a bunch of line_loops to draw for each stack, and a
1319 * bunch for each slice.
1322 sliceIdx = malloc(slices*(stacks+1)*sizeof(GLushort));
1323 stackIdx = malloc(slices*(stacks-1)*sizeof(GLushort));
1324 if (!(stackIdx) || !(sliceIdx))
1328 fgError("Failed to allocate memory in fghSphere");
1331 /* generate for each stack */
1332 for (i=0,idx=0; i<stacks-1; i++)
1334 GLushort offset = 1+i*slices; /* start at 1 (0 is top vertex), and we advance one stack down as we go along */
1335 for (j=0; j<slices; j++, idx++)
1337 stackIdx[idx] = offset+j;
1341 /* generate for each slice */
1342 for (i=0,idx=0; i<slices; i++)
1344 GLushort offset = 1+i; /* start at 1 (0 is top vertex), and we advance one slice as we go along */
1345 sliceIdx[idx++] = 0; /* vertex on top */
1346 for (j=0; j<stacks-1; j++, idx++)
1348 sliceIdx[idx] = offset+j*slices;
1350 sliceIdx[idx++] = nVert-1; /* zero based index, last element in array... */
1354 fghDrawGeometryWire(vertices,normals,
1355 sliceIdx,slices,stacks+1,GL_LINE_STRIP,
1356 stackIdx,stacks-1,slices);
1358 /* cleanup allocated memory */
1364 /* First, generate vertex index arrays for drawing with glDrawElements
1365 * All stacks, including top and bottom are covered with a triangle
1369 /* Create index vector */
1372 /* Allocate buffers for indices, bail out if memory allocation fails */
1373 stripIdx = malloc((slices+1)*2*(stacks)*sizeof(GLushort));
1377 fgError("Failed to allocate memory in fghSphere");
1381 for (j=0, idx=0; j<slices; j++, idx+=2)
1383 stripIdx[idx ] = j+1; /* 0 is top vertex, 1 is first for first stack */
1384 stripIdx[idx+1] = 0;
1386 stripIdx[idx ] = 1; /* repeat first slice's idx for closing off shape */
1387 stripIdx[idx+1] = 0;
1390 /* middle stacks: */
1391 /* Strip indices are relative to first index belonging to strip, NOT relative to first vertex/normal pair in array */
1392 for (i=0; i<stacks-2; i++, idx+=2)
1394 offset = 1+i*slices; /* triangle_strip indices start at 1 (0 is top vertex), and we advance one stack down as we go along */
1395 for (j=0; j<slices; j++, idx+=2)
1397 stripIdx[idx ] = offset+j+slices;
1398 stripIdx[idx+1] = offset+j;
1400 stripIdx[idx ] = offset+slices; /* repeat first slice's idx for closing off shape */
1401 stripIdx[idx+1] = offset;
1405 offset = 1+(stacks-2)*slices; /* triangle_strip indices start at 1 (0 is top vertex), and we advance one stack down as we go along */
1406 for (j=0; j<slices; j++, idx+=2)
1408 stripIdx[idx ] = nVert-1; /* zero based index, last element in array (bottom vertex)... */
1409 stripIdx[idx+1] = offset+j;
1411 stripIdx[idx ] = nVert-1; /* repeat first slice's idx for closing off shape */
1412 stripIdx[idx+1] = offset;
1416 fghDrawGeometrySolid(vertices,normals,stripIdx,nVert,stacks,(slices+1)*2);
1418 /* cleanup allocated memory */
1422 /* cleanup allocated memory */
1427 static void fghCone( double base, double height, GLint slices, GLint stacks, GLboolean useWireMode )
1430 GLfloat *vertices, *normals;
1432 /* Generate vertices and normals */
1433 /* Note, (stacks+1)*slices vertices for side of object, slices+1 for top and bottom closures */
1434 fghGenerateCone((GLfloat)base,(GLfloat)height,slices,stacks,&vertices,&normals,&nVert);
1437 /* nothing to draw */
1442 GLushort *sliceIdx, *stackIdx;
1443 /* First, generate vertex index arrays for drawing with glDrawElements
1444 * We have a bunch of line_loops to draw for each stack, and a
1445 * bunch for each slice.
1448 stackIdx = malloc(slices*stacks*sizeof(GLushort));
1449 sliceIdx = malloc(slices*2 *sizeof(GLushort));
1450 if (!(stackIdx) || !(sliceIdx))
1454 fgError("Failed to allocate memory in fghCone");
1457 /* generate for each stack */
1458 for (i=0,idx=0; i<stacks; i++)
1460 GLushort offset = 1+(i+1)*slices; /* start at 1 (0 is top vertex), and we advance one stack down as we go along */
1461 for (j=0; j<slices; j++, idx++)
1463 stackIdx[idx] = offset+j;
1467 /* generate for each slice */
1468 for (i=0,idx=0; i<slices; i++)
1470 GLushort offset = 1+i; /* start at 1 (0 is top vertex), and we advance one slice as we go along */
1471 sliceIdx[idx++] = offset+slices;
1472 sliceIdx[idx++] = offset+(stacks+1)*slices;
1476 fghDrawGeometryWire(vertices,normals,
1477 sliceIdx,1,slices*2,GL_LINES,
1478 stackIdx,stacks,slices);
1480 /* cleanup allocated memory */
1486 /* First, generate vertex index arrays for drawing with glDrawElements
1487 * All stacks, including top and bottom are covered with a triangle
1491 /* Create index vector */
1494 /* Allocate buffers for indices, bail out if memory allocation fails */
1495 stripIdx = malloc((slices+1)*2*(stacks+1)*sizeof(GLushort)); /*stacks +1 because of closing off bottom */
1499 fgError("Failed to allocate memory in fghCone");
1503 for (j=0, idx=0; j<slices; j++, idx+=2)
1506 stripIdx[idx+1] = j+1; /* 0 is top vertex, 1 is first for first stack */
1508 stripIdx[idx ] = 0; /* repeat first slice's idx for closing off shape */
1509 stripIdx[idx+1] = 1;
1512 /* middle stacks: */
1513 /* Strip indices are relative to first index belonging to strip, NOT relative to first vertex/normal pair in array */
1514 for (i=0; i<stacks; i++, idx+=2)
1516 offset = 1+(i+1)*slices; /* triangle_strip indices start at 1 (0 is top vertex), and we advance one stack down as we go along */
1517 for (j=0; j<slices; j++, idx+=2)
1519 stripIdx[idx ] = offset+j;
1520 stripIdx[idx+1] = offset+j+slices;
1522 stripIdx[idx ] = offset; /* repeat first slice's idx for closing off shape */
1523 stripIdx[idx+1] = offset+slices;
1527 fghDrawGeometrySolid(vertices,normals,stripIdx,nVert,stacks+1,(slices+1)*2);
1529 /* cleanup allocated memory */
1533 /* cleanup allocated memory */
1538 static void fghCylinder( double radius, double height, GLint slices, GLint stacks, GLboolean useWireMode )
1541 GLfloat *vertices, *normals;
1543 /* Generate vertices and normals */
1544 /* Note, (stacks+1)*slices vertices for side of object, 2*slices+2 for top and bottom closures */
1545 fghGenerateCylinder((GLfloat)radius,(GLfloat)height,slices,stacks,&vertices,&normals,&nVert);
1548 /* nothing to draw */
1553 GLushort *sliceIdx, *stackIdx;
1554 /* First, generate vertex index arrays for drawing with glDrawElements
1555 * We have a bunch of line_loops to draw for each stack, and a
1556 * bunch for each slice.
1559 stackIdx = malloc(slices*(stacks+1)*sizeof(GLushort));
1560 sliceIdx = malloc(slices*2 *sizeof(GLushort));
1561 if (!(stackIdx) || !(sliceIdx))
1565 fgError("Failed to allocate memory in fghCylinder");
1568 /* generate for each stack */
1569 for (i=0,idx=0; i<stacks+1; i++)
1571 GLushort offset = 1+(i+1)*slices; /* start at 1 (0 is top vertex), and we advance one stack down as we go along */
1572 for (j=0; j<slices; j++, idx++)
1574 stackIdx[idx] = offset+j;
1578 /* generate for each slice */
1579 for (i=0,idx=0; i<slices; i++)
1581 GLushort offset = 1+i; /* start at 1 (0 is top vertex), and we advance one slice as we go along */
1582 sliceIdx[idx++] = offset+slices;
1583 sliceIdx[idx++] = offset+(stacks+1)*slices;
1587 fghDrawGeometryWire(vertices,normals,
1588 sliceIdx,1,slices*2,GL_LINES,
1589 stackIdx,stacks+1,slices);
1591 /* cleanup allocated memory */
1597 /* First, generate vertex index arrays for drawing with glDrawElements
1598 * All stacks, including top and bottom are covered with a triangle
1602 /* Create index vector */
1605 /* Allocate buffers for indices, bail out if memory allocation fails */
1606 stripIdx = malloc((slices+1)*2*(stacks+2)*sizeof(GLushort)); /*stacks +2 because of closing off bottom and top */
1610 fgError("Failed to allocate memory in fghCylinder");
1614 for (j=0, idx=0; j<slices; j++, idx+=2)
1617 stripIdx[idx+1] = j+1; /* 0 is top vertex, 1 is first for first stack */
1619 stripIdx[idx ] = 0; /* repeat first slice's idx for closing off shape */
1620 stripIdx[idx+1] = 1;
1623 /* middle stacks: */
1624 /* Strip indices are relative to first index belonging to strip, NOT relative to first vertex/normal pair in array */
1625 for (i=0; i<stacks; i++, idx+=2)
1627 offset = 1+(i+1)*slices; /* triangle_strip indices start at 1 (0 is top vertex), and we advance one stack down as we go along */
1628 for (j=0; j<slices; j++, idx+=2)
1630 stripIdx[idx ] = offset+j;
1631 stripIdx[idx+1] = offset+j+slices;
1633 stripIdx[idx ] = offset; /* repeat first slice's idx for closing off shape */
1634 stripIdx[idx+1] = offset+slices;
1638 offset = 1+(stacks+2)*slices;
1639 for (j=0; j<slices; j++, idx+=2)
1641 stripIdx[idx ] = offset+j;
1642 stripIdx[idx+1] = nVert-1; /* zero based index, last element in array (bottom vertex)... */
1644 stripIdx[idx ] = offset;
1645 stripIdx[idx+1] = nVert-1; /* repeat first slice's idx for closing off shape */
1648 fghDrawGeometrySolid(vertices,normals,stripIdx,nVert,stacks+2,(slices+1)*2);
1650 /* cleanup allocated memory */
1654 /* cleanup allocated memory */
1659 static void fghTorus( double dInnerRadius, double dOuterRadius, GLint nSides, GLint nRings, GLboolean useWireMode )
1662 GLfloat *vertices, *normals;
1664 /* Generate vertices and normals */
1665 fghGenerateTorus((GLfloat)dInnerRadius,(GLfloat)dOuterRadius,nSides,nRings, &vertices,&normals,&nVert);
1668 /* nothing to draw */
1673 GLushort *sideIdx, *ringIdx;
1674 /* First, generate vertex index arrays for drawing with glDrawElements
1675 * We have a bunch of line_loops to draw each side, and a
1676 * bunch for each ring.
1679 ringIdx = malloc(nRings*nSides*sizeof(GLushort));
1680 sideIdx = malloc(nSides*nRings*sizeof(GLushort));
1681 if (!(ringIdx) || !(sideIdx))
1685 fgError("Failed to allocate memory in fghTorus");
1688 /* generate for each ring */
1689 for( j=0,idx=0; j<nRings; j++ )
1690 for( i=0; i<nSides; i++, idx++ )
1691 ringIdx[idx] = j * nSides + i;
1693 /* generate for each side */
1694 for( i=0,idx=0; i<nSides; i++ )
1695 for( j=0; j<nRings; j++, idx++ )
1696 sideIdx[idx] = j * nSides + i;
1699 fghDrawGeometryWire(vertices,normals,
1700 ringIdx,nRings,nSides,GL_LINE_LOOP,
1701 sideIdx,nSides,nRings);
1703 /* cleanup allocated memory */
1709 /* First, generate vertex index arrays for drawing with glDrawElements
1710 * All stacks, including top and bottom are covered with a triangle
1715 /* Allocate buffers for indices, bail out if memory allocation fails */
1716 stripIdx = malloc((nRings+1)*2*nSides*sizeof(GLushort));
1720 fgError("Failed to allocate memory in fghTorus");
1723 for( i=0, idx=0; i<nSides; i++ )
1729 for( j=0; j<nRings; j++, idx+=2 )
1731 int offset = j * nSides + i;
1732 stripIdx[idx ] = offset;
1733 stripIdx[idx+1] = offset + ioff;
1735 /* repeat first to close off shape */
1737 stripIdx[idx+1] = i + ioff;
1742 fghDrawGeometrySolid(vertices,normals,stripIdx,nVert,nSides,(nRings+1)*2);
1744 /* cleanup allocated memory */
1748 /* cleanup allocated memory */
1754 /* -- INTERFACE FUNCTIONS ---------------------------------------------- */
1758 * Draws a solid sphere
1760 void FGAPIENTRY glutSolidSphere(double radius, GLint slices, GLint stacks)
1762 FREEGLUT_EXIT_IF_NOT_INITIALISED ( "glutSolidSphere" );
1764 fghSphere( radius, slices, stacks, FALSE );
1768 * Draws a wire sphere
1770 void FGAPIENTRY glutWireSphere(double radius, GLint slices, GLint stacks)
1772 FREEGLUT_EXIT_IF_NOT_INITIALISED ( "glutWireSphere" );
1774 fghSphere( radius, slices, stacks, TRUE );
1779 * Draws a solid cone
1781 void FGAPIENTRY glutSolidCone( double base, double height, GLint slices, GLint stacks )
1783 FREEGLUT_EXIT_IF_NOT_INITIALISED ( "glutSolidCone" );
1785 fghCone( base, height, slices, stacks, FALSE );
1791 void FGAPIENTRY glutWireCone( double base, double height, GLint slices, GLint stacks)
1793 FREEGLUT_EXIT_IF_NOT_INITIALISED ( "glutWireCone" );
1795 fghCone( base, height, slices, stacks, TRUE );
1800 * Draws a solid cylinder
1802 void FGAPIENTRY glutSolidCylinder(double radius, double height, GLint slices, GLint stacks)
1804 FREEGLUT_EXIT_IF_NOT_INITIALISED ( "glutSolidCylinder" );
1806 fghCylinder( radius, height, slices, stacks, FALSE );
1810 * Draws a wire cylinder
1812 void FGAPIENTRY glutWireCylinder(double radius, double height, GLint slices, GLint stacks)
1814 FREEGLUT_EXIT_IF_NOT_INITIALISED ( "glutWireCylinder" );
1816 fghCylinder( radius, height, slices, stacks, TRUE );
1820 * Draws a wire torus
1822 void FGAPIENTRY glutWireTorus( double dInnerRadius, double dOuterRadius, GLint nSides, GLint nRings )
1824 FREEGLUT_EXIT_IF_NOT_INITIALISED ( "glutWireTorus" );
1826 fghTorus(dInnerRadius, dOuterRadius, nSides, nRings, TRUE);
1830 * Draws a solid torus
1832 void FGAPIENTRY glutSolidTorus( double dInnerRadius, double dOuterRadius, GLint nSides, GLint nRings )
1834 FREEGLUT_EXIT_IF_NOT_INITIALISED ( "glutSolidTorus" );
1836 fghTorus(dInnerRadius, dOuterRadius, nSides, nRings, FALSE);
1841 /* -- INTERFACE FUNCTIONS -------------------------------------------------- */
1842 /* Macro to generate interface functions */
1843 #define DECLARE_SHAPE_INTERFACE(nameICaps)\
1844 void FGAPIENTRY glutWire##nameICaps( void )\
1846 FREEGLUT_EXIT_IF_NOT_INITIALISED ( "glutWire"#nameICaps );\
1847 fgh##nameICaps( TRUE );\
1849 void FGAPIENTRY glutSolid##nameICaps( void )\
1851 FREEGLUT_EXIT_IF_NOT_INITIALISED ( "glutSolid"#nameICaps );\
1852 fgh##nameICaps( FALSE );\
1855 void FGAPIENTRY glutWireCube( double dSize )
1857 FREEGLUT_EXIT_IF_NOT_INITIALISED ( "glutWireCube" );
1858 fghCube( (GLfloat)dSize, TRUE );
1860 void FGAPIENTRY glutSolidCube( double dSize )
1862 FREEGLUT_EXIT_IF_NOT_INITIALISED ( "glutSolidCube" );
1863 fghCube( (GLfloat)dSize, FALSE );
1866 DECLARE_SHAPE_INTERFACE(Dodecahedron)
1867 DECLARE_SHAPE_INTERFACE(Icosahedron)
1868 DECLARE_SHAPE_INTERFACE(Octahedron)
1869 DECLARE_SHAPE_INTERFACE(RhombicDodecahedron)
1871 void FGAPIENTRY glutWireSierpinskiSponge ( int num_levels, double offset[3], double scale )
1873 FREEGLUT_EXIT_IF_NOT_INITIALISED ( "glutWireSierpinskiSponge" );
1874 fghSierpinskiSponge ( num_levels, offset, (GLfloat)scale, TRUE );
1876 void FGAPIENTRY glutSolidSierpinskiSponge ( int num_levels, double offset[3], double scale )
1878 FREEGLUT_EXIT_IF_NOT_INITIALISED ( "glutSolidSierpinskiSponge" );
1879 fghSierpinskiSponge ( num_levels, offset, (GLfloat)scale, FALSE );
1882 DECLARE_SHAPE_INTERFACE(Tetrahedron)
1885 /*** END OF FILE ***/