src/glu/sgi/libnurbs/internals/knotvector.cc

   1 /*
   2 ** License Applicability. Except to the extent portions of this file are
   3 ** made subject to an alternative license as permitted in the SGI Free
   4 ** Software License B, Version 1.1 (the "License"), the contents of this
   5 ** file are subject only to the provisions of the License. You may not use
   6 ** this file except in compliance with the License. You may obtain a copy
   7 ** of the License at Silicon Graphics, Inc., attn: Legal Services, 1600
   8 ** Amphitheatre Parkway, Mountain View, CA 94043-1351, or at:
   9 **
  10 ** http://oss.sgi.com/projects/FreeB
  11 **
  12 ** Note that, as provided in the License, the Software is distributed on an
  13 ** "AS IS" basis, with ALL EXPRESS AND IMPLIED WARRANTIES AND CONDITIONS
  14 ** DISCLAIMED, INCLUDING, WITHOUT LIMITATION, ANY IMPLIED WARRANTIES AND
  15 ** CONDITIONS OF MERCHANTABILITY, SATISFACTORY QUALITY, FITNESS FOR A
  16 ** PARTICULAR PURPOSE, AND NON-INFRINGEMENT.
  17 **
  18 ** Original Code. The Original Code is: OpenGL Sample Implementation,
  19 ** Version 1.2.1, released January 26, 2000, developed by Silicon Graphics,
  20 ** Inc. The Original Code is Copyright (c) 1991-2000 Silicon Graphics, Inc.
  21 ** Copyright in any portions created by third parties is as indicated
  22 ** elsewhere herein. All Rights Reserved.
  23 **
  24 ** Additional Notice Provisions: The application programming interfaces
  25 ** established by SGI in conjunction with the Original Code are The
  26 ** OpenGL(R) Graphics System: A Specification (Version 1.2.1), released
  27 ** April 1, 1999; The OpenGL(R) Graphics System Utility Library (Version
  28 ** 1.3), released November 4, 1998; and OpenGL(R) Graphics with the X
  29 ** Window System(R) (Version 1.3), released October 19, 1998. This software
  30 ** was created using the OpenGL(R) version 1.2.1 Sample Implementation
  31 ** published by SGI, but has not been independently verified as being
  32 ** compliant with the OpenGL(R) version 1.2.1 Specification.
  33 */
  34
  35 /*
  36  * knotvector.c++
  37  *
  38  * $Date: 2003/10/14 23:48:57 $ $Revision: 1.2 $
  39  * $Header: /home/krh/git/sync/mesa-cvs-repo/Mesa/src/glu/sgi/libnurbs/internals/knotvector.cc,v 1.2 2003/10/14 23:48:57 kendallb Exp $
  40  */
  41
  42 #include "glimports.h"
  43 #include "mystdio.h"
  44 #include "myassert.h"
  45 #include "knotvector.h"
  46 #include "defines.h"
  47
  48 #ifdef __WATCOMC__
  49 #pragma warning 726 10
  50 #endif
  51
  52 void Knotvector::init( long _knotcount, long _stride, long _order, INREAL *_knotlist )
  53 {
  54     knotcount = _knotcount;
  55     stride = _stride;
  56     order = _order;
  57     knotlist = new Knot[_knotcount];
  58     assert( knotlist != 0 );
  59
  60     for( int i = 0; i != _knotcount; i++ )
  61         knotlist[i] = (Knot) _knotlist[i];
  62 }
  63
  64 Knotvector::Knotvector( void )
  65 {
  66     knotlist = 0;
  67 }
  68
  69 Knotvector::~Knotvector( void )
  70 {
  71     if( knotlist ) delete[] knotlist;
  72 }
  73
  74 int Knotvector::validate( void )
  75 {
  76    /* kindex is used as an array index so subtract one first,
  77      * this propagates throughout the code so study carefully */
  78     long        kindex = knotcount-1;
  79
  80     if( order < 1 || order > MAXORDER ) {
  81         // spline order un-supported
  82         return( 1 );
  83     }
  84
  85     if( knotcount < (2 * order) ) {
  86         // too few knots
  87         return( 2 );
  88     }
  89
  90     if( identical( knotlist[kindex-(order-1)], knotlist[order-1]) ) {
  91         // valid knot range is empty
  92         return( 3 );
  93     }
  94
  95     for( long i = 0; i < kindex; i++)
  96         if( knotlist[i] > knotlist[i+1] ) {
  97             // decreasing knot sequence
  98             return( 4 );
  99         }
 100
 101     /* check for valid multiplicity */
 102
 103     /*  kindex is currently the index of the last knot.
 104      *  In the next loop  it is decremented to ignore the last knot
 105      *  and the loop stops when kindex  is 2 so as to ignore the first
 106      *  knot as well.  These knots are not used in computing
 107      *  knot multiplicities.
 108      */
 109
 110     long multi = 1;
 111     for( ; kindex >= 1; kindex-- ) {
 112         if( knotlist[kindex] - knotlist[kindex-1] < TOLERANCE ) {
 113             multi++;
 114             continue;
 115         }
 116         if ( multi > order ) {
 117             // knot multiplicity greater than order of spline
 118             return( 5 );
 119         }
 120         multi = 1;
 121     }
 122
 123     if ( multi > order ) {
 124         // knot multiplicity greater than order of spline
 125         return( 5 );
 126     }
 127
 128     return 0;
 129 }
 130
 131 void Knotvector::show( char *msg )
 132 {
 133 #ifndef NDEBUG
 134     dprintf( "%s\n", msg );
 135     dprintf( "order = %ld, count = %ld\n", order, knotcount );
 136
 137     for( int i=0; i<knotcount; i++ )
 138         dprintf( "knot[%d] = %g\n", i, knotlist[i] );
 139 #endif
 140 }
 141