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 * reader.c++
37 *
38 */
39
40 //#include <stdio.h>
41 //#include "glimports.h"
42 #include "nurbsconsts.h"
43 #include "reader.h"
44 #include "trimvertex.h"
45 #include "simplemath.h"
46
47 //when read a pwlCurve, if two consecutive points are the same, then
48 //eliminate one of them. This makes the tessellator more robust. The spec
49 //assumes the application makes sure there are no redundant points.
50 //but in Inspector, the trim curves seem to have redundant points a lot.
51 //I guess other similar users may have the same problem.
52
53 #define ELIMINATE_REDUNDANT_POINTS
54
55 #ifdef ELIMINATE_REDUNDANT_POINTS
56 #define equal(x,y) ( glu_abs(x-y) <= 0.00001)
57 #endif
58
59 #ifdef ELIMINATE_REDUNDANT_POINTS
O_pwlcurve(long _type,long count,INREAL * array,long byte_stride,TrimVertex * trimpts)60 O_pwlcurve::O_pwlcurve( long _type, long count, INREAL *array, long byte_stride, TrimVertex *trimpts )
61 {
62 next = 0;
63 used = 0;
64 owner = 0;
65 pts = trimpts;
66 npts = (int) count;
67 save = 0;
68 int i;
69
70 /* copy user data into internal trimming data structures */
71 switch( _type ) {
72 case N_P2D: {
73 TrimVertex *v = pts;
74 TrimVertex *prev = NULL;
75 int num = 0;
76 int doit;
77 for(i=0; i<count; i++) {
78 doit = 1;
79 if(prev != NULL)
80 {
81 if(equal(prev->param[0], array[0]) && equal(prev->param[1], array[1]))
82 {
83 doit = 0;
84 }
85 }
86
87 if(doit)
88 {
89 v->param[0] = (REAL) array[0];
90 v->param[1] = (REAL) array[1];
91 prev = v;
92 v++;
93 num++;
94 }
95 array = (INREAL *) (((char *) array) + byte_stride);
96 }
97 npts = num;
98 break;
99 }
100 case N_P2DR: {
101 TrimVertex *v = pts;
102 for( TrimVertex *lastv = v + count; v != lastv; v++ ) {
103 v->param[0] = (REAL) array[0] / (REAL) array[2];
104 v->param[1] = (REAL) array[1] / (REAL) array[2];
105 array = (INREAL *) (((char *) array) + byte_stride);
106 }
107 break;
108 }
109 }
110 }
111 #else
O_pwlcurve(long _type,long count,INREAL * array,long byte_stride,TrimVertex * trimpts)112 O_pwlcurve::O_pwlcurve( long _type, long count, INREAL *array, long byte_stride, TrimVertex *trimpts )
113 {
114 next = 0;
115 used = 0;
116 owner = 0;
117 pts = trimpts;
118 npts = (int) count;
119 save = 0;
120
121 /* copy user data into internal trimming data structures */
122 switch( _type ) {
123 case N_P2D: {
124 TrimVertex *v = pts;
125 for( TrimVertex *lastv = v + count; v != lastv; v++ ) {
126 v->param[0] = (REAL) array[0];
127 v->param[1] = (REAL) array[1];
128 array = (INREAL *) (((char *) array) + byte_stride);
129 }
130 break;
131 }
132 case N_P2DR: {
133 TrimVertex *v = pts;
134 for( TrimVertex *lastv = v + count; v != lastv; v++ ) {
135 v->param[0] = (REAL) array[0] / (REAL) array[2];
136 v->param[1] = (REAL) array[1] / (REAL) array[2];
137 array = (INREAL *) (((char *) array) + byte_stride);
138 }
139 break;
140 }
141 }
142 }
143 #endif
144
145
146
147
148
149