src/hd/sm_ogl.c

/* Copyright (c) 1998 Silicon Graphics, Inc. */

#ifndef lint
static char SCCSid[] = "$SunId$ SGI";
#endif

/*
 * sm_ogl.c
*/
#include "standard.h"

#include <GL/gl.h>

#ifdef TEST_DRIVER
#include <gl/device.h>
#include <GL/glu.h>
#include <glut.h>
#endif
#include "sm_list.h"
#include "sm_geom.h"
#include "sm.h"

#ifdef TEST_DRIVER
#include "sm_draw.h"
/*static char smClean_notify = TRUE; 
MAKE STATIC LATER: ui.c using for now;
 */
char smClean_notify = TRUE; 
#else
static int smClean_notify = TRUE; 
#endif

typedef struct {
        float   dist;           /* average distance */
        BYTE    rgb[3];         /* average color */
} QTRAVG;               /* average quadtree value */

typedef struct {
        QUADTREE        qt;     /* quadtree node (key & hash value) */
        QTRAVG          av;     /* node average */
} QT_LUENT;             /* lookup table entry */

static QT_LUENT *qt_htbl = NULL;        /* quadtree cache */
static int      qt_hsiz = 0;            /* quadtree cache size */


int
mark_active_tris(qtptr,arg)
QUADTREE *qtptr;
int *arg;
{
  QUADTREE qt = *qtptr;
  OBJECT *os,*optr;
  register int i,t_id;

  if (!QT_IS_LEAF(qt))
    return(TRUE);
  /* For each triangle in the set, set the which flag*/
  os = qtqueryset(qt);

  for (i = QT_SET_CNT(os), optr = QT_SET_PTR(os); i > 0; i--)
  {
    t_id = QT_SET_NEXT_ELEM(optr);
    /* Set the render flag */
    if(SM_IS_NTH_T_BASE(smMesh,t_id))
        continue;
    SM_SET_NTH_T_ACTIVE(smMesh,t_id);
    /* FOR NOW:Also set the LRU clock bit: MAY WANT TO CHANGE: */      
    SM_SET_NTH_T_LRU(smMesh,t_id);
  }
  return(TRUE);
}

mark_tris_in_frustum(view)
VIEW *view;
{
    FVECT nr[4],far[4];

    /* Mark triangles in approx. view frustum as being active:set
       LRU counter: for use in discarding samples when out
       of space
       Radiance often has no far clipping plane: but driver will set
       dev_zmin,dev_zmax to satisfy OGL
    */

    /* First clear all the quadtree node and triangle active flags */
    qtClearAllFlags();
    smClear_flags(smMesh,T_ACTIVE_FLAG);

    /* calculate the world space coordinates of the view frustum */
    calculate_view_frustum(view->vp,view->hvec,view->vvec,view->horiz,
                           view->vert, dev_zmin,dev_zmax,nr,far);

    /* Project the view frustum onto the spherical quadtree */
    /* For every cell intersected by the projection of the faces
       of the frustum: mark all triangles in the cell as ACTIVE-
       Also set the triangles LRU clock counter
       */
    /* Near face triangles */
    smLocator_apply_func(smMesh,nr[0],nr[2],nr[3],mark_active_tris,NULL);
    smLocator_apply_func(smMesh,nr[2],nr[0],nr[1],mark_active_tris,NULL);
    /* Right face triangles */
    smLocator_apply_func(smMesh,nr[0],far[3],far[0],mark_active_tris,NULL);
    smLocator_apply_func(smMesh,far[3],nr[0],nr[3],mark_active_tris,NULL);
    /* Left face triangles */
    smLocator_apply_func(smMesh,nr[1],far[2],nr[2],mark_active_tris,NULL);
    smLocator_apply_func(smMesh,far[2],nr[1],far[1],mark_active_tris,NULL);
    /* Top face triangles */
    smLocator_apply_func(smMesh,nr[0],far[0],nr[1],mark_active_tris,NULL);
    smLocator_apply_func(smMesh,nr[1],far[0],far[1],mark_active_tris,NULL);
    /* Bottom face triangles */
    smLocator_apply_func(smMesh,nr[3],nr[2],far[3],mark_active_tris,NULL);
    smLocator_apply_func(smMesh,nr[2],far[2],far[3],mark_active_tris,NULL);
    /* Far face triangles */
    smLocator_apply_func(smMesh,far[0],far[2],far[1],mark_active_tris,NULL);
    smLocator_apply_func(smMesh,far[2],far[0],far[3],mark_active_tris,NULL);

#ifdef TEST_DRIVER
    VCOPY(FrustumFar[0],far[0]);
    VCOPY(FrustumFar[1],far[1]);
    VCOPY(FrustumFar[2],far[2]);
    VCOPY(FrustumFar[3],far[3]);
    VCOPY(FrustumNear[0],nr[0]);
    VCOPY(FrustumNear[1],nr[1]);
    VCOPY(FrustumNear[2],nr[2]);
    VCOPY(FrustumNear[3],nr[3]);
#endif
}

/*
 * smClean()            : display has been wiped clean
 *
 * Called after display has been effectively cleared, meaning that all
 * geometry must be resent down the pipeline in the next call to smUpdate().
 */
smClean()
{
    smClean_notify = TRUE;
}

int
qtCache_init(nel)               /* initialize for at least nel elements */
int     nel;
{
        static int  hsiztab[] = {
                8191, 16381, 32749, 65521, 131071, 262139, 524287, 1048573, 0
        };
        register int  i;

        if (nel <= 0) {                 /* call to free table */
                if (qt_hsiz) {
                        free((char *)qt_htbl);
                        qt_htbl = NULL;
                        qt_hsiz = 0;
                }
                return(0);
        }
        nel += nel>>1;                  /* 66% occupancy */
        for (i = 0; hsiztab[i]; i++)
                if (hsiztab[i] > nel)
                        break;
        if (!(qt_hsiz = hsiztab[i]))
                qt_hsiz = nel*2 + 1;            /* not always prime */
        qt_htbl = (QT_LUENT *)calloc(qt_hsiz, sizeof(QT_LUENT));
        if (qt_htbl == NULL)
                qt_hsiz = 0;
        for (i = qt_hsiz; i--; )
                qt_htbl[i].qt = EMPTY;
        return(qt_hsiz);
}

QT_LUENT *
qtCache_find(qt)                /* find a quadtree table entry */
QUADTREE qt;
{
        int     i, n;
        register int    ndx;
        register QT_LUENT       *le;

        if (qt_hsiz == 0 && !qtCache_init(1))
                return(NULL);
tryagain:                               /* hash table lookup */
        ndx = (unsigned long)qt % qt_hsiz;
        for (i = 0, n = 1; i < qt_hsiz; i++, n += 2) {
                le = &qt_htbl[ndx];
                if (QT_IS_EMPTY(le->qt) || le->qt == qt)
                        return(le);
                if ((ndx += n) >= qt_hsiz)      /* this happens rarely */
                        ndx = ndx % qt_hsiz;
        }
                                        /* table is full, reallocate */
        le = qt_htbl;
        ndx = qt_hsiz;
        if (!qtCache_init(ndx+1)) {     /* no more memory! */
                qt_htbl = le;
                qt_hsiz = ndx;
                return(NULL);
        }
                                        /* copy old table to new and free */
        while (ndx--)
                if (!QT_IS_EMPTY(le[ndx].qt))
                        copystruct(qtCache_find(le[ndx].qt), &le[ndx]);
        free((char *)le);
        goto tryagain;                  /* should happen only once! */
}

