Copyright by Thomas Baier (thomas.baier@stmuc.com)
Created by OpenGL Export Plugin 1.0 at Fri Oct 27 22:04:55 2000
OpenGL-Structure
Ported to Java by Kenneth Russell */ public class Triceratops { /** Draws the triceratops object. Callers should capture the result in a display list. */ public static void drawObject(GL2 gl) throws IOException { Reader reader = new BufferedReader(new InputStreamReader( Triceratops.class.getClassLoader().getResourceAsStream("demos/data/models/triceratops.txt"))); StreamTokenizer tok = new StreamTokenizer(reader); // Reset tokenizer's syntax so numbers are not parsed tok.resetSyntax(); tok.wordChars('a', 'z'); tok.wordChars('A', 'Z'); tok.wordChars('0', '9'); tok.wordChars('-', '-'); tok.wordChars('.', '.'); tok.wordChars(128 + 32, 255); tok.whitespaceChars(0, ' '); tok.whitespaceChars(',', ','); tok.whitespaceChars('{', '{'); tok.whitespaceChars('}', '}'); tok.commentChar('/'); tok.quoteChar('"'); tok.quoteChar('\''); tok.slashSlashComments(true); tok.slashStarComments(true); // Read in file int numVertices = nextInt(tok, "number of vertices"); float[] vertices = new float[numVertices * 3]; for (int i = 0; i < numVertices * 3; i++) { vertices[i] = nextFloat(tok, "vertex"); } int numNormals = nextInt(tok, "number of normals"); float[] normals = new float[numNormals * 3]; for (int i = 0; i < numNormals * 3; i++) { normals[i] = nextFloat(tok, "normal"); } int numFaceIndices = nextInt(tok, "number of face indices"); short[] faceIndices = new short[numFaceIndices * 9]; for (int i = 0; i < numFaceIndices * 9; i++) { faceIndices[i] = (short) nextInt(tok, "face index"); } reader.close(); float sf = 0.1f; gl.glBegin(GL2.GL_TRIANGLES); for (int i = 0; i < faceIndices.length; i += 9) { for (int j = 0; j < 3; j++) { int vi = faceIndices[i + j ] & 0xFFFF; int ni = faceIndices[i + j + 3] & 0xFFFF; gl.glNormal3f(normals[3 * ni], normals[3 * ni + 1], normals[3 * ni + 2]); gl.glVertex3f(sf * vertices[3 * vi], sf * vertices[3 * vi + 1], sf * vertices[3 * vi + 2]); } } gl.glEnd(); } private static int nextInt(StreamTokenizer tok, String error) throws IOException { if (tok.nextToken() != StreamTokenizer.TT_WORD) { throw new IOException("Parse error reading " + error + " at line " + tok.lineno()); } try { return Integer.parseInt(tok.sval); } catch (NumberFormatException e) { throw new IOException("Parse error reading " + error + " at line " + tok.lineno()); } } private static float nextFloat(StreamTokenizer tok, String error) throws IOException { if (tok.nextToken() != StreamTokenizer.TT_WORD) { throw new IOException("Parse error reading " + error + " at line " + tok.lineno()); } try { return Float.parseFloat(tok.sval); } catch (NumberFormatException e) { throw new IOException("Parse error reading " + error + " at line " + tok.lineno()); } } } id='n28' href='#n28'>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 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 351 352 353 354 355 356 357 358 359 360 361 362 363 364 365 366 367 368 369 370 371 372 373 374 375 376 377 378 379 380 381 382 383 384 385 386 387 388 389 390 391 392 393 394 395 396 397 398 399 400 401 402 403 404 405 406 407 408 409 410 411 412 413 414 415 416 417 418 419 420 421 422 423 424 425 426 427 428 429 430 431 432 433 434 435 436 437 438 439 440
/*
* $RCSfile$
*
* 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.
*
* $Revision$
* $Date$
* $State$
*/
package javax.media.j3d;
import javax.vecmath.*;
import java.lang.Math;
/**
* The IndexedTriangleArray object draws the array of vertices as individual
* triangles. Each group
* of three vertices defines a triangle to be drawn.
*/
class IndexedTriangleArrayRetained extends IndexedGeometryArrayRetained {
IndexedTriangleArrayRetained() {
this.geoType = GEO_TYPE_INDEXED_TRI_SET;
}
boolean intersect(PickShape pickShape, PickInfo pickInfo, int flags, Point3d iPnt,
GeometryRetained geom, int geomIndex) {
Point3d pnts[] = new Point3d[3];
double sdist[] = new double[1];
double minDist = Double.MAX_VALUE;
double x = 0, y = 0, z = 0;
int[] vtxIndexArr = new int[3];
//NVaidya
// Bug 447: While loops below now traverse over all
// elements in the valid index range from initialIndexIndex
// to initialIndexInex + validIndexCount - 1
int i = initialIndexIndex;
int loopStopIndex = initialIndexIndex + validIndexCount;
pnts[0] = new Point3d();
pnts[1] = new Point3d();
pnts[2] = new Point3d();
switch (pickShape.getPickType()) {
case PickShape.PICKRAY:
PickRay pickRay= (PickRay) pickShape;
while (i < loopStopIndex) {
for(int j=0; j<3; j++) {
vtxIndexArr[j] = indexCoord[i];
getVertexData(indexCoord[i++], pnts[j]);
}
if (intersectRay(pnts, pickRay, sdist, iPnt)) {
if (flags == 0) {
return true;
}
if (sdist[0] < minDist) {
minDist = sdist[0];
x = iPnt.x;
y = iPnt.y;
z = iPnt.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;
while (i < loopStopIndex) {
for(int j=0; j<3; j++) {
vtxIndexArr[j] = indexCoord[i];
getVertexData(indexCoord[i++], pnts[j]);
}
if (intersectSegment(pnts, pickSegment.start,
pickSegment.end, sdist, iPnt)) {
if (flags == 0) {
return true;
}
if (sdist[0] < minDist) {
minDist = sdist[0];
x = iPnt.x;
y = iPnt.y;
z = iPnt.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:
BoundingBox bbox = (BoundingBox)
((PickBounds) pickShape).bounds;
while (i < loopStopIndex) {
for(int j=0; j<3; j++) {
vtxIndexArr[j] = indexCoord[i];
getVertexData(indexCoord[i++], pnts[j]);
}
if (intersectBoundingBox(pnts, bbox, sdist, iPnt)) {
if (flags == 0) {
return true;
}
if (sdist[0] < minDist) {
minDist = sdist[0];
x = iPnt.x;
y = iPnt.y;
z = iPnt.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.PICKBOUNDINGSPHERE:
BoundingSphere bsphere = (BoundingSphere)
((PickBounds) pickShape).bounds;
while (i < loopStopIndex) {
for(int j=0; j<3; j++) {
vtxIndexArr[j] = indexCoord[i];
getVertexData(indexCoord[i++], pnts[j]);
}
if (intersectBoundingSphere(pnts, bsphere, sdist, iPnt)) {
if (flags == 0) {
return true;
}
if (sdist[0] < minDist) {
minDist = sdist[0];
x = iPnt.x;
y = iPnt.y;
z = iPnt.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.PICKBOUNDINGPOLYTOPE:
BoundingPolytope bpolytope = (BoundingPolytope)
((PickBounds) pickShape).bounds;
while (i < loopStopIndex) {
for(int j=0; j<3; j++) {
vtxIndexArr[j] = indexCoord[i];
getVertexData(indexCoord[i++], pnts[j]);
}
if (intersectBoundingPolytope(pnts, bpolytope,
sdist,iPnt)) {
if (flags == 0) {
return true;
}
if (sdist[0] < minDist) {
minDist = sdist[0];
x = iPnt.x;
y = iPnt.y;
z = iPnt.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 < loopStopIndex) {
for(int j=0; j<3; j++) {
vtxIndexArr[j] = indexCoord[i];
getVertexData(indexCoord[i++], pnts[j]);
}
if (intersectCylinder(pnts, pickCylinder, sdist,
iPnt)) {
if (flags == 0) {
return true;
}
if (sdist[0] < minDist) {
minDist = sdist[0];
x = iPnt.x;
y = iPnt.y;
z = iPnt.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 < loopStopIndex) {
for(int j=0; j<3; j++) {
vtxIndexArr[j] = indexCoord[i];
getVertexData(indexCoord[i++], pnts[j]);
}
if (intersectCone(pnts, pickCone, sdist, iPnt)) {
if (flags == 0) {
return true;
}
if (sdist[0] < minDist) {
minDist = sdist[0];
x = iPnt.x;
y = iPnt.y;
z = iPnt.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("IndexedTriangleArrayRetained0"));
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;
}
// intersect pnts[] with every triangle in this object
boolean intersect(Point3d[] pnts) {
Point3d[] points = new Point3d[3];
double dist[] = new double[1];
//NVaidya
// Bug 447: correction for loop indices
int i = initialIndexIndex;
int loopStopIndex = initialIndexIndex + validIndexCount;
points[0] = new Point3d();
points[1] = new Point3d();
points[2] = new Point3d();
switch (pnts.length) {
case 3: // Triangle
while (i<loopStopIndex) {
getVertexData(indexCoord[i++], points[0]);
getVertexData(indexCoord[i++], points[1]);
getVertexData(indexCoord[i++], points[2]);
if (intersectTriTri(points[0], points[1], points[2],
pnts[0], pnts[1], pnts[2])) {
return true;
}
}
break;
case 4: // Quad
while (i<loopStopIndex) {
getVertexData(indexCoord[i++], points[0]);
getVertexData(indexCoord[i++], points[1]);
getVertexData(indexCoord[i++], points[2]);
if (intersectTriTri(points[0], points[1], points[2],
pnts[0], pnts[1], pnts[2]) ||
intersectTriTri(points[0], points[1], points[2],
pnts[0], pnts[2], pnts[3])) {
return true;
}
}
break;
case 2: // Line
while (i<loopStopIndex) {
getVertexData(indexCoord[i++], points[0]);
getVertexData(indexCoord[i++], points[1]);
getVertexData(indexCoord[i++], points[2]);
if (intersectSegment(points, pnts[0], pnts[1], dist,
null)) {
return true;
}
}
break;
case 1: // Point
while (i<loopStopIndex) {
getVertexData(indexCoord[i++], points[0]);
getVertexData(indexCoord[i++], points[1]);
getVertexData(indexCoord[i++], points[2]);
if (intersectTriPnt(points[0], points[1], points[2],
pnts[0])) {
return true;
}
}
break;
}
return false;
}
boolean intersect(Transform3D thisToOtherVworld, GeometryRetained geom) {
Point3d[] pnts = new Point3d[3];
//NVaidya
// Bug 447: correction for loop indices
int i = initialIndexIndex;
int loopStopIndex = initialIndexIndex + validIndexCount;
pnts[0] = new Point3d();
pnts[1] = new Point3d();
pnts[2] = new Point3d();
while (i < loopStopIndex) {
getVertexData(indexCoord[i++], pnts[0]);
getVertexData(indexCoord[i++], pnts[1]);
getVertexData(indexCoord[i++], pnts[2]);
thisToOtherVworld.transform(pnts[0]);
thisToOtherVworld.transform(pnts[1]);
thisToOtherVworld.transform(pnts[2]);
if (geom.intersect(pnts)) {
return true;
}
}
return false;
}
// the bounds argument is already transformed
boolean intersect(Bounds targetBound) {
Point3d[] pnts = new Point3d[3];
//NVaidya
// Bug 447: correction for loop indices
int i = initialIndexIndex;
int loopStopIndex = initialIndexIndex + validIndexCount;
pnts[0] = new Point3d();
pnts[1] = new Point3d();
pnts[2] = new Point3d();
switch(targetBound.getPickType()) {
case PickShape.PICKBOUNDINGBOX:
BoundingBox box = (BoundingBox) targetBound;
while (i < loopStopIndex) {
getVertexData(indexCoord[i++], pnts[0]);
getVertexData(indexCoord[i++], pnts[1]);
getVertexData(indexCoord[i++], pnts[2]);
if (intersectBoundingBox(pnts, box, null, null)) {
return true;
}
}
break;
case PickShape.PICKBOUNDINGSPHERE:
BoundingSphere bsphere = (BoundingSphere) targetBound;
while (i < loopStopIndex) {
getVertexData(indexCoord[i++], pnts[0]);
getVertexData(indexCoord[i++], pnts[1]);
getVertexData(indexCoord[i++], pnts[1]);
if (intersectBoundingSphere(pnts, bsphere, null,
null)) {
return true;
}
}
break;
case PickShape.PICKBOUNDINGPOLYTOPE:
BoundingPolytope bpolytope = (BoundingPolytope) targetBound;