1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
|
package jogamp.opengl.glu.nurbs;
/*
** License Applicability. Except to the extent portions of this file are
** made subject to an alternative license as permitted in the SGI Free
** Software License B, Version 2.0 (the "License"), the contents of this
** file are subject only to the provisions of the License. You may not use
** this file except in compliance with the License. You may obtain a copy
** of the License at Silicon Graphics, Inc., attn: Legal Services, 1600
** Amphitheatre Parkway, Mountain View, CA 94043-1351, or at:
**
** http://oss.sgi.com/projects/FreeB
**
** Note that, as provided in the License, the Software is distributed on an
** "AS IS" basis, with ALL EXPRESS AND IMPLIED WARRANTIES AND CONDITIONS
** DISCLAIMED, INCLUDING, WITHOUT LIMITATION, ANY IMPLIED WARRANTIES AND
** CONDITIONS OF MERCHANTABILITY, SATISFACTORY QUALITY, FITNESS FOR A
** PARTICULAR PURPOSE, AND NON-INFRINGEMENT.
**
** Original Code. The Original Code is: OpenGL Sample Implementation,
** Version 1.2.1, released January 26, 2000, developed by Silicon Graphics,
** Inc. The Original Code is Copyright (c) 1991-2000 Silicon Graphics, Inc.
** Copyright in any portions created by third parties is as indicated
** elsewhere herein. All Rights Reserved.
**
** Additional Notice Provisions: The application programming interfaces
** established by SGI in conjunction with the Original Code are The
** OpenGL(R) Graphics System: A Specification (Version 1.2.1), released
** April 1, 1999; The OpenGL(R) Graphics System Utility Library (Version
** 1.3), released November 4, 1998; and OpenGL(R) Graphics with the X
** Window System(R) (Version 1.3), released October 19, 1998. This software
** was created using the OpenGL(R) version 1.2.1 Sample Implementation
** published by SGI, but has not been independently verified as being
** compliant with the OpenGL(R) version 1.2.1 Specification.
*/
/**
* Class for converting NURBS curves and surfaces to list of bezier arcs or patches repectively
* @author Tomáš Hráský
*
*/
public class Quilt {
/**
* Maximum quilt dimension
*/
private static final int MAXDIM = 2;
/**
* List of map descriptions
*/
Mapdesc mapdesc;
/**
* Array of quiltspecs pointer
*/
public CArrayOfQuiltspecs qspec;
/**
* End array of quilt specs pointer
*/
public CArrayOfQuiltspecs eqspec;
/**
* Control points
*/
public CArrayOfFloats cpts;
/**
* Next quilt in list
*/
public Quilt next;
/**
* Makes new quilt with mapdesc
* @param mapdesc map description
*/
public Quilt(Mapdesc mapdesc) {
// DONE
this.mapdesc = mapdesc;
Quiltspec[] tmpquilts = new Quiltspec[MAXDIM];
for (int i = 0; i < tmpquilts.length; i++)
tmpquilts[i] = new Quiltspec();
this.qspec = new CArrayOfQuiltspecs(tmpquilts);
}
/**
* Converts NURBS surface to bezier patches
* @param sknotvector knots in u direction
* @param tknotvector knots in v direction
* @param ctrlarr control points
* @param coords control points coords
*/
public void toBezier(Knotvector sknotvector, Knotvector tknotvector,
CArrayOfFloats ctrlarr, int coords) {
Splinespec spline = new Splinespec(2);
spline.kspecinit(sknotvector, tknotvector);
spline.select();
spline.layout(coords);
spline.setupquilt(this);
spline.copy(ctrlarr);
spline.transform();
}
/**
* Converts NURBS curve to list of bezier curves
* @param knots knot vector
* @param ctlarray control points
* @param ncoords number of coordinates
*/
public void toBezier(Knotvector knots, CArrayOfFloats ctlarray, int ncoords) {
// DONE
Splinespec spline = new Splinespec(1);
spline.kspecinit(knots);
spline.select();
spline.layout(ncoords);
spline.setupquilt(this);
spline.copy(ctlarray);
spline.transform();
}
/**
* Walks thru all arcs/patches
* @param pta low border
* @param ptb high border
* @param backend Backend
*/
public void downloadAll(float[] pta, float[] ptb, Backend backend) {
// DONE
for (Quilt m = this; m != null; m = m.next) {
m.select(pta, ptb);
m.download(backend);
}
}
/**
* Renders arcs/patches
* @param backend Backend for rendering
*/
private void download(Backend backend) {
// DONE
if (getDimension() == 2) {
CArrayOfFloats ps = new CArrayOfFloats(cpts);
ps.raisePointerBy(qspec.get(0).offset);
ps.raisePointerBy(qspec.get(1).offset);
ps.raisePointerBy(qspec.get(0).index * qspec.get(0).order
* qspec.get(0).stride);
ps.raisePointerBy(qspec.get(1).index * qspec.get(1).order
* qspec.get(1).stride);
backend.surfpts(mapdesc.getType(), ps, qspec.get(0).stride, qspec
.get(1).stride, qspec.get(0).order, qspec.get(1).order,
qspec.get(0).breakpoints[qspec.get(0).index],
qspec.get(0).breakpoints[qspec.get(0).index + 1], qspec
.get(1).breakpoints[qspec.get(1).index], qspec
.get(1).breakpoints[qspec.get(1).index + 1]);
} else {// code for curves
// CArrayOfFloats ps=new CArrayOfFloats(cpts);
CArrayOfFloats ps = new CArrayOfFloats(cpts.getArray(), 0);
ps.raisePointerBy(qspec.get(0).offset);
ps.raisePointerBy(qspec.get(0).index * qspec.get(0).order
* qspec.get(0).stride);
backend.curvpts(mapdesc.getType(), ps, qspec.get(0).stride, qspec
.get(0).order,
qspec.get(0).breakpoints[qspec.get(0).index],
qspec.get(0).breakpoints[qspec.get(0).index + 1]);
}
}
/**
* Returns quilt dimension
* @return quilt dimesion
*/
private int getDimension() {
// DONE
return eqspec.getPointer() - qspec.getPointer();
}
/**
* Finds Quiltspec.index
* @param pta range
* @param ptb range
*/
private void select(float[] pta, float[] ptb) {
// DONE
int dim = eqspec.getPointer() - qspec.getPointer();
int i, j;
for (i = 0; i < dim; i++) {
for (j = qspec.get(i).width - 1; j >= 0; j--)
if (qspec.get(i).breakpoints[j] <= pta[i]
&& ptb[i] <= qspec.get(i).breakpoints[j + 1])
break;
assert (j != -1);
qspec.get(i).index = j;
}
}
/**
* Find range according to breakpoints
* @param from low param
* @param to high param
* @param bpts breakpoints
*/
public void getRange(float[] from, float[] to, Flist bpts) {
// DONE
getRange(from, to, 0, bpts);
}
/**
* Find range according to breakpoints
* @param from low param
* @param to high param
* @param i from/to array index
* @param list breakpoints
*/
private void getRange(float[] from, float[] to, int i, Flist list) {
// DONE
Quilt maps = this;
from[i] = maps.qspec.get(i).breakpoints[0];
to[i] = maps.qspec.get(i).breakpoints[maps.qspec.get(i).width];
int maxpts = 0;
Quilt m;
for (m = maps; m != null; m = m.next) {
if (m.qspec.get(i).breakpoints[0] > from[i])
from[i] = m.qspec.get(i).breakpoints[0];
if (m.qspec.get(i).breakpoints[m.qspec.get(i).width] < to[i])
to[i] = m.qspec.get(i).breakpoints[m.qspec.get(i).width];
maxpts += m.qspec.get(i).width + 1;
}
list.grow(maxpts);
for (m = maps; m != null; m = m.next) {
for (int j = 0; j <= m.qspec.get(i).width; j++) {
list.add(m.qspec.get(i).breakpoints[j]);
}
}
list.filter();
list.taper(from[i], to[i]);
}
/**
* Is this quilt culled
* @return 0 or Subdivider.CULL_ACCEPT
*/
public int isCulled() {
if (mapdesc.isCulling()) {
// System.out.println("TODO quilt.isculled mapdesc.isculling");
return 0;
} else {
return Subdivider.CULL_ACCEPT;
}
}
/**
* Finds range for surface
* @param from low param
* @param to high param
* @param slist u direction breakpoints
* @param tlist v direction breakpoints
*/
public void getRange(float[] from, float[] to, Flist slist, Flist tlist) {
// DONE
getRange(from, to, 0, slist);
getRange(from, to, 1, tlist);
}
/**
* Empty method
* @param sbrkpts
* @param tbrkpts
* @param rate
*/
public void findRates(Flist sbrkpts, Flist tbrkpts, float[] rate) {
// TODO Auto-generated method stub
// System.out.println("TODO quilt.findrates");
}
}
|