stCount_level_leaves(lcnt, qt)  /* count quadtree leaf nodes at each level */
int lcnt[];
register QUADTREE qt;
{
  if (QT_IS_EMPTY(qt))
    return;
  if (QT_IS_TREE(qt)) {
    if (!QT_IS_FLAG(qt))        /* not in our frustum */
      return;
    stCount_level_leaves(lcnt+1, QT_NTH_CHILD(qt,0));
    stCount_level_leaves(lcnt+1, QT_NTH_CHILD(qt,1));
    stCount_level_leaves(lcnt+1, QT_NTH_CHILD(qt,2));
    stCount_level_leaves(lcnt+1, QT_NTH_CHILD(qt,3));
  }
  else
    lcnt[0]++;
}


QTRAVG *
qtRender_level(qt,v0,v1,v2,sm,lvl)
QUADTREE qt;
FVECT v0,v1,v2;
SM *sm;
int lvl;
{
  FVECT a,b,c;
  register QT_LUENT *le;
  QTRAVG *rc[4];
  
  if (QT_IS_EMPTY(qt))                          /* empty leaf node */
    return(NULL);
  if (QT_IS_TREE(qt) && !QT_IS_FLAG(qt))        /* not in our frustum */
    return(NULL);
                                        /* else look up node */
  if ((le = qtCache_find(qt)) == NULL)
    error(SYSTEM, "out of memory in qtRender_level");
  if (QT_IS_TREE(qt) && (QT_IS_EMPTY(le->qt) || lvl > 0))
  {                                     /* compute children */
    qtSubdivide_tri(v0,v1,v2,a,b,c);
    rc[0] = qtRender_level(QT_NTH_CHILD(qt,0),v0,a,c,sm,lvl-1);
    rc[1] = qtRender_level(QT_NTH_CHILD(qt,1),a,v1,b,sm,lvl-1);
    rc[2] = qtRender_level(QT_NTH_CHILD(qt,2),c,b,v2,sm,lvl-1);
    rc[3] = qtRender_level(QT_NTH_CHILD(qt,3),b,c,a,sm,lvl-1);
  }
  if (QT_IS_EMPTY(le->qt))
  {                                     /* let's make some data! */
    int rgbs[3];
    double distsum;
    register int i, n;
                                        /* average our triangle vertices */
    rgbs[0] = rgbs[1] = rgbs[2] = 0;
    distsum = 0.; n = 0;
    if(QT_IS_TREE(qt))
    {                                   /* from subtree */
      for (i = 4; i--; )
        if (rc[i] != NULL)
        {
          rgbs[0] += rc[i]->rgb[0]; rgbs[1] += rc[i]->rgb[1];
          rgbs[2] += rc[i]->rgb[2]; distsum += rc[i]->dist; n++;
        }
    }
    else
    {                                   /* from triangle set */
      OBJECT *os;
      int s0, s1, s2;

      os = qtqueryset(qt);
      for (n = os[0]; n; n--)
      {
        qtTri_from_id(os[n],a,b,c,NULL,NULL,NULL,&s0,&s1,&s2);
        distsum += SM_BG_SAMPLE(sm,s0) ? dev_zmax
                                : sqrt(dist2(a,SM_VIEW_CENTER(sm)));
        distsum += SM_BG_SAMPLE(sm,s1) ? dev_zmax
                                : sqrt(dist2(b,SM_VIEW_CENTER(sm)));
        distsum += SM_BG_SAMPLE(sm,s2) ? dev_zmax
                                : sqrt(dist2(c,SM_VIEW_CENTER(sm)));
        rgbs[0] += SM_NTH_RGB(sm,s0)[0] + SM_NTH_RGB(sm,s1)[0]
                  + SM_NTH_RGB(sm,s2)[0];
        rgbs[1] += SM_NTH_RGB(sm,s0)[1] + SM_NTH_RGB(sm,s1)[1]
                  + SM_NTH_RGB(sm,s2)[1];
        rgbs[2] += SM_NTH_RGB(sm,s0)[2] + SM_NTH_RGB(sm,s1)[2]
                  + SM_NTH_RGB(sm,s2)[2];
      }
      n = 3*os[0];
    }
    if (!n)
      return(NULL);
    le->qt = qt;
    le->av.rgb[0] = rgbs[0]/n; le->av.rgb[1] = rgbs[1]/n;
    le->av.rgb[2] = rgbs[2]/n; le->av.dist = distsum/(double)n;
  }
  if (lvl == 0 || (lvl > 0 && QT_IS_LEAF(qt)))
  {                             /* render this node */
                                        /* compute pseudo vertices */
    VCOPY(a,v0); VCOPY(b,v1); VCOPY(c,v2);
    normalize(a); normalize(b); normalize(c);
    VSUM(a,SM_VIEW_CENTER(sm),a,le->av.dist);
    VSUM(b,SM_VIEW_CENTER(sm),b,le->av.dist);
    VSUM(c,SM_VIEW_CENTER(sm),c,le->av.dist);
                                        /* draw triangle */
    glColor3ub(le->av.rgb[0],le->av.rgb[1],le->av.rgb[2]);
    /* NOTE: Triangle vertex order may change */
    glVertex3d(c[0],c[1],c[2]);
    glVertex3d(b[0],b[1],b[2]);
    glVertex3d(a[0],a[1],a[2]);
  }
  return(&le->av);
}


smRender_stree_level(sm,lvl)
SM *sm;
int lvl;
{
  QUADTREE root;
  int i;
  FVECT t0,t1,t2;

  if (lvl < 1)
    return;
  glPushAttrib(GL_LIGHTING_BIT);
  glShadeModel(GL_FLAT);
  glBegin(GL_TRIANGLES);
  for(i=0; i < 4; i++)
  {
    root = ST_NTH_ROOT(SM_LOCATOR(sm),i);
    stNth_base_verts(SM_LOCATOR(sm),i,t0,t1,t2); 
    qtRender_level(root,t0,t1,t2,sm,lvl-1);
  }
  glEnd();
  glPopAttrib();
}


smRender_stree(sm, qual)        /* render some quadtree triangles */
SM *sm;
int qual;
{
  int i, ntarget;
  int lvlcnt[QT_MAX_LEVELS];

  if (qual <= 0)
    return;
                                /* compute rendering target */
  ntarget = 0;
  SM_FOR_ALL_ACTIVE_TRIS(sm,i)
    ntarget++;
  ntarget = ntarget*qual/100;
  if (!ntarget)
    return;
  for (i = QT_MAX_LEVELS; i--; )
    lvlcnt[i] = 0;
  stCount_level_leaves(lvlcnt, SM_LOCATOR(sm)->root);
  for (ntarget -= lvlcnt[i=0]; i < QT_MAX_LEVELS-1; ntarget -= lvlcnt[++i])
    if (ntarget < lvlcnt[i+1])
      break;
                                /* compute and render target level */
  smRender_stree_level(sm,i);
}


smRender_tri(sm,i,vp,clr)
SM *sm;
int i;
FVECT vp;
int clr;
{
  TRI *tri;
  double ptr[3];
  int j;

  tri = SM_NTH_TRI(sm,i);
  if (clr) SM_CLEAR_NTH_T_NEW(sm,i);

  /* NOTE:Triangles are defined clockwise:historical relative to spherical
     tris: could change
     */
  for(j=2; j>= 0; j--)
  {
#ifdef DEBUG
    if(SM_BG_SAMPLE(sm,T_NTH_V(tri,j)))
      eputs("SmRenderTri(): shouldnt have bg samples\n");
#endif
    glColor3ub(SM_NTH_RGB(sm,T_NTH_V(tri,j))[0],
               SM_NTH_RGB(sm,T_NTH_V(tri,j))[1],
               SM_NTH_RGB(sm,T_NTH_V(tri,j))[2]);
    VCOPY(ptr,SM_T_NTH_WV(sm,tri,j));
    glVertex3d(ptr[0],ptr[1],ptr[2]);
  }
}

