home *** CD-ROM | disk | FTP | other *** search
/ DP Tool Club 21 / CD_ASCQ_21_040595.iso / dos / graphic / font3d11 / f3d_src / build.cpp < prev    next >
C/C++ Source or Header  |  1994-10-12  |  18KB  |  498 lines
  1. //=================================================================================================
  2. //   Build.CPP
  3. //-------------------------------------------------------------------------------------------------
  4. //
  5. //   Copyright (c) 1994 by Todd A. Prater
  6. //   All rights reserved.
  7. //
  8. //=================================================================================================
  9.  
  10.  
  11. #include <stdlib.h>
  12. #include <fstream.h>
  13. #include "Config.H"
  14. #include "Vector.H"
  15. #include "TrueType.H"
  16. #include "Geometry.H"
  17. #include "Build.H"
  18.  
  19. #define IGNORE  2
  20. #define INSIDE  1
  21. #define OUTSIDE 0
  22.  
  23.  
  24.  
  25. //  ******************************************************
  26. //         NOTE:  Please excuse the debugging code
  27. //  ******************************************************
  28.  
  29.  
  30.  
  31. //===========================================================================================================
  32. //  PolygonizeContour                                                                                        
  33. //-----------------------------------------------------------------------------------------------------------
  34. //===========================================================================================================
  35.  
  36. void PolygonizeContour(TTFont&   font,
  37.                        USHORT  glyphnum,
  38.                        USHORT  contournum,
  39.                        USHORT  resolution,
  40.                        DOUBLE    depth,
  41.                        POLYGON&  polygon    )
  42. {
  43.  
  44.    ULONG  i,j;
  45.    ULONG  polyi;
  46.    ULONG  offcount;
  47.    ULONG  consecutiveoffcount;
  48.    INT    lastwasoff;
  49.    VECTOR cp1,cp2,cp3,cur_point,prev_point,next_point;
  50.    DOUBLE tstep;
  51.  
  52.    if (font.NumContours(glyphnum)<1)
  53.       return;
  54.  
  55.    if (contournum>=font.NumContours(glyphnum))
  56.       return;
  57.  
  58.    if(polygon.numpoints>0)
  59.    {
  60.       delete polygon.pointlist;
  61.       polygon.numpoints=0;
  62.    }
  63.  
  64.    lastwasoff=0; 
  65.    consecutiveoffcount=0; 
  66.    offcount=0;
  67.    for(i=0;i<font.NumPoints(glyphnum,contournum);i++)
  68.    {
  69. //      if (font.FontPointType(glyphnum,contournum,i)==ON_CURVE) cout<<i<<": ON"<<endl;
  70. //      else cout<<i<<": OFF"<<endl;
  71.       if(font.FontPointType(glyphnum,contournum,i)==OFF_CURVE)
  72.       {
  73.          offcount++;
  74.          if(lastwasoff)
  75.             consecutiveoffcount++;
  76.          lastwasoff=1;
  77.       }
  78.       else
  79.          lastwasoff=0;
  80.    }
  81.  
  82.    polygon.numpoints = font.NumPoints(glyphnum,contournum) + offcount*(resolution-2) + consecutiveoffcount;
  83.    polygon.pointlist = new VECTOR[polygon.numpoints+40];  // Temporary fix (give some playing room...)
  84.  
  85.    polyi=0;
  86.  
  87. //   pointcount = font.NumPoints(glyphnum,contournum);
  88.    for(i=0;i<font.NumPoints(glyphnum,contournum);i++)
  89.    {
  90.  
  91.       if (font.FontPointType(glyphnum,contournum,i)==ON_CURVE)
  92.       {
  93. //cout<<"OnCURVE: "<<i<<endl;
  94.          polygon.pointlist[polyi] = VECTOR((DOUBLE)font.FontPointX(glyphnum,contournum,i)/(DOUBLE)font.UnitsPerEm(),
  95.                                     (DOUBLE)font.FontPointY(glyphnum,contournum,i)/(DOUBLE)font.UnitsPerEm(), depth);
  96.          polyi++;
  97.       }
  98.       else
  99.       {
  100. //cout<<"OffCURVE:  "<<i<<endl;
  101.          if(font.FontPointType(glyphnum,contournum,i-1)==ON_CURVE)
  102.          {
  103.             cp1 = VECTOR((DOUBLE)font.FontPointX(glyphnum,contournum,i-1)/(DOUBLE)font.UnitsPerEm(),
  104.                         (DOUBLE)font.FontPointY(glyphnum,contournum,i-1)/(DOUBLE)font.UnitsPerEm(), depth);
  105.          }
  106.          else
  107.          {
  108.             cp1 = VECTOR(((DOUBLE)font.FontPointX(glyphnum,contournum,i-1)+(DOUBLE)font.FontPointX(glyphnum,contournum,i))/2/(DOUBLE)font.UnitsPerEm(),
  109.                         ((DOUBLE)font.FontPointY(glyphnum,contournum,i-1)+(DOUBLE)font.FontPointY(glyphnum,contournum,i))/2/(DOUBLE)font.UnitsPerEm(), depth);
  110.          }
  111.  
  112.          cp2 = VECTOR((DOUBLE)font.FontPointX(glyphnum,contournum,i)/(DOUBLE)font.UnitsPerEm(),
  113.                      (DOUBLE)font.FontPointY(glyphnum,contournum,i)/(DOUBLE)font.UnitsPerEm(), depth);
  114.  
  115.          if (i==(font.NumPoints(glyphnum,contournum)-1))
  116.          {
  117. //cout<<"THE LAST ONE"<<endl;
  118.             cp3 = VECTOR((DOUBLE)font.FontPointX(glyphnum,contournum,0)/(DOUBLE)font.UnitsPerEm(),
  119.                         (DOUBLE)font.FontPointY(glyphnum,contournum,0)/(DOUBLE)font.UnitsPerEm(), depth);
  120.          }
  121.          else
  122.          {
  123.             if(font.FontPointType(glyphnum,contournum,i+1)==ON_CURVE)
  124.             {
  125.                cp3 = VECTOR((DOUBLE)font.FontPointX(glyphnum,contournum,i+1)/(DOUBLE)font.UnitsPerEm(),
  126.                            (DOUBLE)font.FontPointY(glyphnum,contournum,i+1)/(DOUBLE)font.UnitsPerEm(), depth);
  127.                i++;
  128.             }
  129.             else
  130.             {
  131.                cp3 = VECTOR(((DOUBLE)font.FontPointX(glyphnum,contournum,i)+(DOUBLE)font.FontPointX(glyphnum,contournum,i+1))/2/(DOUBLE)font.UnitsPerEm(),
  132.                            ((DOUBLE)font.FontPointY(glyphnum,contournum,i)+(DOUBLE)font.FontPointY(glyphnum,contournum,i+1))/2/(DOUBLE)font.UnitsPerEm(), depth);
  133.             }
  134.          }
  135.  
  136.          tstep = 1.0/(DOUBLE)resolution;
  137.          for(j=0;j<resolution;j++)
  138.          {
  139.             polygon.pointlist[polyi] = ApproximateQuadraticSpline(cp1,cp2,cp3,tstep*(j+1));
  140.             polyi++;
  141.          }
  142.       }
  143.    }
  144.  
  145. if (   (polygon.pointlist[polyi-1].x==polygon.pointlist[0].x)
  146.     && (polygon.pointlist[polyi-1].y==polygon.pointlist[0].y))
  147. { 
  148. //cout<<"LAST IS FIRST"<<endl;
  149. polyi--;  //temporary fix....
  150. }
  151.  
  152.    polygon.numpoints = polyi;
  153.    polygon.orientation = polygon.findOrientation();
  154.  
  155. //cout<<polygon<<"P";
  156. }
  157.  
  158.  
  159.  
  160. //===========================================================================================================
  161. //  TriangulateFace                                                                                          
  162. //-----------------------------------------------------------------------------------------------------------
  163. //===========================================================================================================
  164.  
  165.  
  166. void TriangulateFace (TTFont&         font,
  167.                       USHORT        glyphnum,
  168.                       USHORT        resolution,
  169.                       DOUBLE           shrinkFactor,
  170.                       LIST<TRIANGLE>&  triangleList)
  171. {
  172.  
  173.  
  174.    int         i,j,k;
  175.    BOOLEAN     isAPair;
  176.    SHORT     contourCount;
  177.    POLYGON*    polyarray;
  178.    POLYGON*    shrunkpolyarray;
  179.    BYTEPTR*  relationship;
  180.  
  181.    contourCount = font.NumContours(glyphnum);
  182.    if (contourCount<1) return;
  183.  
  184.    polyarray = new POLYGON[contourCount];
  185.    if (polyarray==NULL) { cout<<"ERROR: Out of memory."<<endl; exit(1); }
  186.  
  187.    shrunkpolyarray=new POLYGON[contourCount];
  188.    if (shrunkpolyarray==NULL) { cout<<"ERROR: Out of memory."<<endl; exit(1); }
  189.  
  190.    relationship = new BYTEPTR[contourCount];
  191.    if (relationship==NULL) { cout<<"ERROR: Out of memory."<<endl; exit(1); }
  192.    for (i=0;i<contourCount;i++)
  193.    {
  194.       relationship[i] = new BYTE[contourCount];
  195.       if (relationship[i]==NULL) { cout<<"ERROR: Out of memory."<<endl; exit(1); }
  196.    }
  197.  
  198.    for (i=0;i<contourCount;i++)
  199.    {
  200.       PolygonizeContour(font,glyphnum,i,resolution,0.0,polyarray[i]);
  201.       if (shrinkFactor>0.0)
  202.          polyarray[i].Shrink(shrunkpolyarray[i],shrinkFactor);
  203.    }
  204.  
  205.  
  206.  
  207.    for (i=0;i<contourCount;i++)
  208.       for (j=0;j<contourCount;j++)
  209.          if (i==j)
  210.             relationship[i][j]=IGNORE;
  211.          else if (polyarray[j].isInside(polyarray[i]))
  212.             relationship[i][j]=INSIDE;
  213.          else
  214.             relationship[i][j]=OUTSIDE;
  215.  
  216.  
  217.    for (i=0;i<contourCount;i++)
  218.    {
  219.       if (polyarray[i].orientation==CLOCKWISE)
  220.       {
  221.          for (j=0;j<contourCount;j++)
  222.          {
  223.             isAPair=FALSE;
  224.             if (relationship[i][j]==INSIDE && polyarray[j].orientation==COUNTER_CLOCKWISE)
  225.             {
  226.                isAPair=TRUE;
  227.                for (k=0;k<contourCount;k++)
  228.                {
  229.                   if (k==j || k==i || relationship[k][j]==IGNORE) continue;
  230.                   if (relationship[k][j]==INSIDE)
  231.                   {
  232.                      if (relationship[i][k]==INSIDE)
  233.                      {
  234.                         isAPair=FALSE;
  235.                         exit;
  236.                      }
  237.                   }
  238.                   else
  239.                      continue;
  240.                }
  241.             }
  242.             if (isAPair)
  243.             {
  244.                if (shrinkFactor>0.0)
  245.                  shrunkpolyarray[i].Combine(shrunkpolyarray[j]);
  246.                else
  247.                   polyarray[i].Combine(polyarray[j]);
  248.  
  249.                relationship[i][j]=IGNORE;
  250.             }
  251.          }
  252.       }
  253.    }
  254.  
  255.  
  256.    for (i=0;i<contourCount;i++)
  257.    {
  258.       if (polyarray[i].orientation==CLOCKWISE)
  259.       {
  260.          if (shrinkFactor>0.0)
  261.             shrunkpolyarray[i].Triangulate(triangleList);
  262.          else
  263.             polyarray[i].Triangulate(triangleList);
  264.       }
  265.    }
  266.  
  267.  
  268.    for (i=0;i<contourCount;i++)
  269.    {
  270.       delete polyarray[i].pointlist;
  271.       delete shrunkpolyarray[i].pointlist;
  272.       delete relationship[i];
  273.    }
  274.    delete polyarray;
  275.    delete shrunkpolyarray;
  276.    delete relationship;
  277.  
  278. }
  279.  
  280.  
  281.  
  282. //===========================================================================================================
  283. //  TriangulateEdges                                                                                         
  284. //-----------------------------------------------------------------------------------------------------------
  285. //===========================================================================================================
  286.  
  287.  
  288. void TriangulateEdges(TTFont&          font,
  289.                       USHORT           glyphnum,
  290.                       USHORT           resolution,
  291.                       INT              effects,
  292.                       DOUBLE           frontDepth,
  293.                       DOUBLE           backDepth,
  294.                       DOUBLE           faceShrink,
  295.                       DOUBLE           edgeShrink,
  296.                       DOUBLE           angleThreshold,
  297.                       LIST<TRIANGLE>&  edgeList,
  298.                       LIST<TRIANGLE>&  bevelList)
  299. {
  300.  
  301.  
  302.    INT         i,j;
  303.    TRIANGLE*   t1;
  304.    TRIANGLE*   t2;
  305.    TRIANGLE*   t3;
  306.    TRIANGLE*   t4;
  307.    TRIANGLE*   t5;
  308.    TRIANGLE*   t6;
  309.    VECTOR      tt1,tt2,tt3,tt4;
  310.    VECTOR      previous,current1,current2,next;
  311.    VECTOR      shrunkCurrent1,shrunkCurrent2;
  312.    VECTOR      previousFacet,currentFacet,nextFacet;
  313.    VECTOR      previousFacetNormal,currentFacetNormal,nextFacetNormal;
  314.    VECTOR      averageNormal1,averageNormal2;
  315.    VECTOR      frontBevelNormal1,frontBevelNormal2,backBevelNormal1,backBevelNormal2;
  316.    VECTOR      p1,p2,p3,p4,p5,p6,p7,p8;
  317.    ULONG       numberOfPoints;
  318.    SHORT       contourCount;
  319.    POLYGON*    polyarray;
  320.    POLYGON*    shrunkPolyarray;
  321.    VECTOR      zDir(0,0,1);
  322.    DOUBLE      angle1,angle2;
  323.    BOOLEAN     doBevels=TRUE;
  324.    
  325.    contourCount = font.NumContours(glyphnum);
  326.    if (contourCount<1) return;
  327.  
  328.    polyarray = new POLYGON[contourCount];
  329.    if (polyarray==NULL)
  330.    {
  331.       cout<<"ERROR: Out of memory."<<endl;
  332.       exit(1);
  333.    }
  334.  
  335.  
  336.    if (faceShrink==0.0 && edgeShrink==0.0) doBevels=FALSE;
  337.  
  338.    if (doBevels)
  339.    {
  340.      shrunkPolyarray = new POLYGON[contourCount];
  341.      if (shrunkPolyarray==NULL)
  342.      {
  343.        cout<<"ERROR: Out of memory."<<endl;
  344.        exit(1);
  345.      }
  346.    }
  347.  
  348.    for (i=0;i<contourCount;i++)
  349.    {
  350.       PolygonizeContour(font,glyphnum,i,resolution,0.0,polyarray[i]);
  351.       if (doBevels) polyarray[i].Shrink(shrunkPolyarray[i],faceShrink);
  352.    }
  353.  
  354.  
  355.    for (i=0;i<contourCount;i++)
  356.    {
  357.       numberOfPoints  = polyarray[i].numpoints;
  358.  
  359.       for (j=0;j<numberOfPoints;j++)
  360.       {
  361.  
  362.          if (j==numberOfPoints-2)
  363.          {
  364.             previous = polyarray[i].pointlist[j-1];
  365.             current1 = polyarray[i].pointlist[j];
  366.             if (doBevels) shrunkCurrent1 = shrunkPolyarray[i].pointlist[j];
  367.             current2 = polyarray[i].pointlist[j+1];
  368.             if (doBevels) shrunkCurrent2 = shrunkPolyarray[i].pointlist[j+1];
  369.             next     = polyarray[i].pointlist[0];
  370.          }
  371.          else if (j==numberOfPoints-1)
  372.          {
  373.             previous = polyarray[i].pointlist[j-1];
  374.             current1 = polyarray[i].pointlist[j];
  375.             if (doBevels) shrunkCurrent1 = shrunkPolyarray[i].pointlist[j];
  376.             current2 = polyarray[i].pointlist[0];
  377.             if (doBevels) shrunkCurrent2 = shrunkPolyarray[i].pointlist[0];
  378.             next     = polyarray[i].pointlist[1];
  379.          }
  380.          else if (j==0)
  381.          {
  382.             previous = polyarray[i].pointlist[numberOfPoints-1];
  383.             current1 = polyarray[i].pointlist[j];
  384.             if (doBevels) shrunkCurrent1 = shrunkPolyarray[i].pointlist[j];
  385.             current2 = polyarray[i].pointlist[j+1];
  386.             if (doBevels) shrunkCurrent2 = shrunkPolyarray[i].pointlist[j+1];
  387.             next     = polyarray[i].pointlist[j+2];
  388.          }
  389.          else
  390.          {
  391.             previous = polyarray[i].pointlist[j-1];
  392.             current1 = polyarray[i].pointlist[j];
  393.             if (doBevels) shrunkCurrent1 = shrunkPolyarray[i].pointlist[j];
  394.             current2 = polyarray[i].pointlist[j+1];
  395.             if (doBevels) shrunkCurrent2 = shrunkPolyarray[i].pointlist[j+1];
  396.             next     = polyarray[i].pointlist[j+2];
  397.          }
  398.             
  399.          previousFacet = ~(current1-previous);
  400.          currentFacet  = ~(current2-current1);
  401.          nextFacet     = ~(next-current2);
  402.  
  403.          previousFacetNormal = zDir^previousFacet;
  404.          currentFacetNormal  = zDir^currentFacet;
  405.          nextFacetNormal     = zDir^nextFacet;
  406.  
  407.          
  408.  
  409.          angle1 = acos(previousFacetNormal%currentFacetNormal);
  410.          angle2 = acos(currentFacetNormal%nextFacetNormal);
  411.  
  412.          if (angle1<angleThreshold)
  413.             averageNormal1 = ~(previousFacetNormal+currentFacetNormal);
  414.          else
  415.             averageNormal1 = currentFacetNormal;
  416.  
  417.          tt1 = zDir*edgeShrink;
  418.          tt2 = averageNormal1*faceShrink;
  419.  
  420.          tt3 = tt1+tt2;
  421.          tt4 = tt2-tt1;
  422.  
  423.          if (doBevels) frontBevelNormal1   = ~(tt3);
  424.          if (doBevels) backBevelNormal1    = ~(tt4);
  425.  
  426.          if (angle2<angleThreshold)
  427.             averageNormal2 = ~(currentFacetNormal+nextFacetNormal);
  428.          else
  429.             averageNormal2 = currentFacetNormal;
  430.  
  431.          if (doBevels) frontBevelNormal2 = ~(zDir*edgeShrink + averageNormal2*faceShrink);
  432.          if (doBevels) backBevelNormal2  = ~(-zDir*edgeShrink + averageNormal2*faceShrink);
  433.  
  434.          if (doBevels) p1 = shrunkCurrent1; p1.z=frontDepth;
  435.          if (doBevels) p2 = shrunkCurrent2; p2.z=frontDepth;
  436.          p3 = current1      ; p3.z=frontDepth-edgeShrink;
  437.          p4 = current2      ; p4.z=frontDepth-edgeShrink;
  438.          p5 = current1      ; p5.z=backDepth+edgeShrink;
  439.          p6 = current2      ; p6.z=backDepth+edgeShrink;
  440.          if (doBevels) p7 = shrunkCurrent1; p7.z=backDepth;
  441.          if (doBevels) p8 = shrunkCurrent2; p8.z=backDepth;
  442.  
  443.  
  444.          t3 = new TRIANGLE(p3,p5,p6,averageNormal1,averageNormal1,averageNormal2);
  445.          if (t3==NULL) { cout<<"ERROR: Out of memory"<<endl; exit(1); }
  446.          t4 = new TRIANGLE(p3,p6,p4,averageNormal1,averageNormal2,averageNormal2);
  447.          if (t4==NULL) { cout<<"ERROR: Out of memory"<<endl; exit(1); }
  448.  
  449.          if (doBevels)
  450.          {
  451.            if (effects==BEVEL)
  452.            {
  453.              t1 = new TRIANGLE(p1,p2,p3,frontBevelNormal1,frontBevelNormal2,frontBevelNormal1);
  454.              if (t1==NULL) { cout<<"ERROR: Out of memory"<<endl; exit(1); }
  455.              t2 = new TRIANGLE(p2,p3,p4,frontBevelNormal2,frontBevelNormal1,frontBevelNormal2);
  456.              if (t2==NULL) { cout<<"ERROR: Out of memory"<<endl; exit(1); }
  457.              t5 = new TRIANGLE(p5,p7,p6,backBevelNormal1,backBevelNormal1,backBevelNormal2);
  458.              if (t5==NULL) { cout<<"ERROR: Out of memory"<<endl; exit(1); }
  459.              t6 = new TRIANGLE(p7,p8,p6,backBevelNormal1,backBevelNormal2,backBevelNormal2);
  460.              if (t6==NULL) { cout<<"ERROR: Out of memory"<<endl; exit(1); }
  461.            }
  462.            else
  463.            {
  464.              t1 = new TRIANGLE(p1,p2,p3,zDir,zDir,averageNormal1);
  465.              if (t1==NULL) { cout<<"ERROR: Out of memory"<<endl; exit(1); }
  466.              t2 = new TRIANGLE(p2,p3,p4,zDir,averageNormal1,averageNormal2);
  467.              if (t2==NULL) { cout<<"ERROR: Out of memory"<<endl; exit(1); }
  468.              t5 = new TRIANGLE(p5,p7,p6,averageNormal1,-zDir,averageNormal2);
  469.              if (t5==NULL) { cout<<"ERROR: Out of memory"<<endl; exit(1); }
  470.              t6 = new TRIANGLE(p7,p8,p6,-zDir,-zDir,averageNormal2);
  471.              if (t6==NULL) { cout<<"ERROR: Out of memory"<<endl; exit(1); }
  472.            }
  473.          }
  474.  
  475.          edgeList.Add(t3);
  476.          edgeList.Add(t4);
  477.          if (doBevels)
  478.          {
  479.            bevelList.Add(t1);
  480.            bevelList.Add(t2);
  481.            bevelList.Add(t5);
  482.            bevelList.Add(t6);
  483.          }
  484.       }
  485.  
  486.    }
  487.  
  488.    for (i=0;i<contourCount;i++)
  489.    {
  490.      delete polyarray[i].pointlist;
  491.      if (doBevels) delete shrunkPolyarray[i].pointlist;
  492.    }
  493.    delete polyarray;
  494.    if (doBevels) delete shrunkPolyarray;
  495.  
  496. }
  497.  
  498.