1*c2c66affSColin Finck /* 2*c2c66affSColin Finck * SGI FREE SOFTWARE LICENSE B (Version 2.0, Sept. 18, 2008) 3*c2c66affSColin Finck * Copyright (C) 1991-2000 Silicon Graphics, Inc. All Rights Reserved. 4*c2c66affSColin Finck * 5*c2c66affSColin Finck * Permission is hereby granted, free of charge, to any person obtaining a 6*c2c66affSColin Finck * copy of this software and associated documentation files (the "Software"), 7*c2c66affSColin Finck * to deal in the Software without restriction, including without limitation 8*c2c66affSColin Finck * the rights to use, copy, modify, merge, publish, distribute, sublicense, 9*c2c66affSColin Finck * and/or sell copies of the Software, and to permit persons to whom the 10*c2c66affSColin Finck * Software is furnished to do so, subject to the following conditions: 11*c2c66affSColin Finck * 12*c2c66affSColin Finck * The above copyright notice including the dates of first publication and 13*c2c66affSColin Finck * either this permission notice or a reference to 14*c2c66affSColin Finck * http://oss.sgi.com/projects/FreeB/ 15*c2c66affSColin Finck * shall be included in all copies or substantial portions of the Software. 16*c2c66affSColin Finck * 17*c2c66affSColin Finck * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS 18*c2c66affSColin Finck * OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, 19*c2c66affSColin Finck * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL 20*c2c66affSColin Finck * SILICON GRAPHICS, INC. BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, 21*c2c66affSColin Finck * WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF 22*c2c66affSColin Finck * OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE 23*c2c66affSColin Finck * SOFTWARE. 24*c2c66affSColin Finck * 25*c2c66affSColin Finck * Except as contained in this notice, the name of Silicon Graphics, Inc. 26*c2c66affSColin Finck * shall not be used in advertising or otherwise to promote the sale, use or 27*c2c66affSColin Finck * other dealings in this Software without prior written authorization from 28*c2c66affSColin Finck * Silicon Graphics, Inc. 29*c2c66affSColin Finck */ 30*c2c66affSColin Finck /* 31*c2c66affSColin Finck ** Author: Eric Veach, July 1994. 32*c2c66affSColin Finck ** 33*c2c66affSColin Finck */ 34*c2c66affSColin Finck 35*c2c66affSColin Finck #ifndef __tess_h_ 36*c2c66affSColin Finck #define __tess_h_ 37*c2c66affSColin Finck 38*c2c66affSColin Finck //#include <GL/glu.h> 39*c2c66affSColin Finck #include <setjmp.h> 40*c2c66affSColin Finck #include "mesh.h" 41*c2c66affSColin Finck #include "dict.h" 42*c2c66affSColin Finck #include "priorityq.h" 43*c2c66affSColin Finck 44*c2c66affSColin Finck /* The begin/end calls must be properly nested. We keep track of 45*c2c66affSColin Finck * the current state to enforce the ordering. 46*c2c66affSColin Finck */ 47*c2c66affSColin Finck enum TessState { T_DORMANT, T_IN_POLYGON, T_IN_CONTOUR }; 48*c2c66affSColin Finck 49*c2c66affSColin Finck /* We cache vertex data for single-contour polygons so that we can 50*c2c66affSColin Finck * try a quick-and-dirty decomposition first. 51*c2c66affSColin Finck */ 52*c2c66affSColin Finck #define TESS_MAX_CACHE 100 53*c2c66affSColin Finck 54*c2c66affSColin Finck typedef struct CachedVertex { 55*c2c66affSColin Finck GLdouble coords[3]; 56*c2c66affSColin Finck void *data; 57*c2c66affSColin Finck } CachedVertex; 58*c2c66affSColin Finck 59*c2c66affSColin Finck struct GLUtesselator { 60*c2c66affSColin Finck 61*c2c66affSColin Finck /*** state needed for collecting the input data ***/ 62*c2c66affSColin Finck 63*c2c66affSColin Finck enum TessState state; /* what begin/end calls have we seen? */ 64*c2c66affSColin Finck 65*c2c66affSColin Finck GLUhalfEdge *lastEdge; /* lastEdge->Org is the most recent vertex */ 66*c2c66affSColin Finck GLUmesh *mesh; /* stores the input contours, and eventually 67*c2c66affSColin Finck the tessellation itself */ 68*c2c66affSColin Finck 69*c2c66affSColin Finck void (GLAPIENTRY *callError)( GLenum errnum ); 70*c2c66affSColin Finck 71*c2c66affSColin Finck /*** state needed for projecting onto the sweep plane ***/ 72*c2c66affSColin Finck 73*c2c66affSColin Finck GLdouble normal[3]; /* user-specified normal (if provided) */ 74*c2c66affSColin Finck GLdouble sUnit[3]; /* unit vector in s-direction (debugging) */ 75*c2c66affSColin Finck GLdouble tUnit[3]; /* unit vector in t-direction (debugging) */ 76*c2c66affSColin Finck 77*c2c66affSColin Finck /*** state needed for the line sweep ***/ 78*c2c66affSColin Finck 79*c2c66affSColin Finck GLdouble relTolerance; /* tolerance for merging features */ 80*c2c66affSColin Finck GLenum windingRule; /* rule for determining polygon interior */ 81*c2c66affSColin Finck GLboolean fatalError; /* fatal error: needed combine callback */ 82*c2c66affSColin Finck 83*c2c66affSColin Finck Dict *dict; /* edge dictionary for sweep line */ 84*c2c66affSColin Finck PriorityQ *pq; /* priority queue of vertex events */ 85*c2c66affSColin Finck GLUvertex *event; /* current sweep event being processed */ 86*c2c66affSColin Finck 87*c2c66affSColin Finck void (GLAPIENTRY *callCombine)( GLdouble coords[3], void *data[4], 88*c2c66affSColin Finck GLfloat weight[4], void **outData ); 89*c2c66affSColin Finck 90*c2c66affSColin Finck /*** state needed for rendering callbacks (see render.c) ***/ 91*c2c66affSColin Finck 92*c2c66affSColin Finck GLboolean flagBoundary; /* mark boundary edges (use EdgeFlag) */ 93*c2c66affSColin Finck GLboolean boundaryOnly; /* Extract contours, not triangles */ 94*c2c66affSColin Finck GLUface *lonelyTriList; 95*c2c66affSColin Finck /* list of triangles which could not be rendered as strips or fans */ 96*c2c66affSColin Finck 97*c2c66affSColin Finck void (GLAPIENTRY *callBegin)( GLenum type ); 98*c2c66affSColin Finck void (GLAPIENTRY *callEdgeFlag)( GLboolean boundaryEdge ); 99*c2c66affSColin Finck void (GLAPIENTRY *callVertex)( void *data ); 100*c2c66affSColin Finck void (GLAPIENTRY *callEnd)( void ); 101*c2c66affSColin Finck void (GLAPIENTRY *callMesh)( GLUmesh *mesh ); 102*c2c66affSColin Finck 103*c2c66affSColin Finck 104*c2c66affSColin Finck /*** state needed to cache single-contour polygons for renderCache() */ 105*c2c66affSColin Finck 106*c2c66affSColin Finck GLboolean emptyCache; /* empty cache on next vertex() call */ 107*c2c66affSColin Finck int cacheCount; /* number of cached vertices */ 108*c2c66affSColin Finck CachedVertex cache[TESS_MAX_CACHE]; /* the vertex data */ 109*c2c66affSColin Finck 110*c2c66affSColin Finck /*** rendering callbacks that also pass polygon data ***/ 111*c2c66affSColin Finck void (GLAPIENTRY *callBeginData)( GLenum type, void *polygonData ); 112*c2c66affSColin Finck void (GLAPIENTRY *callEdgeFlagData)( GLboolean boundaryEdge, 113*c2c66affSColin Finck void *polygonData ); 114*c2c66affSColin Finck void (GLAPIENTRY *callVertexData)( void *data, void *polygonData ); 115*c2c66affSColin Finck void (GLAPIENTRY *callEndData)( void *polygonData ); 116*c2c66affSColin Finck void (GLAPIENTRY *callErrorData)( GLenum errnum, void *polygonData ); 117*c2c66affSColin Finck void (GLAPIENTRY *callCombineData)( GLdouble coords[3], void *data[4], 118*c2c66affSColin Finck GLfloat weight[4], void **outData, 119*c2c66affSColin Finck void *polygonData ); 120*c2c66affSColin Finck 121*c2c66affSColin Finck jmp_buf env; /* place to jump to when memAllocs fail */ 122*c2c66affSColin Finck 123*c2c66affSColin Finck void *polygonData; /* client data for current polygon */ 124*c2c66affSColin Finck }; 125*c2c66affSColin Finck 126*c2c66affSColin Finck void GLAPIENTRY __gl_noBeginData( GLenum type, void *polygonData ); 127*c2c66affSColin Finck void GLAPIENTRY __gl_noEdgeFlagData( GLboolean boundaryEdge, void *polygonData ); 128*c2c66affSColin Finck void GLAPIENTRY __gl_noVertexData( void *data, void *polygonData ); 129*c2c66affSColin Finck void GLAPIENTRY __gl_noEndData( void *polygonData ); 130*c2c66affSColin Finck void GLAPIENTRY __gl_noErrorData( GLenum errnum, void *polygonData ); 131*c2c66affSColin Finck void GLAPIENTRY __gl_noCombineData( GLdouble coords[3], void *data[4], 132*c2c66affSColin Finck GLfloat weight[4], void **outData, 133*c2c66affSColin Finck void *polygonData ); 134*c2c66affSColin Finck 135*c2c66affSColin Finck #define CALL_BEGIN_OR_BEGIN_DATA(a) \ 136*c2c66affSColin Finck if (tess->callBeginData != &__gl_noBeginData) \ 137*c2c66affSColin Finck (*tess->callBeginData)((a),tess->polygonData); \ 138*c2c66affSColin Finck else (*tess->callBegin)((a)); 139*c2c66affSColin Finck 140*c2c66affSColin Finck #define CALL_VERTEX_OR_VERTEX_DATA(a) \ 141*c2c66affSColin Finck if (tess->callVertexData != &__gl_noVertexData) \ 142*c2c66affSColin Finck (*tess->callVertexData)((a),tess->polygonData); \ 143*c2c66affSColin Finck else (*tess->callVertex)((a)); 144*c2c66affSColin Finck 145*c2c66affSColin Finck #define CALL_EDGE_FLAG_OR_EDGE_FLAG_DATA(a) \ 146*c2c66affSColin Finck if (tess->callEdgeFlagData != &__gl_noEdgeFlagData) \ 147*c2c66affSColin Finck (*tess->callEdgeFlagData)((a),tess->polygonData); \ 148*c2c66affSColin Finck else (*tess->callEdgeFlag)((a)); 149*c2c66affSColin Finck 150*c2c66affSColin Finck #define CALL_END_OR_END_DATA() \ 151*c2c66affSColin Finck if (tess->callEndData != &__gl_noEndData) \ 152*c2c66affSColin Finck (*tess->callEndData)(tess->polygonData); \ 153*c2c66affSColin Finck else (*tess->callEnd)(); 154*c2c66affSColin Finck 155*c2c66affSColin Finck #define CALL_COMBINE_OR_COMBINE_DATA(a,b,c,d) \ 156*c2c66affSColin Finck if (tess->callCombineData != &__gl_noCombineData) \ 157*c2c66affSColin Finck (*tess->callCombineData)((a),(b),(c),(d),tess->polygonData); \ 158*c2c66affSColin Finck else (*tess->callCombine)((a),(b),(c),(d)); 159*c2c66affSColin Finck 160*c2c66affSColin Finck #define CALL_ERROR_OR_ERROR_DATA(a) \ 161*c2c66affSColin Finck if (tess->callErrorData != &__gl_noErrorData) \ 162*c2c66affSColin Finck (*tess->callErrorData)((a),tess->polygonData); \ 163*c2c66affSColin Finck else (*tess->callError)((a)); 164*c2c66affSColin Finck 165*c2c66affSColin Finck #endif 166