Debian Codegraph @

lib/database/src/so/nodes/nurbs/libnurbs/knotvector.c++

raw
1 /*
2 *
3 * Copyright (C) 2000 Silicon Graphics, Inc. All Rights Reserved.
4 *
5 * This library is free software; you can redistribute it and/or
6 * modify it under the terms of the GNU Lesser General Public
7 * License as published by the Free Software Foundation; either
8 * version 2.1 of the License, or (at your option) any later version.
9 *
10 * This library is distributed in the hope that it will be useful,
11 * but WITHOUT ANY WARRANTY; without even the implied warranty of
12 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
13 * Lesser General Public License for more details.
14 *
15 * Further, this software is distributed without any warranty that it is
16 * free of the rightful claim of any third person regarding infringement
17 * or the like. Any license provided herein, whether implied or
18 * otherwise, applies only to this software file. Patent licenses, if
19 * any, provided herein do not apply to combinations of this program with
20 * other software, or any other product whatsoever.
21 *
22 * You should have received a copy of the GNU Lesser General Public
23 * License along with this library; if not, write to the Free Software
24 * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
25 *
26 * Contact information: Silicon Graphics, Inc., 1600 Amphitheatre Pkwy,
27 * Mountain View, CA 94043, or:
28 *
29 * http://www.sgi.com
30 *
31 * For further information regarding this notice, see:
32 *
33 * http://oss.sgi.com/projects/GenInfo/NoticeExplan/
34 *
35 */
36
37 /*
38 * knotvector.c++ - $Revision: 1.1.1.1 $
39 * Derrick Burns - 1991
40 */
41
42 #include "glimports.h"
43 #include "mystdio.h"
44 #include "myassert.h"
45 #include "knotvector.h"
46 #include "defines.h"
47
48
49 void Knotvector::init( long _knotcount, long _stride, long _order, INREAL *_knotlist )
50 {
51 knotcount = _knotcount;
52 stride = _stride;
53 order = _order;
54 knotlist = new Knot[_knotcount];
55 assert( knotlist );
56
57 for( int i = 0; i != _knotcount; i++ )
58 knotlist[i] = (Knot) _knotlist[i];
59 }
60
61 Knotvector::Knotvector( void )
62 {
63 knotlist = 0;
64 }
65
66 Knotvector::~Knotvector( void )
67 {
68 if( knotlist ) delete[] knotlist;
69 }
70
71 int Knotvector::validate( void )
72 {
73 /* kindex is used as an array index so subtract one first,
74 * this propagates throughout the code so study carefully */
75 long kindex = knotcount-1;
76
77 if( order < 1 || order > MAXORDER ) {
78 // spline order un-supported
79 return( 1 );
80 }
81
82 if( knotcount < (2 * order) ) {
83 // too few knots
84 return( 2 );
85 }
86
87 if( identical( knotlist[kindex-(order-1)], knotlist[order-1]) ) {
88 // valid knot range is empty
89 return( 3 );
90 }
91
92 for( long i = 0; i < kindex; i++)
93 if( knotlist[i] > knotlist[i+1] ) {
94 // decreasing knot sequence
95 return( 4 );
96 }
97
98 /* check for valid multiplicity */
99
100 /* kindex is currently the index of the last knot.
101 * In the next loop it is decremented to ignore the last knot
102 * and the loop stops when kindex is 2 so as to ignore the first
103 * knot as well. These knots are not used in computing
104 * knot multiplicities.
105 */
106
107 long multi = 1;
108 for( ; kindex >= 1; kindex-- ) {
109 if( knotlist[kindex] - knotlist[kindex-1] < TOLERANCE ) {
110 multi++;
111 continue;
112 }
113 if ( multi > order ) {
114 // knot multiplicity greater than order of spline
115 return( 5 );
116 }
117 multi = 1;
118 }
119
120 if ( multi > order ) {
121 // knot multiplicity greater than order of spline
122 return( 5 );
123 }
124
125 return 0;
126 }
127
128 void Knotvector::show( char *msg )
129 {
130 #ifndef NDEBUG
131 dprintf( "%s\n", msg );
132 dprintf( "order = %ld, count = %ld\n", order, knotcount );
133
134 for( int i=0; i<knotcount; i++ )
135 dprintf( "knot[%d] = %g\n", i, knotlist[i] );
136 #endif
137 }
138