trianglestriparrayretained.java

JAVA3D矩陈的相关类

			    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]);                      
       		        }
                    }
		    pnts[0].set(pnts[1]);
                    vtxIndexArr[0] = vtxIndexArr[1];
		    pnts[1].set(pnts[2]);
                    vtxIndexArr[1] = vtxIndexArr[2];
		}
	    }
	    break;
	case PickShape.PICKPOINT:
	    // Should not happen since API already check for this
	    throw new IllegalArgumentException(J3dI18N.getString("TriangleStripArrayRetained0"));
	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) {
	int j, end;
	Point3d[] points = new Point3d[3];
	double dist[] = new double[1];
	int i = 0;

	points[0] = new Point3d();
	points[1] = new Point3d();
	points[2] = new Point3d();

	switch (pnts.length) {
	case 3: // Triangle
	    while (i < stripVertexCounts.length) {
		j = stripStartVertexIndices[i];
		end = j + stripVertexCounts[i++];
		getVertexData(j++, points[0]);		
		getVertexData(j++, points[1]);		
		while (j < end) {
		    getVertexData(j++, points[2]);		
		    if (intersectTriTri(points[0], points[1], points[2],
					pnts[0], pnts[1], pnts[2])) {
			return true;
		    }
		    points[0].set(points[1]);
		    points[1].set(points[2]);
		}
	    }
	    break;
	case 4: // Quad
	    while (i < stripVertexCounts.length) {
		j = stripStartVertexIndices[i];
		end = j + stripVertexCounts[i++];
		getVertexData(j++, points[0]);		
		getVertexData(j++, points[1]);		
		while (j < end) {
		    getVertexData(j++, 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;
		    }
		    points[0].set(points[1]);
		    points[1].set(points[2]);
		}
	    }
	    break;
	case 2: // Line
	    while (i < stripVertexCounts.length) {
		j = stripStartVertexIndices[i];
		end = j + stripVertexCounts[i++];
		getVertexData(j++, points[0]);		
		getVertexData(j++, points[1]);		
		while (j < end) {
		    getVertexData(j++, points[2]);		
		    if (intersectSegment(points, pnts[0], pnts[1],
					 dist, null)) {
			return true;
		    }
		    points[0].set(points[1]);
		    points[1].set(points[2]);
		}
	    }
	    break;
	case 1: // Point
	    while (i < stripVertexCounts.length) {
		j = stripStartVertexIndices[i];
		end = j + stripVertexCounts[i++];
		getVertexData(j++, points[0]);		
		getVertexData(j++, points[1]);		
		while (j < end) {
		    getVertexData(j++, points[2]);		
		    if (intersectTriPnt(points[0], points[1], points[2],
					pnts[0])) {
			return true;
		    }
		    points[0].set(points[1]);
		    points[1].set(points[2]);
		}
	    }
	    break;
	}
	return false;
    }
    
    boolean intersect(Transform3D thisToOtherVworld, GeometryRetained geom) {
	int i = 0, j, end;
	Point3d[] pnts = new Point3d[3];
	pnts[0] = new Point3d();
	pnts[1] = new Point3d();
	pnts[2] = new Point3d();

	while (i < stripVertexCounts.length) {
	    j = stripStartVertexIndices[i];
	    end = j + stripVertexCounts[i++];
	    getVertexData(j++, pnts[0]);		
	    getVertexData(j++, pnts[1]);	
	    thisToOtherVworld.transform(pnts[0]);
	    thisToOtherVworld.transform(pnts[1]);
	    while (j < end) {
		getVertexData(j++, pnts[2]);		
		thisToOtherVworld.transform(pnts[2]);
		if (geom.intersect(pnts)) {
		    return true;
		}
		pnts[0].set(pnts[1]);
		pnts[1].set(pnts[2]);
	    }
	}
	return false;
    }

    // the bounds argument is already transformed
    boolean intersect(Bounds targetBound) {
	int i = 0;
	int j, end;
	Point3d[] pnts = new Point3d[3];
	pnts[0] = new Point3d();
	pnts[1] = new Point3d();
	pnts[2] = new Point3d();


	switch(targetBound.getPickType()) {
	case PickShape.PICKBOUNDINGBOX:
	    BoundingBox box = (BoundingBox) targetBound;

	    while (i < stripVertexCounts.length) {
		j = stripStartVertexIndices[i];
		end = j + stripVertexCounts[i++];
		getVertexData(j++, pnts[0]);		
		getVertexData(j++, pnts[1]);		
		while ( j < end) {
		    getVertexData(j++, pnts[2]);		
		    if (intersectBoundingBox(pnts, box, null, null)) {
			return true;
		    }
		    pnts[0].set(pnts[1]);
		    pnts[1].set(pnts[2]);
		}
	    }
	    break;
	case PickShape.PICKBOUNDINGSPHERE:
	    BoundingSphere bsphere = (BoundingSphere) targetBound;

	    while (i < stripVertexCounts.length) {
		j = stripStartVertexIndices[i];
		end = j + stripVertexCounts[i++];
		getVertexData(j++, pnts[0]);		
		getVertexData(j++, pnts[1]);		
		while ( j < end) {
		    getVertexData(j++, pnts[2]);		
		    if (intersectBoundingSphere(pnts, bsphere, null, null)) {
			return true;
		    }
		    pnts[0].set(pnts[1]);
		    pnts[1].set(pnts[2]);
		}
	    }
	    break;
	case PickShape.PICKBOUNDINGPOLYTOPE:
	    BoundingPolytope bpolytope = (BoundingPolytope) targetBound;

	    while (i < stripVertexCounts.length) {
		j = stripStartVertexIndices[i];
		end = j + stripVertexCounts[i++];
		getVertexData(j++, pnts[0]);		
		getVertexData(j++, pnts[1]);		
		while ( j < end) {
		    getVertexData(j++, pnts[2]);		
		    if (intersectBoundingPolytope(pnts, bpolytope, null, null)) {
			return true;
		    }
		    pnts[0].set(pnts[1]);
		    pnts[1].set(pnts[2]);
		}
	    }
	    break;
	default:
	    throw new RuntimeException("Bounds not supported for intersection "
				       + targetBound); 
	}
	return false;
    }

    // From Graphics Gems IV (pg5) and Graphics Gems II, Pg170
    void computeCentroid() {
	Point3d pnt0 = new Point3d();
	Point3d pnt1 = new Point3d();
	Point3d pnt2 = new Point3d();
	Vector3d vec = new Vector3d();
	Vector3d normal = new Vector3d();
	Vector3d tmpvec = new Vector3d();

	double area, totalarea = 0;
	int end, replaceIndex, j, i = 0;
	centroid.x = 0;
	centroid.y = 0;
	centroid.z = 0;

	while( i < stripVertexCounts.length) {
	    j = stripStartVertexIndices[i];
	    end = j + stripVertexCounts[i++];
	    getVertexData(j++, pnt0); 
	    getVertexData(j++, pnt1);
	    replaceIndex = 2;
	    while (j < end) {
		area = 0; 
		switch (replaceIndex) {
		case 0:
		    getVertexData(j++, pnt0);
		    replaceIndex = 1;
		    break;
		case 1:
		    getVertexData(j++, pnt1);
		    replaceIndex = 2;
		    break;
		default:
		    getVertexData(j++, pnt2);
		    replaceIndex = 0;
		}

		// Determine the normal 
		vec.sub(pnt0, pnt1); 
		tmpvec.sub(pnt1, pnt2); 

		// Do the cross product
		normal.cross(vec, tmpvec); 
		normal.normalize();
		// If a degenerate triangle, don't include
		if (Double.isNaN(normal.x + normal.y + normal.z))
		    continue;

		tmpvec.set(0,0,0);
		
		// compute the area 
		getCrossValue(pnt0, pnt1, tmpvec);
		getCrossValue(pnt1, pnt2, tmpvec);
		getCrossValue(pnt2, pnt0, tmpvec);
		area = normal.dot(tmpvec);
		totalarea += area;
		centroid.x += (pnt0.x + pnt1.x + pnt2.x) * area;
		centroid.y += (pnt0.y + pnt1.y + pnt2.y) * area;
		centroid.z += (pnt0.z + pnt1.z + pnt2.z) * area;

	    }
	}

	if (totalarea != 0.0) {
	    area = 1.0/(3.0 * totalarea);
	    centroid.x *= area;
	    centroid.y *= area;
	    centroid.z *= area;
	} 
    }


    int getClassType() {
	return TRIANGLE_TYPE;
    }
}