113 lines
2.2 KiB
C
113 lines
2.2 KiB
C
|
/********************************************************************/
|
||
|
|
/* STRIPE: converting a polygonal model to triangle strips
|
||
|
|
Francine Evans, 1996.
|
||
|
|
SUNY @ Stony Brook
|
||
|
|
Advisors: Steven Skiena and Amitabh Varshney
|
||
|
|
*/
|
||
|
|
/********************************************************************/
|
||
|
|
|
||
|
|
/*---------------------------------------------------------------------*/
|
||
|
|
/* STRIPE: free.c
|
||
|
|
This file contains the code used to free the data structures.
|
||
|
|
*/
|
||
|
|
/*---------------------------------------------------------------------*/
|
||
|
|
|
||
|
|
#include <stdio.h>
|
||
|
|
#include <stdlib.h>
|
||
|
|
#include "polverts.h"
|
||
|
|
|
||
|
|
ListHead *array[60];
|
||
|
|
int id_array[60];
|
||
|
|
ListHead *strips[1];
|
||
|
|
ListHead *all_strips[100000]; /* Assume max 100000 strips */
|
||
|
|
|
||
|
|
void ParseAndFreeList( ListHead *pListHead )
|
||
|
|
{
|
||
|
|
register int c,num;
|
||
|
|
|
||
|
|
/* Freeing a linked list */
|
||
|
|
num = NumOnList(pListHead);
|
||
|
|
for (c = 0; c< num; c++)
|
||
|
|
RemHead(pListHead);
|
||
|
|
}
|
||
|
|
|
||
|
|
void FreePolygonNode( PF_VERTS pfVerts)
|
||
|
|
{
|
||
|
|
/* Free a vertex node */
|
||
|
|
if ( pfVerts->pPolygon )
|
||
|
|
free( pfVerts->pPolygon );
|
||
|
|
free( pfVerts );
|
||
|
|
|
||
|
|
}
|
||
|
|
|
||
|
|
void Free_Strips()
|
||
|
|
{
|
||
|
|
/* Free strips data structure */
|
||
|
|
if (strips[0] == NULL)
|
||
|
|
return;
|
||
|
|
else
|
||
|
|
ParseAndFreeList(strips[0]);
|
||
|
|
}
|
||
|
|
|
||
|
|
void FreeFaceNode( PF_FACES pfFaces)
|
||
|
|
{
|
||
|
|
/* Free face node */
|
||
|
|
if ( pfFaces->pPolygon )
|
||
|
|
free( pfFaces->pPolygon );
|
||
|
|
free( pfFaces );
|
||
|
|
}
|
||
|
|
|
||
|
|
|
||
|
|
void FreeFaceTable(int nSize)
|
||
|
|
{
|
||
|
|
register int nIndex;
|
||
|
|
|
||
|
|
for ( nIndex=0; nIndex < nSize; nIndex++ )
|
||
|
|
{
|
||
|
|
if ( PolFaces[nIndex] != NULL )
|
||
|
|
ParseAndFreeList( PolFaces[nIndex] );
|
||
|
|
}
|
||
|
|
free( PolFaces );
|
||
|
|
}
|
||
|
|
|
||
|
|
void FreeEdgeTable(int nSize)
|
||
|
|
{
|
||
|
|
register int nIndex;
|
||
|
|
|
||
|
|
for ( nIndex=0; nIndex < nSize; nIndex++ )
|
||
|
|
{
|
||
|
|
if ( PolEdges[nIndex] != NULL )
|
||
|
|
ParseAndFreeList( PolEdges[nIndex] );
|
||
|
|
}
|
||
|
|
free( PolEdges );
|
||
|
|
}
|
||
|
|
|
||
|
|
|
||
|
|
void Free_All_Strips()
|
||
|
|
{
|
||
|
|
|
||
|
|
ListHead *pListHead;
|
||
|
|
register int y;
|
||
|
|
|
||
|
|
for (y =0; ; y++)
|
||
|
|
{
|
||
|
|
pListHead = all_strips[y];
|
||
|
|
if (pListHead == NULL)
|
||
|
|
return;
|
||
|
|
else
|
||
|
|
ParseAndFreeList(all_strips[y]);
|
||
|
|
}
|
||
|
|
}
|
||
|
|
|
||
|
|
void End_Face_Struct(int numfaces)
|
||
|
|
{
|
||
|
|
FreeFaceTable(numfaces);
|
||
|
|
}
|
||
|
|
|
||
|
|
void End_Edge_Struct(int numverts)
|
||
|
|
{
|
||
|
|
FreeEdgeTable(numverts);
|
||
|
|
}
|
||
|
|
|
||
|
|
|