smRender_mixed_tri(sm,i,vp,clr)
SM *sm;
int i;
FVECT vp;
int clr;
{
  TRI *tri;
  double p[3],d;
  int j,ids[3],cnt;
  int rgb[3];

  tri = SM_NTH_TRI(sm,i);
  if (clr) SM_CLEAR_NTH_T_NEW(sm,i);

  /* NOTE:Triangles are defined clockwise:historical relative to spherical
     tris: could change
     */
  cnt = 0;
  d = 0.0;
  rgb[0] = rgb[1] = rgb[2] = 0;
  for(j=0;j < 3;j++)
  {
      ids[j] = T_NTH_V(tri,j);
      if(!SM_BG_SAMPLE(sm,ids[j]))
      {
          rgb[0] += SM_NTH_RGB(sm,ids[j])[0];
          rgb[1] += SM_NTH_RGB(sm,ids[j])[1];
          rgb[2] += SM_NTH_RGB(sm,ids[j])[2];
          cnt++;
          d += DIST(vp,SM_NTH_WV(sm,ids[j]));
      }
  }
  if(cnt > 1)
  {
    rgb[0]/=cnt; rgb[1]/=cnt; rgb[2]/=cnt;
    d /= (double)cnt;
  } 
  for(j=2; j>= 0; j--)
  {
    if(SM_BG_SAMPLE(sm,ids[j]))
    {
        glColor3ub(rgb[0],rgb[1],rgb[2]);
        VSUB(p,SM_NTH_WV(sm,ids[j]),SM_VIEW_CENTER(sm));
        p[0] *= d;
        p[1] *= d;
        p[2] *= d;
        VADD(p,p,SM_VIEW_CENTER(sm));
    }
    else
    {
        glColor3ub(SM_NTH_RGB(sm,ids[j])[0],SM_NTH_RGB(sm,ids[j])[1],
                   SM_NTH_RGB(sm,ids[j])[2]);
        VCOPY(p,SM_NTH_WV(sm,ids[j]));
    }
    glVertex3d(p[0],p[1],p[2]);
   }
}

smRender_bg_tri(sm,i,vp,d,clr)
SM *sm;
int i;
FVECT vp;
double d;
int clr;
{
  double p[3];
  int j,id;
  TRI *tri;
  
  tri = SM_NTH_TRI(sm,i);
  if (clr) SM_CLEAR_NTH_T_NEW(sm,i);

  /* NOTE:Triangles are defined clockwise:historical relative to spherical
     tris: could change
     */
  for(j=2; j>= 0; j--)
  {
      id = T_NTH_V(tri,j);
      glColor3ub(SM_NTH_RGB(sm,id)[0],SM_NTH_RGB(sm,id)[1],
                 SM_NTH_RGB(sm,id)[2]);
      VSUB(p,SM_NTH_WV(sm,id),SM_VIEW_CENTER(sm));
      if(dev_zmin >= 0.99)
       {
           p[0] *= d;
           p[1] *= d;
           p[2] *= d;
       }
      VADD(p,p,vp);
      glVertex3d(p[0],p[1],p[2]);
  }
}

smRender_mesh(sm,vp,clr)
SM *sm;
FVECT vp;
int clr;
{
  int i;
  TRI *tri;
  double ptr[3],d;
  int j;

  d = (dev_zmin+dev_zmax)/2.0;
  glPushAttrib(GL_DEPTH_BUFFER_BIT);
  
  /* First draw background polygons */

  glDisable(GL_DEPTH_TEST);
  glBegin(GL_TRIANGLES);
  SM_FOR_ALL_ACTIVE_BG_TRIS(sm,i)
     smRender_bg_tri(sm,i,vp,d,clr);
  glEnd();
  
  glEnable(GL_DEPTH_TEST);
  glBegin(GL_TRIANGLES);
  SM_FOR_ALL_ACTIVE_FG_TRIS(sm,i)
  {
      if(!SM_MIXED_TRI(sm,i))
        smRender_tri(sm,i,vp,clr);
     else
        smRender_mixed_tri(sm,i,vp,clr);
  }
  glEnd();

  glPopAttrib();
}

smRender_tri_edges(sm,i)
SM *sm;
int i;
{
  TRI *tri;
  int j;
  double ptr[3];


  tri = SM_NTH_TRI(sm,i);

  /* Triangles are defined clockwise:historical relative to spherical
     tris: could change
     */
  for(j=2; j >=0; j--)
  {
    VCOPY(ptr,SM_NTH_WV(sm,T_NTH_V(tri,j)));
    glVertex3d(ptr[0],ptr[1],ptr[2]);
    VCOPY(ptr,SM_NTH_WV(sm,T_NTH_V(tri,(j+1)%3)));
    glVertex3d(ptr[0],ptr[1],ptr[2]);
  }
}

int
compare_tri_depths(T_DEPTH *td1,T_DEPTH *td2)
{
  double d;

  d = td2->depth-td1->depth;
  
  if(d > 0.0)
    return(1);
  if(d < 0.0)
    return(-1);
  
  return(0);
}

LIST
*smDepth_sort_tris(sm,vp,td)
SM *sm;
FVECT vp;
T_DEPTH *td;
{
  int i,j,t_id,v;
  TRI *tri;
  double d,min_d;
  LIST *tlist=NULL;

  i = 0;
  SM_FOR_ALL_NEW_TRIS(sm,t_id)
  {
    if(SM_BG_TRI(sm,t_id))
    {
        tlist = push_data(tlist,t_id);
        continue;
    }
    tri = SM_NTH_TRI(sm,t_id);
    td[i].tri = t_id;
    min_d = -1;
    for(j=0;j < 3;j++)
    {
        v = T_NTH_V(tri,j);
        if(!SM_BG_SAMPLE(sm,v))
        {
            d = DIST(vp,SM_NTH_WV(sm,v));
            if(min_d == -1 || d < min_d)
               min_d = d;
        }
    }
    td[i].depth = min_d;
    i++;
  }
  td[i].tri = -1;
  if(i)
     qsort((void *)td,i,sizeof(T_DEPTH),compare_tri_depths);
  return(tlist);
}


smUpdate_Rendered_mesh(sm,vp,clr)
SM *sm;
FVECT vp;
int clr;
{
  static T_DEPTH *td= NULL;
  static int tsize = 0;
  int i;
  GLint depth_test;
  double d;
  LIST *bglist;
  /* For all of the NEW triangles (since last update): assume
     ACTIVE. Go through and sort on depth value (from vp). Turn
     Depth Buffer test off and render back-front
     */
  /* NOTE: could malloc each time or hard code */
  if(smNew_tri_cnt > tsize)
  {
    if(td)
      free((char *)td);
    td = (T_DEPTH *)malloc(smNew_tri_cnt*sizeof(T_DEPTH));
    tsize = smNew_tri_cnt;
  }
  if(!td)
  {
    error(SYSTEM,"smUpdate_Rendered_mesh:Cannot allocate memory\n");
  }
  bglist = smDepth_sort_tris(sm,vp,td);

  /* Turn Depth Test off -- using Painter's algorithm */
  glPushAttrib(GL_DEPTH_BUFFER_BIT);
  glDisable(GL_DEPTH_TEST);
  d = (dev_zmin+dev_zmax)/2.0;
  /* Now render back-to front */
  /* First render bg triangles */
  glBegin(GL_TRIANGLES);
  while(bglist)
     smRender_bg_tri(sm,pop_list(&bglist),vp,d,clr);
  glEnd();

  glEnable(GL_DEPTH_TEST);
  glBegin(GL_TRIANGLES);
  i=0;
  while(td[i].tri != -1)
     if(!SM_MIXED_TRI(sm,td[i].tri))
        smRender_tri(sm,td[i++].tri,vp,clr);
     else
        smRender_mixed_tri(sm,td[i++].tri,vp,clr);
  glEnd();

  /* Restore Depth Test */
  glPopAttrib();
}

