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
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
|
/*
* Copyright 1997-2008 Sun Microsystems, Inc. All Rights Reserved.
* DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
*
* This code is free software; you can redistribute it and/or modify it
* under the terms of the GNU General Public License version 2 only, as
* published by the Free Software Foundation. Sun designates this
* particular file as subject to the "Classpath" exception as provided
* by Sun in the LICENSE file that accompanied this code.
*
* This code is distributed in the hope that it will be useful, but WITHOUT
* ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
* FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
* version 2 for more details (a copy is included in the LICENSE file that
* accompanied this code).
*
* You should have received a copy of the GNU General Public License version
* 2 along with this work; if not, write to the Free Software Foundation,
* Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
*
* Please contact Sun Microsystems, Inc., 4150 Network Circle, Santa Clara,
* CA 95054 USA or visit www.sun.com if you need additional information or
* have any questions.
*
*/
package javax.media.j3d;
import javax.vecmath.Point3d;
import javax.vecmath.Vector3d;
/**
* The PointArray object draws the array of vertices as individual points.
*/
class PointArrayRetained extends GeometryArrayRetained {
PointArrayRetained() {
this.geoType = GEO_TYPE_POINT_SET;
}
@Override
boolean intersect(PickShape pickShape, PickInfo pickInfo, int flags, Point3d iPnt,
GeometryRetained geom, int geomIndex) {
double sdist[] = new double[1];
double minDist = Double.MAX_VALUE;
double x = 0, y = 0, z = 0;
int i = ((vertexFormat & GeometryArray.BY_REFERENCE) == 0 ?
initialVertexIndex : initialCoordIndex);
Point3d pnt = new Point3d();
int[] vtxIndexArr = new int[1];
switch (pickShape.getPickType()) {
case PickShape.PICKRAY:
PickRay pickRay= (PickRay) pickShape;
while (i < validVertexCount) {
vtxIndexArr[0] = i;
getVertexData(i++, pnt);
if (intersectPntAndRay(pnt, pickRay.origin,
pickRay.direction, sdist)) {
if (flags == 0) {
return true;
}
if (sdist[0] < minDist) {
minDist = sdist[0];
x = pnt.x;
y = pnt.y;
z = pnt.z;
if((flags & PickInfo.CLOSEST_GEOM_INFO) != 0) {
storeInterestData(pickInfo, flags, geom, geomIndex,
vtxIndexArr, iPnt, sdist[0]);
}
}
if((flags & PickInfo.ALL_GEOM_INFO) != 0) {
storeInterestData(pickInfo, flags, geom, geomIndex,
vtxIndexArr, iPnt, sdist[0]);
}
}
}
break;
case PickShape.PICKSEGMENT:
PickSegment pickSegment = (PickSegment) pickShape;
Vector3d dir =
new Vector3d(pickSegment.end.x - pickSegment.start.x,
pickSegment.end.y - pickSegment.start.y,
pickSegment.end.z - pickSegment.start.z);
while (i < validVertexCount) {
vtxIndexArr[0] = i;
getVertexData(i++, pnt);
if (intersectPntAndRay(pnt, pickSegment.start,
dir, sdist) &&
(sdist[0] <= 1.0)) {
if (flags == 0) {
return true;
}
if (sdist[0] < minDist) {
minDist = sdist[0];
x = pnt.x;
y = pnt.y;
z = pnt.z;
if((flags & PickInfo.CLOSEST_GEOM_INFO) != 0) {
storeInterestData(pickInfo, flags, geom, geomIndex,
vtxIndexArr, iPnt, sdist[0]);
}
}
if((flags & PickInfo.ALL_GEOM_INFO) != 0) {
storeInterestData(pickInfo, flags, geom, geomIndex,
vtxIndexArr, iPnt, sdist[0]);
}
}
}
break;
case PickShape.PICKBOUNDINGBOX:
case PickShape.PICKBOUNDINGSPHERE:
case PickShape.PICKBOUNDINGPOLYTOPE:
Bounds bounds = ((PickBounds) pickShape).bounds;
while (i < validVertexCount) {
vtxIndexArr[0] = i;
getVertexData(i++, pnt);
if (bounds.intersect(pnt)) {
if (flags == 0) {
return true;
}
sdist[0] = pickShape.distance(pnt);
if (sdist[0] < minDist) {
minDist = sdist[0];
x = pnt.x;
y = pnt.y;
z = pnt.z;
if((flags & PickInfo.CLOSEST_GEOM_INFO) != 0) {
storeInterestData(pickInfo, flags, geom, geomIndex,
vtxIndexArr, iPnt, sdist[0]);
}
}
if((flags & PickInfo.ALL_GEOM_INFO) != 0) {
storeInterestData(pickInfo, flags, geom, geomIndex,
vtxIndexArr, iPnt, sdist[0]);
}
}
}
break;
case PickShape.PICKCYLINDER:
PickCylinder pickCylinder= (PickCylinder) pickShape;
while (i < validVertexCount) {
vtxIndexArr[0] = i;
getVertexData(i++, pnt);
if (intersectCylinder(pnt, pickCylinder, sdist)) {
if (flags == 0) {
return true;
}
if (sdist[0] < minDist) {
minDist = sdist[0];
x = pnt.x;
y = pnt.y;
z = pnt.z;
if((flags & PickInfo.CLOSEST_GEOM_INFO) != 0) {
storeInterestData(pickInfo, flags, geom, geomIndex,
vtxIndexArr, iPnt, sdist[0]);
}
}
if((flags & PickInfo.ALL_GEOM_INFO) != 0) {
storeInterestData(pickInfo, flags, geom, geomIndex,
vtxIndexArr, iPnt, sdist[0]);
}
}
}
break;
case PickShape.PICKCONE:
PickCone pickCone= (PickCone) pickShape;
while (i < validVertexCount) {
vtxIndexArr[0] = i;
getVertexData(i++, pnt);
if (intersectCone(pnt, pickCone, sdist)) {
if (flags == 0) {
return true;
}
if (sdist[0] < minDist) {
minDist = sdist[0];
x = pnt.x;
y = pnt.y;
z = pnt.z;
if((flags & PickInfo.CLOSEST_GEOM_INFO) != 0) {
storeInterestData(pickInfo, flags, geom, geomIndex,
vtxIndexArr, iPnt, sdist[0]);
}
}
if((flags & PickInfo.ALL_GEOM_INFO) != 0) {
storeInterestData(pickInfo, flags, geom, geomIndex,
vtxIndexArr, iPnt, sdist[0]);
}
}
}
break;
case PickShape.PICKPOINT:
// Should not happen since API already check for this
throw new IllegalArgumentException(J3dI18N.getString("PointArrayRetained0"));
default:
throw new RuntimeException ("PickShape not supported for intersection");
}
if (minDist < Double.MAX_VALUE) {
iPnt.x = x;
iPnt.y = y;
iPnt.z = z;
return true;
}
return false;
}
@Override
boolean intersect(Point3d[] pnts) {
Point3d point = new Point3d();
int i = ((vertexFormat & GeometryArray.BY_REFERENCE) == 0 ?
initialVertexIndex : initialCoordIndex);
switch (pnts.length) {
case 3: // Triangle
while (i < validVertexCount) {
getVertexData(i++, point);
if (intersectTriPnt(pnts[0], pnts[1], pnts[2], point)) {
return true;
}
}
break;
case 4: // Quad
while (i < validVertexCount) {
getVertexData(i++, point);
if (intersectTriPnt(pnts[0], pnts[1], pnts[2], point) ||
intersectTriPnt(pnts[0], pnts[2], pnts[3], point)) {
return true;
}
}
break;
case 2: // Line
double dist[] = new double[1];
Vector3d dir = new Vector3d();
while (i < validVertexCount) {
getVertexData(i++, point);
dir.x = pnts[1].x - pnts[0].x;
dir.y = pnts[1].y - pnts[0].y;
dir.z = pnts[1].z - pnts[0].z;
if (intersectPntAndRay(point, pnts[0], dir, dist) &&
(dist[0] <= 1.0)) {
return true;
}
}
break;
case 1: // Point
while (i < validVertexCount) {
getVertexData(i++, point);
if ((pnts[0].x == point.x) &&
(pnts[0].y == point.y) &&
(pnts[0].z == point.z)) {
return true;
}
}
break;
}
return false;
}
@Override
boolean intersect(Transform3D thisToOtherVworld,
GeometryRetained geom) {
Point3d[] pnt = new Point3d[1];
int i = ((vertexFormat & GeometryArray.BY_REFERENCE) == 0 ?
initialVertexIndex : initialCoordIndex);
pnt[0] = new Point3d();
while (i < validVertexCount) {
getVertexData(i++, pnt[0]);
thisToOtherVworld.transform(pnt[0]);
if (geom.intersect(pnt)) {
return true;
}
}
return false;
}
// the bounds argument is already transformed
@Override
boolean intersect(Bounds targetBound) {
int i = ((vertexFormat & GeometryArray.BY_REFERENCE) == 0 ?
initialVertexIndex : initialCoordIndex);
Point3d pnt = new Point3d();
while (i < validVertexCount) {
getVertexData(i++, pnt);
if (targetBound.intersect(pnt)) {
return true;
}
}
return false;
}
@Override
int getClassType() {
return POINT_TYPE;
}
}
|
