Many resources are needed to download a project. Please understand that we have to compensate our server costs. Thank you in advance. Project price only 1 $
You can buy this project and download/modify it how often you want.
/*
* 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 org.scijava.java3d;
import org.scijava.vecmath.Point3d;
/**
* 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;
}
@Override
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
@Override
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