/*
 * smUpdate(view, qua)  : update OpenGL output geometry for view vp
 * VIEW *view;          : desired view
 * int  qual;           : quality level (percentage on linear time scale)
 *
 * Draw new geometric representation using OpenGL calls.  Assume that the
 * view has already been set up and the correct frame buffer has been
 * selected for drawing.  The quality level is on a linear scale, where 100%
 * is full (final) quality.  It is not necessary to redraw geometry that has
 * been output since the last call to smClean().  (The last view drawn will
 * be view==&odev.v each time.)
 */
smUpdate(view,qual)
   VIEW *view;
   int qual;
{
  double d;
  int last_update;
  int t;

  /* If view has moved beyond epsilon from canonical: must rebuild -
     epsilon is calculated as running avg of distance of sample points
     from canonical view: m = 1/(AVG(1/r)): some fraction of this
   */
  d = DIST(view->vp,SM_VIEW_CENTER(smMesh));
  if(qual >= 100 && d > SM_ALLOWED_VIEW_CHANGE(smMesh))
  {
      /* Re-build the mesh */
#ifdef TEST_DRIVER
    odev.v = *view;
#endif    
      smRebuild_mesh(smMesh,view->vp);
  }
  /* This is our final update iff qual==100 and view==&odev.v */
  last_update = qual>=100 && view==&(odev.v);
  /* Check if we should draw ALL triangles in current frustum */
  if(smClean_notify || smNew_tri_cnt > SM_NUM_TRIS(smMesh)*SM_INC_PERCENT)
  {
#ifdef TEST_DRIVER
    glClear(GL_COLOR_BUFFER_BIT | GL_DEPTH_BUFFER_BIT);
#else
    if (SM_TONE_MAP(smMesh) < SM_NUM_SAMP(smMesh))
    {
       tmClearHisto();
       tmAddHisto(SM_BRT(smMesh),SM_NUM_SAMP(smMesh),1);
       if(tmComputeMapping(0.,0.,0.) != TM_E_OK ||
                   tmMapPixels(SM_RGB(smMesh),SM_BRT(smMesh),SM_CHR(smMesh),
                                SM_NUM_SAMP(smMesh)) != TM_E_OK)
            return;
    }
#endif
    mark_tris_in_frustum(view);
    if (qual <= 75)
        smRender_stree(smMesh,qual);
    else
        smRender_mesh(smMesh,view->vp,last_update);
#ifdef TEST_DRIVER
    glFlush();
    glutSwapBuffers();
#endif
  }
  /* Do an incremental update instead */
  else
  {  
    if(!smNew_tri_cnt)
      return;
#ifdef TEST_DRIVER
    glDrawBuffer(GL_FRONT);
#else
    t = SM_TONE_MAP(smMesh);
    if(t == 0)
    {
        tmClearHisto();
        tmAddHisto(SM_BRT(smMesh),SM_NUM_SAMP(smMesh),1);
        if(tmComputeMapping(0.,0.,0.) != TM_E_OK)
           return;
    }
    if(tmMapPixels(SM_NTH_RGB(smMesh,t),&SM_NTH_BRT(smMesh,t),
                   SM_NTH_CHR(smMesh,t), SM_NUM_SAMP(smMesh)-t) != TM_E_OK)
          return;
#endif    
    smUpdate_Rendered_mesh(smMesh,view->vp,last_update);
    
#ifdef TEST_DRIVER
    glDrawBuffer(GL_BACK);
#endif
  }
  SM_TONE_MAP(smMesh) = SM_NUM_SAMP(smMesh);
  if (last_update)
  {
    smClean_notify = FALSE;
    smNew_tri_cnt = 0;
    qtCache_init(0);
  }

}
Revision:	3.5
Committed:	Fri Sep 11 11:52:26 1998 UTC (25 years, 7 months ago) by gwlarson
Content type:	text/plain
Branch:	MAIN
Changes since 3.4:	+16 -19 lines
Log Message:	fixed triangle insertion using edge tracing
#	User	Rev	Content
1	gwlarson	3.1	/* Copyright (c) 1998 Silicon Graphics, Inc. */
2
3			#ifndef lint
4			static char SCCSid[] = "$SunId$ SGI";
5			#endif
6
7			/*
8			* sm_ogl.c
9			*/
10			#include "standard.h"
11
12			#include <GL/gl.h>
13
14			#ifdef TEST_DRIVER
15			#include <gl/device.h>
16			#include <GL/glu.h>
17			#include <glut.h>
18			#endif
19	gwlarson	3.3	#include "sm_list.h"
20	gwlarson	3.1	#include "sm_geom.h"
21			#include "sm.h"
22
23			#ifdef TEST_DRIVER
24			#include "sm_draw.h"
25			/*static char smClean_notify = TRUE;
26			MAKE STATIC LATER: ui.c using for now;
27			*/
28			char smClean_notify = TRUE;
29			#else
30	gwlarson	3.4	static int smClean_notify = TRUE;
31	gwlarson	3.1	#endif
32
33	gwlarson	3.3	typedef struct {
34	gwlarson	3.4	float dist; /* average distance */
35	gwlarson	3.3	BYTE rgb[3]; /* average color */
36			} QTRAVG; /* average quadtree value */
37
38	gwlarson	3.4	typedef struct {
39			QUADTREE qt; /* quadtree node (key & hash value) */
40			QTRAVG av; /* node average */
41			} QT_LUENT; /* lookup table entry */
42	gwlarson	3.3
43	gwlarson	3.5	static QT_LUENT qt_htbl = NULL; / quadtree cache */
44			static int qt_hsiz = 0; /* quadtree cache size */
45	gwlarson	3.3
46
47	gwlarson	3.1	int
48			mark_active_tris(qtptr,arg)
49			QUADTREE *qtptr;
50	gwlarson	3.5	int *arg;
51	gwlarson	3.1	{
52	gwlarson	3.3	QUADTREE qt = *qtptr;
53	gwlarson	3.5	OBJECT os,optr;
54	gwlarson	3.3	register int i,t_id;
55	gwlarson	3.1
56	gwlarson	3.3	if (!QT_IS_LEAF(qt))
57			return(TRUE);
58			/* For each triangle in the set, set the which flag*/
59	gwlarson	3.5	os = qtqueryset(qt);
60	gwlarson	3.1
61	gwlarson	3.3	for (i = QT_SET_CNT(os), optr = QT_SET_PTR(os); i > 0; i--)
62	gwlarson	3.1	{
63	gwlarson	3.3	t_id = QT_SET_NEXT_ELEM(optr);
64			/* Set the render flag */
65			if(SM_IS_NTH_T_BASE(smMesh,t_id))
66	gwlarson	3.1	continue;
67	gwlarson	3.3	SM_SET_NTH_T_ACTIVE(smMesh,t_id);
68			/* FOR NOW:Also set the LRU clock bit: MAY WANT TO CHANGE: */
69			SM_SET_NTH_T_LRU(smMesh,t_id);
70	gwlarson	3.1	}
71			return(TRUE);
72			}
73
74	gwlarson	3.3	mark_tris_in_frustum(view)
75			VIEW *view;
76	gwlarson	3.1	{
77			FVECT nr[4],far[4];
78
79			/* Mark triangles in approx. view frustum as being active:set
80			LRU counter: for use in discarding samples when out
81			of space
82			Radiance often has no far clipping plane: but driver will set
83			dev_zmin,dev_zmax to satisfy OGL
84			*/
85
86	gwlarson	3.3	/* First clear all the quadtree node and triangle active flags */
87			qtClearAllFlags();
88			smClear_flags(smMesh,T_ACTIVE_FLAG);
89	gwlarson	3.1
90			/* calculate the world space coordinates of the view frustum */
91	gwlarson	3.3	calculate_view_frustum(view->vp,view->hvec,view->vvec,view->horiz,
92			view->vert, dev_zmin,dev_zmax,nr,far);
93	gwlarson	3.1
94			/* Project the view frustum onto the spherical quadtree */
95			/* For every cell intersected by the projection of the faces
96			of the frustum: mark all triangles in the cell as ACTIVE-
97			Also set the triangles LRU clock counter
98			*/
99			/* Near face triangles */
100	gwlarson	3.3	smLocator_apply_func(smMesh,nr[0],nr[2],nr[3],mark_active_tris,NULL);
101			smLocator_apply_func(smMesh,nr[2],nr[0],nr[1],mark_active_tris,NULL);
102	gwlarson	3.1	/* Right face triangles */
103	gwlarson	3.3	smLocator_apply_func(smMesh,nr[0],far[3],far[0],mark_active_tris,NULL);
104			smLocator_apply_func(smMesh,far[3],nr[0],nr[3],mark_active_tris,NULL);
105	gwlarson	3.1	/* Left face triangles */
106	gwlarson	3.3	smLocator_apply_func(smMesh,nr[1],far[2],nr[2],mark_active_tris,NULL);
107			smLocator_apply_func(smMesh,far[2],nr[1],far[1],mark_active_tris,NULL);
108	gwlarson	3.1	/* Top face triangles */
109	gwlarson	3.3	smLocator_apply_func(smMesh,nr[0],far[0],nr[1],mark_active_tris,NULL);
110			smLocator_apply_func(smMesh,nr[1],far[0],far[1],mark_active_tris,NULL);
111	gwlarson	3.1	/* Bottom face triangles */
112	gwlarson	3.3	smLocator_apply_func(smMesh,nr[3],nr[2],far[3],mark_active_tris,NULL);
113			smLocator_apply_func(smMesh,nr[2],far[2],far[3],mark_active_tris,NULL);
114	gwlarson	3.1	/* Far face triangles */
115	gwlarson	3.3	smLocator_apply_func(smMesh,far[0],far[2],far[1],mark_active_tris,NULL);
116			smLocator_apply_func(smMesh,far[2],far[0],far[3],mark_active_tris,NULL);
117	gwlarson	3.1
118			#ifdef TEST_DRIVER
119			VCOPY(FrustumFar[0],far[0]);
120			VCOPY(FrustumFar[1],far[1]);
121			VCOPY(FrustumFar[2],far[2]);
122			VCOPY(FrustumFar[3],far[3]);
123			VCOPY(FrustumNear[0],nr[0]);
124			VCOPY(FrustumNear[1],nr[1]);
125			VCOPY(FrustumNear[2],nr[2]);
126			VCOPY(FrustumNear[3],nr[3]);
127			#endif
128			}
129
130			/*
131			* smClean() : display has been wiped clean
132			*
133			* Called after display has been effectively cleared, meaning that all
134			* geometry must be resent down the pipeline in the next call to smUpdate().
135			*/
136			smClean()
137			{
138			smClean_notify = TRUE;
139			}
140
141	gwlarson	3.4	int
142	gwlarson	3.5	qtCache_init(nel) /* initialize for at least nel elements */
143	gwlarson	3.4	int nel;
144			{
145			static int hsiztab[] = {
146			8191, 16381, 32749, 65521, 131071, 262139, 524287, 1048573, 0
147			};
148			register int i;
149	gwlarson	3.1
150	gwlarson	3.4	if (nel <= 0) { /* call to free table */
151			if (qt_hsiz) {
152			free((char *)qt_htbl);
153			qt_htbl = NULL;
154			qt_hsiz = 0;
155			}
156			return(0);
157			}
158			nel += nel>>1; /* 66% occupancy */
159			for (i = 0; hsiztab[i]; i++)
160			if (hsiztab[i] > nel)
161			break;
162			if (!(qt_hsiz = hsiztab[i]))
163			qt_hsiz = nel2 + 1; / not always prime */
164			qt_htbl = (QT_LUENT *)calloc(qt_hsiz, sizeof(QT_LUENT));
165			if (qt_htbl == NULL)
166			qt_hsiz = 0;
167			for (i = qt_hsiz; i--; )
168			qt_htbl[i].qt = EMPTY;
169			return(qt_hsiz);
170			}
171
172			QT_LUENT *
173	gwlarson	3.5	qtCache_find(qt) /* find a quadtree table entry */
174	gwlarson	3.4	QUADTREE qt;
175			{
176			int i, n;
177			register int ndx;
178			register QT_LUENT *le;
179
180	gwlarson	3.5	if (qt_hsiz == 0 && !qtCache_init(1))
181			return(NULL);
182	gwlarson	3.4	tryagain: /* hash table lookup */
183			ndx = (unsigned long)qt % qt_hsiz;
184			for (i = 0, n = 1; i < qt_hsiz; i++, n += 2) {
185			le = &qt_htbl[ndx];
186			if (QT_IS_EMPTY(le->qt) \|\| le->qt == qt)
187			return(le);
188			if ((ndx += n) >= qt_hsiz) /* this happens rarely */
189			ndx = ndx % qt_hsiz;
190			}
191			/* table is full, reallocate */
192			le = qt_htbl;
193			ndx = qt_hsiz;
194	gwlarson	3.5	if (!qtCache_init(ndx+1)) { /* no more memory! */
195	gwlarson	3.4	qt_htbl = le;
196			qt_hsiz = ndx;
197			return(NULL);
198			}
199	gwlarson	3.5	/* copy old table to new and free */
200	gwlarson	3.4	while (ndx--)
201			if (!QT_IS_EMPTY(le[ndx].qt))
202	gwlarson	3.5	copystruct(qtCache_find(le[ndx].qt), &le[ndx]);
203	gwlarson	3.4	free((char *)le);
204			goto tryagain; /* should happen only once! */
205			}
206
207	gwlarson	3.3	stCount_level_leaves(lcnt, qt) /* count quadtree leaf nodes at each level */
208			int lcnt[];
209			register QUADTREE qt;
210			{
211			if (QT_IS_EMPTY(qt))
212			return;
213			if (QT_IS_TREE(qt)) {
214			if (!QT_IS_FLAG(qt)) /* not in our frustum */
215			return;
216			stCount_level_leaves(lcnt+1, QT_NTH_CHILD(qt,0));
217			stCount_level_leaves(lcnt+1, QT_NTH_CHILD(qt,1));
218			stCount_level_leaves(lcnt+1, QT_NTH_CHILD(qt,2));
219			stCount_level_leaves(lcnt+1, QT_NTH_CHILD(qt,3));
220			}
221			else
222			lcnt[0]++;
223			}
224
225
226			QTRAVG *
227			qtRender_level(qt,v0,v1,v2,sm,lvl)
228			QUADTREE qt;
229			FVECT v0,v1,v2;
230	gwlarson	3.1	SM *sm;
231	gwlarson	3.3	int lvl;
232			{
233			FVECT a,b,c;
234	gwlarson	3.4	register QT_LUENT *le;
235	gwlarson	3.3	QTRAVG *rc[4];
236
237			if (QT_IS_EMPTY(qt)) /* empty leaf node */
238			return(NULL);
239			if (QT_IS_TREE(qt) && !QT_IS_FLAG(qt)) /* not in our frustum */
240			return(NULL);
241			/* else look up node */
242	gwlarson	3.5	if ((le = qtCache_find(qt)) == NULL)
243	gwlarson	3.4	error(SYSTEM, "out of memory in qtRender_level");
244			if (QT_IS_TREE(qt) && (QT_IS_EMPTY(le->qt) \|\| lvl > 0))
245	gwlarson	3.3	{ /* compute children */
246			qtSubdivide_tri(v0,v1,v2,a,b,c);
247			rc[0] = qtRender_level(QT_NTH_CHILD(qt,0),v0,a,c,sm,lvl-1);
248			rc[1] = qtRender_level(QT_NTH_CHILD(qt,1),a,v1,b,sm,lvl-1);
249			rc[2] = qtRender_level(QT_NTH_CHILD(qt,2),c,b,v2,sm,lvl-1);
250			rc[3] = qtRender_level(QT_NTH_CHILD(qt,3),b,c,a,sm,lvl-1);
251			}
252	gwlarson	3.4	if (QT_IS_EMPTY(le->qt))
253	gwlarson	3.3	{ /* let's make some data! */
254			int rgbs[3];
255			double distsum;
256	gwlarson	3.4	register int i, n;
257	gwlarson	3.3	/* average our triangle vertices */
258			rgbs[0] = rgbs[1] = rgbs[2] = 0;
259			distsum = 0.; n = 0;
260			if(QT_IS_TREE(qt))
261			{ /* from subtree */
262			for (i = 4; i--; )
263	gwlarson	3.4	if (rc[i] != NULL)
264	gwlarson	3.3	{
265	gwlarson	3.4	rgbs[0] += rc[i]->rgb[0]; rgbs[1] += rc[i]->rgb[1];
266			rgbs[2] += rc[i]->rgb[2]; distsum += rc[i]->dist; n++;
267	gwlarson	3.3	}
268			}
269			else
270			{ /* from triangle set */
271	gwlarson	3.5	OBJECT *os;
272	gwlarson	3.3	int s0, s1, s2;
273
274	gwlarson	3.5	os = qtqueryset(qt);
275	gwlarson	3.3	for (n = os[0]; n; n--)
276			{
277			qtTri_from_id(os[n],a,b,c,NULL,NULL,NULL,&s0,&s1,&s2);
278			distsum += SM_BG_SAMPLE(sm,s0) ? dev_zmax
279			: sqrt(dist2(a,SM_VIEW_CENTER(sm)));
280			distsum += SM_BG_SAMPLE(sm,s1) ? dev_zmax
281			: sqrt(dist2(b,SM_VIEW_CENTER(sm)));
282			distsum += SM_BG_SAMPLE(sm,s2) ? dev_zmax
283			: sqrt(dist2(c,SM_VIEW_CENTER(sm)));
284			rgbs[0] += SM_NTH_RGB(sm,s0)[0] + SM_NTH_RGB(sm,s1)[0]
285			+ SM_NTH_RGB(sm,s2)[0];
286			rgbs[1] += SM_NTH_RGB(sm,s0)[1] + SM_NTH_RGB(sm,s1)[1]
287			+ SM_NTH_RGB(sm,s2)[1];
288			rgbs[2] += SM_NTH_RGB(sm,s0)[2] + SM_NTH_RGB(sm,s1)[2]
289			+ SM_NTH_RGB(sm,s2)[2];
290			}
291			n = 3*os[0];
292			}
293			if (!n)
294			return(NULL);
295	gwlarson	3.4	le->qt = qt;
296			le->av.rgb[0] = rgbs[0]/n; le->av.rgb[1] = rgbs[1]/n;
297			le->av.rgb[2] = rgbs[2]/n; le->av.dist = distsum/(double)n;
298	gwlarson	3.3	}
299			if (lvl == 0 \|\| (lvl > 0 && QT_IS_LEAF(qt)))
300			{ /* render this node */
301			/* compute pseudo vertices */
302			VCOPY(a,v0); VCOPY(b,v1); VCOPY(c,v2);
303			normalize(a); normalize(b); normalize(c);
304	gwlarson	3.4	VSUM(a,SM_VIEW_CENTER(sm),a,le->av.dist);
305			VSUM(b,SM_VIEW_CENTER(sm),b,le->av.dist);
306			VSUM(c,SM_VIEW_CENTER(sm),c,le->av.dist);
307	gwlarson	3.3	/* draw triangle */
308	gwlarson	3.4	glColor3ub(le->av.rgb[0],le->av.rgb[1],le->av.rgb[2]);
309	gwlarson	3.3	/* NOTE: Triangle vertex order may change */
310			glVertex3d(c[0],c[1],c[2]);
311			glVertex3d(b[0],b[1],b[2]);
312			glVertex3d(a[0],a[1],a[2]);
313			}
314	gwlarson	3.4	return(&le->av);
315	gwlarson	3.3	}
316
317
318			smRender_stree_level(sm,lvl)
319			SM *sm;
320			int lvl;
321			{
322			QUADTREE root;
323			int i;
324			FVECT t0,t1,t2;
325
326			if (lvl < 1)
327			return;
328			glPushAttrib(GL_LIGHTING_BIT);
329			glShadeModel(GL_FLAT);
330			glBegin(GL_TRIANGLES);
331			for(i=0; i < 4; i++)
332			{
333			root = ST_NTH_ROOT(SM_LOCATOR(sm),i);
334			stNth_base_verts(SM_LOCATOR(sm),i,t0,t1,t2);
335			qtRender_level(root,t0,t1,t2,sm,lvl-1);
336			}
337			glEnd();
338			glPopAttrib();
339			}
340
341
342			smRender_stree(sm, qual) /* render some quadtree triangles */
343			SM *sm;
344			int qual;
345			{
346			int i, ntarget;
347			int lvlcnt[QT_MAX_LEVELS];
348
349			if (qual <= 0)
350			return;
351			/* compute rendering target */
352			ntarget = 0;
353			SM_FOR_ALL_ACTIVE_TRIS(sm,i)
354			ntarget++;
355			ntarget = ntarget*qual/100;
356			if (!ntarget)
357			return;
358			for (i = QT_MAX_LEVELS; i--; )
359			lvlcnt[i] = 0;
360			stCount_level_leaves(lvlcnt, SM_LOCATOR(sm)->root);
361			for (ntarget -= lvlcnt[i=0]; i < QT_MAX_LEVELS-1; ntarget -= lvlcnt[++i])
362			if (ntarget < lvlcnt[i+1])
363			break;
364			/* compute and render target level */
365			smRender_stree_level(sm,i);
366			}
367
368
369			smRender_tri(sm,i,vp,clr)
370			SM *sm;
371	gwlarson	3.1	int i;
372			FVECT vp;
373	gwlarson	3.3	int clr;
374	gwlarson	3.1	{
375			TRI *tri;
376			double ptr[3];
377			int j;
378
379			tri = SM_NTH_TRI(sm,i);
380	gwlarson	3.3	if (clr) SM_CLEAR_NTH_T_NEW(sm,i);
381
382	gwlarson	3.1	/* NOTE:Triangles are defined clockwise:historical relative to spherical
383			tris: could change
384			*/
385			for(j=2; j>= 0; j--)
386			{
387	gwlarson	3.2	#ifdef DEBUG
388			if(SM_BG_SAMPLE(sm,T_NTH_V(tri,j)))
389			eputs("SmRenderTri(): shouldnt have bg samples\n");
390			#endif
391	gwlarson	3.1	glColor3ub(SM_NTH_RGB(sm,T_NTH_V(tri,j))[0],
392			SM_NTH_RGB(sm,T_NTH_V(tri,j))[1],
393			SM_NTH_RGB(sm,T_NTH_V(tri,j))[2]);
394			VCOPY(ptr,SM_T_NTH_WV(sm,tri,j));
395			glVertex3d(ptr[0],ptr[1],ptr[2]);
396			}
397			}
398
399	gwlarson	3.3	smRender_mixed_tri(sm,i,vp,clr)
400	gwlarson	3.1	SM *sm;
401			int i;
402			FVECT vp;
403	gwlarson	3.3	int clr;
404	gwlarson	3.1	{
405			TRI *tri;
406	gwlarson	3.3	double p[3],d;
407	gwlarson	3.1	int j,ids[3],cnt;
408	gwlarson	3.2	int rgb[3];
409	gwlarson	3.1
410	gwlarson	3.3	tri = SM_NTH_TRI(sm,i);
411			if (clr) SM_CLEAR_NTH_T_NEW(sm,i);
412	gwlarson	3.2
413	gwlarson	3.1	/* NOTE:Triangles are defined clockwise:historical relative to spherical
414			tris: could change
415			*/
416			cnt = 0;
417	gwlarson	3.3	d = 0.0;
418	gwlarson	3.1	rgb[0] = rgb[1] = rgb[2] = 0;
419	gwlarson	3.3	for(j=0;j < 3;j++)
420	gwlarson	3.1	{
421	gwlarson	3.3	ids[j] = T_NTH_V(tri,j);
422			if(!SM_BG_SAMPLE(sm,ids[j]))
423			{
424			rgb[0] += SM_NTH_RGB(sm,ids[j])[0];
425			rgb[1] += SM_NTH_RGB(sm,ids[j])[1];
426			rgb[2] += SM_NTH_RGB(sm,ids[j])[2];
427			cnt++;
428			d += DIST(vp,SM_NTH_WV(sm,ids[j]));
429			}
430	gwlarson	3.1	}
431	gwlarson	3.3	if(cnt > 1)
432	gwlarson	3.1	{
433			rgb[0]/=cnt; rgb[1]/=cnt; rgb[2]/=cnt;
434	gwlarson	3.3	d /= (double)cnt;
435	gwlarson	3.1	}
436			for(j=2; j>= 0; j--)
437			{
438			if(SM_BG_SAMPLE(sm,ids[j]))
439	gwlarson	3.3	{
440			glColor3ub(rgb[0],rgb[1],rgb[2]);
441			VSUB(p,SM_NTH_WV(sm,ids[j]),SM_VIEW_CENTER(sm));
442			p[0] *= d;
443			p[1] *= d;
444			p[2] *= d;
445			VADD(p,p,SM_VIEW_CENTER(sm));
446			}
447	gwlarson	3.1	else
448	gwlarson	3.2	{
449	gwlarson	3.3	glColor3ub(SM_NTH_RGB(sm,ids[j])[0],SM_NTH_RGB(sm,ids[j])[1],
450			SM_NTH_RGB(sm,ids[j])[2]);
451			VCOPY(p,SM_NTH_WV(sm,ids[j]));
452	gwlarson	3.2	}
453	gwlarson	3.1	glVertex3d(p[0],p[1],p[2]);
454	gwlarson	3.3	}
455			}
456
457			smRender_bg_tri(sm,i,vp,d,clr)
458			SM *sm;
459			int i;
460			FVECT vp;
461			double d;
462			int clr;
463			{
464			double p[3];
465			int j,id;
466			TRI *tri;
467
468			tri = SM_NTH_TRI(sm,i);
469			if (clr) SM_CLEAR_NTH_T_NEW(sm,i);
470
471			/* NOTE:Triangles are defined clockwise:historical relative to spherical
472			tris: could change
473			*/
474			for(j=2; j>= 0; j--)
475			{
476			id = T_NTH_V(tri,j);
477			glColor3ub(SM_NTH_RGB(sm,id)[0],SM_NTH_RGB(sm,id)[1],
478			SM_NTH_RGB(sm,id)[2]);
479			VSUB(p,SM_NTH_WV(sm,id),SM_VIEW_CENTER(sm));
480			if(dev_zmin >= 0.99)
481			{
482			p[0] *= d;
483			p[1] *= d;
484			p[2] *= d;
485			}
486			VADD(p,p,vp);
487			glVertex3d(p[0],p[1],p[2]);
488	gwlarson	3.1	}
489			}
490
491	gwlarson	3.3	smRender_mesh(sm,vp,clr)
492	gwlarson	3.1	SM *sm;
493			FVECT vp;
494	gwlarson	3.3	int clr;
495	gwlarson	3.1	{
496			int i;
497			TRI *tri;
498	gwlarson	3.2	double ptr[3],d;
499	gwlarson	3.1	int j;
500
501	gwlarson	3.2	d = (dev_zmin+dev_zmax)/2.0;
502	gwlarson	3.1	glPushAttrib(GL_DEPTH_BUFFER_BIT);
503
504			/* First draw background polygons */
505	gwlarson	3.2
506	gwlarson	3.1	glDisable(GL_DEPTH_TEST);
507			glBegin(GL_TRIANGLES);
508			SM_FOR_ALL_ACTIVE_BG_TRIS(sm,i)
509	gwlarson	3.3	smRender_bg_tri(sm,i,vp,d,clr);
510	gwlarson	3.1	glEnd();
511
512			glEnable(GL_DEPTH_TEST);
513			glBegin(GL_TRIANGLES);
514			SM_FOR_ALL_ACTIVE_FG_TRIS(sm,i)
515	gwlarson	3.3	{
516			if(!SM_MIXED_TRI(sm,i))
517			smRender_tri(sm,i,vp,clr);
518			else
519			smRender_mixed_tri(sm,i,vp,clr);
520			}
521	gwlarson	3.1	glEnd();
522
523			glPopAttrib();
524			}
525	gwlarson	3.3
526	gwlarson	3.1	smRender_tri_edges(sm,i)
527			SM *sm;
528			int i;
529			{
530			TRI *tri;
531			int j;
532			double ptr[3];
533
534
535			tri = SM_NTH_TRI(sm,i);
536
537			/* Triangles are defined clockwise:historical relative to spherical
538			tris: could change
539			*/
540			for(j=2; j >=0; j--)
541			{
542			VCOPY(ptr,SM_NTH_WV(sm,T_NTH_V(tri,j)));
543			glVertex3d(ptr[0],ptr[1],ptr[2]);
544			VCOPY(ptr,SM_NTH_WV(sm,T_NTH_V(tri,(j+1)%3)));
545			glVertex3d(ptr[0],ptr[1],ptr[2]);
546			}
547			}
548
549			int
550			compare_tri_depths(T_DEPTH td1,T_DEPTH td2)
551			{
552			double d;
553
554			d = td2->depth-td1->depth;
555
556			if(d > 0.0)
557			return(1);
558			if(d < 0.0)
559			return(-1);
560
561			return(0);
562			}
563
564	gwlarson	3.3	LIST
565			*smDepth_sort_tris(sm,vp,td)
566	gwlarson	3.1	SM *sm;
567	gwlarson	3.3	FVECT vp;
568	gwlarson	3.1	T_DEPTH *td;
569			{
570	gwlarson	3.3	int i,j,t_id,v;
571	gwlarson	3.1	TRI *tri;
572	gwlarson	3.3	double d,min_d;
573			LIST *tlist=NULL;
574	gwlarson	3.1
575			i = 0;
576			SM_FOR_ALL_NEW_TRIS(sm,t_id)
577			{
578	gwlarson	3.3	if(SM_BG_TRI(sm,t_id))
579	gwlarson	3.1	{
580	gwlarson	3.3	tlist = push_data(tlist,t_id);
581			continue;
582	gwlarson	3.1	}
583			tri = SM_NTH_TRI(sm,t_id);
584			td[i].tri = t_id;
585	gwlarson	3.3	min_d = -1;
586	gwlarson	3.1	for(j=0;j < 3;j++)
587	gwlarson	3.3	{
588			v = T_NTH_V(tri,j);
589			if(!SM_BG_SAMPLE(sm,v))
590			{
591			d = DIST(vp,SM_NTH_WV(sm,v));
592			if(min_d == -1 \|\| d < min_d)
593			min_d = d;
594			}
595			}
596			td[i].depth = min_d;
597	gwlarson	3.1	i++;
598			}
599	gwlarson	3.3	td[i].tri = -1;
600			if(i)
601			qsort((void *)td,i,sizeof(T_DEPTH),compare_tri_depths);
602			return(tlist);
603	gwlarson	3.1	}
604
605
606	gwlarson	3.3	smUpdate_Rendered_mesh(sm,vp,clr)
607	gwlarson	3.1	SM *sm;
608	gwlarson	3.3	FVECT vp;
609			int clr;
610	gwlarson	3.1	{
611			static T_DEPTH *td= NULL;
612			static int tsize = 0;
613			int i;
614			GLint depth_test;
615	gwlarson	3.2	double d;
616	gwlarson	3.3	LIST *bglist;
617	gwlarson	3.1	/* For all of the NEW triangles (since last update): assume
618			ACTIVE. Go through and sort on depth value (from vp). Turn
619			Depth Buffer test off and render back-front
620			*/
621			/* NOTE: could malloc each time or hard code */
622			if(smNew_tri_cnt > tsize)
623			{
624			if(td)
625	gwlarson	3.3	free((char *)td);
626	gwlarson	3.1	td = (T_DEPTH )malloc(smNew_tri_cntsizeof(T_DEPTH));
627			tsize = smNew_tri_cnt;
628			}
629			if(!td)
630			{
631			error(SYSTEM,"smUpdate_Rendered_mesh:Cannot allocate memory\n");
632			}
633	gwlarson	3.3	bglist = smDepth_sort_tris(sm,vp,td);
634	gwlarson	3.1
635	gwlarson	3.3	/* Turn Depth Test off -- using Painter's algorithm */
636	gwlarson	3.1	glPushAttrib(GL_DEPTH_BUFFER_BIT);
637	gwlarson	3.3	glDisable(GL_DEPTH_TEST);
638	gwlarson	3.2	d = (dev_zmin+dev_zmax)/2.0;
639	gwlarson	3.1	/* Now render back-to front */
640			/* First render bg triangles */
641			glBegin(GL_TRIANGLES);
642	gwlarson	3.3	while(bglist)
643			smRender_bg_tri(sm,pop_list(&bglist),vp,d,clr);
644	gwlarson	3.1	glEnd();
645
646			glEnable(GL_DEPTH_TEST);
647			glBegin(GL_TRIANGLES);
648	gwlarson	3.3	i=0;
649			while(td[i].tri != -1)
650			if(!SM_MIXED_TRI(sm,td[i].tri))
651			smRender_tri(sm,td[i++].tri,vp,clr);
652			else
653			smRender_mixed_tri(sm,td[i++].tri,vp,clr);
654	gwlarson	3.1	glEnd();
655
656			/* Restore Depth Test */
657			glPopAttrib();
658			}
659
660			/*
661	gwlarson	3.3	* smUpdate(view, qua) : update OpenGL output geometry for view vp
662			* VIEW *view; : desired view
663	gwlarson	3.1	* int qual; : quality level (percentage on linear time scale)
664			*
665			* Draw new geometric representation using OpenGL calls. Assume that the
666			* view has already been set up and the correct frame buffer has been
667			* selected for drawing. The quality level is on a linear scale, where 100%
668			* is full (final) quality. It is not necessary to redraw geometry that has
669	gwlarson	3.3	* been output since the last call to smClean(). (The last view drawn will
670			* be view==&odev.v each time.)
671	gwlarson	3.1	*/
672	gwlarson	3.3	smUpdate(view,qual)
673			VIEW *view;
674	gwlarson	3.1	int qual;
675			{
676			double d;
677	gwlarson	3.3	int last_update;
678	gwlarson	3.1	int t;
679	gwlarson	3.3
680	gwlarson	3.1	/* If view has moved beyond epsilon from canonical: must rebuild -
681			epsilon is calculated as running avg of distance of sample points
682	gwlarson	3.3	from canonical view: m = 1/(AVG(1/r)): some fraction of this
683	gwlarson	3.1	*/
684	gwlarson	3.3	d = DIST(view->vp,SM_VIEW_CENTER(smMesh));
685	gwlarson	3.1	if(qual >= 100 && d > SM_ALLOWED_VIEW_CHANGE(smMesh))
686			{
687			/* Re-build the mesh */
688	gwlarson	3.3	#ifdef TEST_DRIVER
689			odev.v = *view;
690			#endif
691			smRebuild_mesh(smMesh,view->vp);
692	gwlarson	3.1	}
693	gwlarson	3.3	/* This is our final update iff qual==100 and view==&odev.v */
694			last_update = qual>=100 && view==&(odev.v);
695			/* Check if we should draw ALL triangles in current frustum */
696			if(smClean_notify \|\| smNew_tri_cnt > SM_NUM_TRIS(smMesh)*SM_INC_PERCENT)
697	gwlarson	3.1	{
698			#ifdef TEST_DRIVER
699			glClear(GL_COLOR_BUFFER_BIT \| GL_DEPTH_BUFFER_BIT);
700			#else
701	gwlarson	3.3	if (SM_TONE_MAP(smMesh) < SM_NUM_SAMP(smMesh))
702			{
703			tmClearHisto();
704			tmAddHisto(SM_BRT(smMesh),SM_NUM_SAMP(smMesh),1);
705			if(tmComputeMapping(0.,0.,0.) != TM_E_OK \|\|
706			tmMapPixels(SM_RGB(smMesh),SM_BRT(smMesh),SM_CHR(smMesh),
707			SM_NUM_SAMP(smMesh)) != TM_E_OK)
708			return;
709			}
710	gwlarson	3.1	#endif
711	gwlarson	3.3	mark_tris_in_frustum(view);
712			if (qual <= 75)
713			smRender_stree(smMesh,qual);
714			else
715			smRender_mesh(smMesh,view->vp,last_update);
716	gwlarson	3.1	#ifdef TEST_DRIVER
717			glFlush();
718			glutSwapBuffers();
719			#endif
720			}
721			/* Do an incremental update instead */
722			else
723			{
724			if(!smNew_tri_cnt)
725			return;
726			#ifdef TEST_DRIVER
727			glDrawBuffer(GL_FRONT);
728			#else
729			t = SM_TONE_MAP(smMesh);
730			if(t == 0)
731			{
732			tmClearHisto();
733			tmAddHisto(SM_BRT(smMesh),SM_NUM_SAMP(smMesh),1);
734			if(tmComputeMapping(0.,0.,0.) != TM_E_OK)
735			return;
736			}
737			if(tmMapPixels(SM_NTH_RGB(smMesh,t),&SM_NTH_BRT(smMesh,t),
738			SM_NTH_CHR(smMesh,t), SM_NUM_SAMP(smMesh)-t) != TM_E_OK)
739			return;
740			#endif
741	gwlarson	3.3	smUpdate_Rendered_mesh(smMesh,view->vp,last_update);
742	gwlarson	3.1
743			#ifdef TEST_DRIVER
744			glDrawBuffer(GL_BACK);
745			#endif
746			}
747			SM_TONE_MAP(smMesh) = SM_NUM_SAMP(smMesh);
748	gwlarson	3.3	if (last_update)
749			{
750			smClean_notify = FALSE;
751			smNew_tri_cnt = 0;
752	gwlarson	3.5	qtCache_init(0);
753	gwlarson	3.3	}
754
755	gwlarson	3.1	}