/*
* Copyright (c) 2003-2007 jMonkeyEngine
* All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions are
* met:
*
* * Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
*
* * Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in the
* documentation and/or other materials provided with the distribution.
*
* * Neither the name of 'jMonkeyEngine' nor the names of its contributors
* may be used to endorse or promote products derived from this software
* without specific prior written permission.
*
* THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
* "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED
* TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
* PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR
* CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL,
* EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,
* PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR
* PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF
* LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING
* NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
* SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
*/
package com.jme.bounding;
import java.io.IOException;
import java.nio.FloatBuffer;
import java.util.ArrayList;
import java.util.logging.Logger;
import com.jme.intersection.IntersectionRecord;
import com.jme.math.FastMath;
import com.jme.math.Plane;
import com.jme.math.Quaternion;
import com.jme.math.Ray;
import com.jme.math.Triangle;
import com.jme.math.Vector3f;
import com.jme.scene.batch.GeomBatch;
import com.jme.scene.batch.TriangleBatch;
import com.jme.util.export.JMEExporter;
import com.jme.util.export.JMEImporter;
import com.jme.util.geom.BufferUtils;
/**
* <code>BoundingSphere</code> defines a sphere that defines a container for a
* group of vertices of a particular piece of geometry. This sphere defines a
* radius and a center. <br>
* <br>
* A typical usage is to allow the class define the center and radius by calling
* either <code>containAABB</code> or <code>averagePoints</code>. A call to
* <code>computeFramePoint</code> in turn calls <code>containAABB</code>.
*
* @author Mark Powell
* @version $Id: BoundingSphere.java,v 1.58 2007/08/02 21:36:35 nca Exp $
*/
public class BoundingSphere extends BoundingVolume {
private static final Logger logger = Logger.getLogger(BoundingSphere.class
.getName());
public float radius;
private static final long serialVersionUID = 2L;
static final private float radiusEpsilon = 1f + 0.00001f;
static final private FloatBuffer _mergeBuf = BufferUtils.createVector3Buffer(8);
static private final Vector3f[] verts = new Vector3f[3];
/**
* Default contstructor instantiates a new <code>BoundingSphere</code>
* object.
*/
public BoundingSphere() {
}
/**
* Constructor instantiates a new <code>BoundingSphere</code> object.
*
* @param r
* the radius of the sphere.
* @param c
* the center of the sphere.
*/
public BoundingSphere(float r, Vector3f c) {
this.center.set(c);
this.radius = r;
}
public int getType() {
return BoundingVolume.BOUNDING_SPHERE;
}
/**
* <code>getRadius</code> returns the radius of the bounding sphere.
*
* @return the radius of the bounding sphere.
*/
public float getRadius() {
return radius;
}
/**
* <code>setRadius</code> sets the radius of this bounding sphere.
*
* @param radius
* the new radius of the bounding sphere.
*/
public void setRadius(float radius) {
this.radius = radius;
}
/**
* <code>computeFromPoints</code> creates a new Bounding Sphere from a
* given set of points. It uses the <code>calcWelzl</code> method as
* default.
*
* @param points
* the points to contain.
*/
public void computeFromPoints(FloatBuffer points) {
calcWelzl(points);
}
/**
* <code>computeFromBatches</code> creates a new Bounding Sphere from a given
* set of batches which contain a list of points.
* It uses the <code>calcWelzl</code> method as default.
*
* @param batches
* the batches to contain.
*/
public void computeFromBatches(ArrayList batches) {
if(batches == null || batches.size() == 0) {
return;
}
BoundingSphere temp = new BoundingSphere();
temp.calcWelzl(((GeomBatch)batches.get(0)).getVertexBuffer());
for(int i = 1; i < batches.size(); i++) {
BoundingSphere bb = new BoundingSphere();
bb.calcWelzl(((GeomBatch)batches.get(i)).getVertexBuffer());
temp.mergeLocal(bb);
}
this.center = temp.getCenter();
this.radius = temp.getRadius();
}
/**
* <code>computeFromTris</code> creates a new Bounding Box from a given
* set of triangles. It is used in OBBTree calculations.
*
* @param tris
* @param start
* @param end
*/
public void computeFromTris(Triangle[] tris, int start, int end) {
if (end - start <= 0) {
return;
}
Vector3f[] vertList = new Vector3f[(end - start) * 3];
int count = 0;
for (int i = start; i < end; i++) {
vertList[count++] = tris[i].get(0);
vertList[count++] = tris[i].get(1);
vertList[count++] = tris[i].get(2);
}
averagePoints(vertList);
}
/**
* <code>computeFromTris</code> creates a new Bounding Box from a given
* set of triangles. It is used in OBBTree calculations.
*
* @param indices
* @param batch
* @param start
* @param end
*/
public void computeFromTris(int[] indices, TriangleBatch batch, int start, int end) {
if (end - start <= 0) {
return;
}
Vector3f[] vertList = new Vector3f[(end - start) * 3];
int count = 0;
for (int i = start; i < end; i++) {
batch.getTriangle(indices[i], verts);
vertList[count++] = new Vector3f(verts[0]);
vertList[count++] = new Vector3f(verts[1]);
vertList[count++] = new Vector3f(verts[2]);
}
averagePoints(vertList);
}
/**
* Calculates a minimum bounding sphere for the set of points. The algorithm
* was originally found at
* http://www.flipcode.com/cgi-bin/msg.cgi?showThread=COTD-SmallestEnclosingSpheres&forum=cotd&id=-1
* in C++ and translated to java by Cep21
*
* @param points
* The points to calculate the minimum bounds from.
*/
public void calcWelzl(FloatBuffer points) {
if (center == null)
center = new Vector3f();
FloatBuffer buf = BufferUtils.createFloatBuffer(points.limit());
points.rewind();
buf.put(points);
buf.flip();
recurseMini(buf, buf.limit() / 3, 0, 0);
}
private static Vector3f tempA = new Vector3f(), tempB = new Vector3f(), tempC = new Vector3f(), tempD = new Vector3f();
/**
* Used from calcWelzl. This function recurses to calculate a minimum
* bounding sphere a few points at a time.
*
* @param points
* The array of points to look through.
* @param p
* The size of the list to be used.
* @param b
* The number of points currently considering to include with the
* sphere.
* @param ap
* A variable simulating pointer arithmatic from C++, and offset
* in <code>points</code>.
*/
private void recurseMini(FloatBuffer points, int p, int b, int ap) {
switch (b) {
case 0:
this.radius = 0;
this.center.set(0, 0, 0);
break;
case 1:
this.radius = 1f - radiusEpsilon;
BufferUtils.populateFromBuffer(center, points, ap-1);
break;
case 2:
BufferUtils.populateFromBuffer(tempA, points, ap-1);
BufferUtils.populateFromBuffer(tempB, points, ap-2);
setSphere(tempA, tempB);
break;
case 3:
BufferUtils.populateFromBuffer(tempA, points, ap-1);
BufferUtils.populateFromBuffer(tempB, points, ap-2);
BufferUtils.populateFromBuffer(tempC, points, ap-3);
setSphere(tempA, tempB, tempC);
break;
case 4:
BufferUtils.populateFromBuffer(tempA, points, ap-1);
BufferUtils.populateFromBuffer(tempB, points, ap-2);
BufferUtils.populateFromBuffer(tempC, points, ap-3);
BufferUtils.populateFromBuffer(tempD, points, ap-4);
setSphere(tempA, tempB, tempC, tempD);
return;
}
for (int i = 0; i < p; i++) {
BufferUtils.populateFromBuffer(tempA, points, i+ap);
if (tempA.distanceSquared(center) - (radius * radius) > radiusEpsilon - 1f) {
for (int j = i; j > 0; j--) {
BufferUtils.populateFromBuffer(tempB, points, j + ap);
BufferUtils.populateFromBuffer(tempC, points, j - 1 + ap);
BufferUtils.setInBuffer(tempC, points, j + ap);
BufferUtils.setInBuffer(tempB, points, j - 1 + ap);
}
recurseMini(points, i, b + 1, ap + 1);
}
}
}
/**
* Calculates the minimum bounding sphere of 4 points. Used in welzl's
* algorithm.
*
* @param O
* The 1st point inside the sphere.
* @param A
* The 2nd point inside the sphere.
* @param B
* The 3rd point inside the sphere.
* @param C
* The 4th point inside the sphere.
* @see #calcWelzl(java.nio.FloatBuffer)
*/
private void setSphere(Vector3f O, Vector3f A, Vector3f B, Vector3f C) {
Vector3f a = A.subtract(O);
Vector3f b = B.subtract(O);
Vector3f c = C.subtract(O);
float Denominator = 2.0f * (a.x * (b.y * c.z - c.y * b.z) - b.x
* (a.y * c.z - c.y * a.z) + c.x * (a.y * b.z - b.y * a.z));
if (Denominator == 0) {
center.set(0, 0, 0);
radius = 0;
} else {
Vector3f o = a.cross(b).multLocal(c.lengthSquared()).addLocal(
c.cross(a).multLocal(b.lengthSquared())).addLocal(
b.cross(c).multLocal(a.lengthSquared())).divideLocal(
Denominator);
radius = o.length() * radiusEpsilon;
O.add(o, center);
}
}
/**
* Calculates the minimum bounding sphere of 3 points. Used in welzl's
* algorithm.
*
* @param O
* The 1st point inside the sphere.
* @param A
* The 2nd point inside the sphere.
* @param B
* The 3rd point inside the sphere.
* @see #calcWelzl(java.nio.FloatBuffer)
*/
private void setSphere(Vector3f O, Vector3f A, Vector3f B) {
Vector3f a = A.subtract(O);
Vector3f b = B.subtract(O);
Vector3f acrossB = a.cross(b);
float Denominator = 2.0f * acrossB.dot(acrossB);
if (Denominator == 0) {
center.set(0, 0, 0);
radius = 0;
} else {
Vector3f o = acrossB.cross(a).multLocal(b.lengthSquared())
.addLocal(b.cross(acrossB).multLocal(a.lengthSquared()))
.divideLocal(Denominator);
radius = o.length() * radiusEpsilon;
O.add(o, center);
}
}
/**
* Calculates the minimum bounding sphere of 2 points. Used in welzl's
* algorithm.
*
* @param O
* The 1st point inside the sphere.
* @param A
* The 2nd point inside the sphere.
* @see #calcWelzl(java.nio.FloatBuffer)
*/
private void setSphere(Vector3f O, Vector3f A) {
radius = FastMath.sqrt(((A.x - O.x) * (A.x - O.x) + (A.y - O.y)
* (A.y - O.y) + (A.z - O.z) * (A.z - O.z)) / 4f) + radiusEpsilon - 1f;
center.interpolate(O, A, .5f);
}
/**
* <code>averagePoints</code> selects the sphere center to be the average
* of the points and the sphere radius to be the smallest value to enclose
* all points.
*
* @param points
* the list of points to contain.
*/
public void averagePoints(Vector3f[] points) {
logger.info("Bounding Sphere calculated using average points.");
center = points[0];
for (int i = 1; i < points.length; i++) {
center.addLocal(points[i]);
}
float quantity = 1.0f / points.length;
center.multLocal(quantity);
float maxRadiusSqr = 0;
for (int i = 0; i < points.length; i++) {
Vector3f diff = points[i].subtract(center);
float radiusSqr = diff.lengthSquared();
if (radiusSqr > maxRadiusSqr) {
maxRadiusSqr = radiusSqr;
}
}
radius = (float) Math.sqrt(maxRadiusSqr) + radiusEpsilon - 1f;
}
/**
* <code>transform</code> modifies the center of the sphere to reflect the
* change made via a rotation, translation and scale.
*
* @param rotate
* the rotation change.
* @param translate
* the translation change.
* @param scale
* the size change.
* @param store
* sphere to store result in
* @return BoundingVolume
* @return ref
*/
public BoundingVolume transform(Quaternion rotate, Vector3f translate,
Vector3f scale, BoundingVolume store) {
BoundingSphere sphere;
if (store == null || store.getType() != BoundingVolume.BOUNDING_SPHERE) {
sphere = new BoundingSphere(1, new Vector3f(0, 0, 0));
} else {
sphere = (BoundingSphere) store;
}
center.mult(scale, sphere.center);
rotate.mult(sphere.center, sphere.center);
sphere.center.addLocal(translate);
sphere.radius = FastMath.abs(getMaxAxis(scale) * radius) + radiusEpsilon - 1f;
return sphere;
}
private float getMaxAxis(Vector3f scale) {
float x = FastMath.abs(scale.x);
float y = FastMath.abs(scale.y);
float z = FastMath.abs(scale.z);
if (x >= y) {
if (x >= z)
return x;
return z;
}
if (y >= z)
return y;
return z;
}
/**
* <code>whichSide</code> takes a plane (typically provided by a view
* frustum) to determine which side this bound is on.
*
* @param plane
* the plane to check against.
* @return side
*/
public int whichSide(Plane plane) {
float distance = plane.pseudoDistance(center);
if (distance <= -radius) {
return Plane.NEGATIVE_SIDE;
} else if (distance >= radius) {
return Plane.POSITIVE_SIDE;
} else {
return Plane.NO_SIDE;
}
}
/**
* <code>merge</code> combines this sphere with a second bounding sphere.
* This new sphere contains both bounding spheres and is returned.
*
* @param volume
* the sphere to combine with this sphere.
* @return the new sphere
*/
public BoundingVolume merge(BoundingVolume volume) {
if (volume == null) {
return this;
}
switch(volume.getType()) {
case BoundingVolume.BOUNDING_SPHERE: {
BoundingSphere sphere = (BoundingSphere) volume;
float temp_radius = sphere.getRadius();
Vector3f temp_center = sphere.getCenter();
BoundingSphere rVal = new BoundingSphere();
return merge(temp_radius, temp_center, rVal);
}
case BoundingVolume.BOUNDING_CAPSULE: {
BoundingCapsule capsule = (BoundingCapsule) volume;
float temp_radius = capsule.getRadius()
+ capsule.getLineSegment().getExtent();
Vector3f temp_center = capsule.getCenter();
BoundingSphere rVal = new BoundingSphere();
return merge(temp_radius, temp_center, rVal);
}
case BoundingVolume.BOUNDING_BOX: {
BoundingBox box = (BoundingBox) volume;
Vector3f radVect = new Vector3f(box.xExtent, box.yExtent,
box.zExtent);
Vector3f temp_center = box.center;
BoundingSphere rVal = new BoundingSphere();
return merge(radVect.length(), temp_center, rVal);
}
case BoundingVolume.BOUNDING_OBB: {
OrientedBoundingBox box = (OrientedBoundingBox) volume;
BoundingSphere rVal = (BoundingSphere) this.clone(null);
return rVal.mergeOBB(box);
}
default:
return null;
}
}
private Vector3f tmpRadVect = new Vector3f();
/**
* <code>mergeLocal</code> combines this sphere with a second bounding
* sphere locally. Altering this sphere to contain both the original and the
* additional sphere volumes;
*
* @param volume
* the sphere to combine with this sphere.
* @return this
*/
public BoundingVolume mergeLocal(BoundingVolume volume) {
if (volume == null) {
return this;
}
switch (volume.getType()) {
case BoundingVolume.BOUNDING_SPHERE: {
BoundingSphere sphere = (BoundingSphere) volume;
float temp_radius = sphere.getRadius();
Vector3f temp_center = sphere.getCenter();
return merge(temp_radius, temp_center, this);
}
case BoundingVolume.BOUNDING_BOX: {
BoundingBox box = (BoundingBox) volume;
Vector3f radVect = tmpRadVect;
radVect.set(box.xExtent, box.yExtent, box.zExtent);
Vector3f temp_center = box.center;
return merge(radVect.length(), temp_center, this);
}
case BoundingVolume.BOUNDING_OBB: {
return mergeOBB((OrientedBoundingBox) volume);
}
case BoundingVolume.BOUNDING_CAPSULE: {
BoundingCapsule capsule = (BoundingCapsule) volume;
return merge(capsule.getRadius() + capsule.getLineSegment().getExtent(),
capsule.getCenter(), this);
}
default:
return null;
}
}
/**
* Merges this sphere with the given OBB.
*
* @param volume
* The OBB to merge.
* @return This sphere, after merging.
*/
private BoundingSphere mergeOBB(OrientedBoundingBox volume) {
// compute edge points from the obb
if (!volume.correctCorners)
volume.computeCorners();
_mergeBuf.rewind();
for (int i = 0; i < 8; i++) {
_mergeBuf.put(volume.vectorStore[i].x);
_mergeBuf.put(volume.vectorStore[i].y);
_mergeBuf.put(volume.vectorStore[i].z);
}
// remember old radius and center
float oldRadius = radius;
Vector3f oldCenter = _compVect2.set( center );
// compute new radius and center from obb points
computeFromPoints(_mergeBuf);
Vector3f newCenter = _compVect1.set( center );
float newRadius = radius;
// restore old center and radius
center.set( oldCenter );
radius = oldRadius;
//merge obb points result
merge( newRadius, newCenter, this );
return this;
}
private BoundingVolume merge(float temp_radius, Vector3f temp_center,
BoundingSphere rVal) {
Vector3f diff = temp_center.subtract(center, _compVect1);
float lengthSquared = diff.lengthSquared();
float radiusDiff = temp_radius - radius;
float fRDiffSqr = radiusDiff * radiusDiff;
if (fRDiffSqr >= lengthSquared) {
if (radiusDiff <= 0.0f) {
return this;
}
Vector3f rCenter = rVal.getCenter();
if ( rCenter == null ) {
rVal.setCenter( rCenter = new Vector3f() );
}
rCenter.set(temp_center);
rVal.setRadius(temp_radius);
return rVal;
}
float length = (float) Math.sqrt(lengthSquared);
Vector3f rCenter = rVal.getCenter();
if ( rCenter == null ) {
rVal.setCenter( rCenter = new Vector3f() );
}
if (length > radiusEpsilon) {
float coeff = (length + radiusDiff) / (2.0f * length);
rCenter.set(center.addLocal(diff.multLocal(coeff)));
} else {
rCenter.set(center);
}
rVal.setRadius(0.5f * (length + radius + temp_radius));
return rVal;
}
/**
* <code>clone</code> creates a new BoundingSphere object containing the
* same data as this one.
*
* @param store
* where to store the cloned information. if null or wrong class,
* a new store is created.
* @return the new BoundingSphere
*/
public BoundingVolume clone(BoundingVolume store) {
if (store != null && store.getType() == BoundingVolume.BOUNDING_SPHERE) {
BoundingSphere rVal = (BoundingSphere) store;
if (null == rVal.center) {
rVal.center = new Vector3f();
}
rVal.center.set(center);
rVal.radius = radius;
rVal.checkPlane = checkPlane;
return rVal;
}
return new BoundingSphere(radius,
(center != null ? (Vector3f) center.clone() : null));
}
/**
* <code>toString</code> returns the string representation of this object.
* The form is: "Radius: RRR.SSSS Center: <Vector>".
*
* @return the string representation of this.
*/
public String toString() {
return "com.jme.scene.BoundingSphere [Radius: " + radius + " Center: "
+ center + "]";
}
/*
* (non-Javadoc)
*
* @see com.jme.bounding.BoundingVolume#intersects(com.jme.bounding.BoundingVolume)
*/
public boolean intersects(BoundingVolume bv) {
if (bv == null)
return false;
return bv.intersectsSphere(this);
}
/*
* (non-Javadoc)
*
* @see com.jme.bounding.BoundingVolume#intersectsSphere(com.jme.bounding.BoundingSphere)
*/
public boolean intersectsSphere(BoundingSphere bs) {
Vector3f diff = getCenter().subtract(bs.getCenter(), _compVect1);
float rsum = getRadius() + bs.getRadius();
return (diff.dot(diff) <= rsum * rsum);
}
/*
* (non-Javadoc)
*
* @see com.jme.bounding.BoundingVolume#intersectsBoundingBox(com.jme.bounding.BoundingBox)
*/
public boolean intersectsBoundingBox(BoundingBox bb) {
if (FastMath.abs(bb.center.x - getCenter().x) < getRadius()
+ bb.xExtent
&& FastMath.abs(bb.center.y - getCenter().y) < getRadius()
+ bb.yExtent
&& FastMath.abs(bb.center.z - getCenter().z) < getRadius()
+ bb.zExtent)
return true;
return false;
}
/*
* (non-Javadoc)
*
* @see com.jme.bounding.BoundingVolume#intersectsOrientedBoundingBox(com.jme.bounding.OrientedBoundingBox)
*/
public boolean intersectsOrientedBoundingBox(OrientedBoundingBox obb) {
return obb.intersectsSphere(this);
}
public boolean intersectsCapsule(BoundingCapsule bc) {
return bc.intersectsSphere(this);
}
/*
* (non-Javadoc)
*
* @see com.jme.bounding.BoundingVolume#intersects(com.jme.math.Ray)
*/
public boolean intersects(Ray ray) {
Vector3f diff = _compVect1.set(ray.getOrigin())
.subtractLocal(getCenter());
float radiusSquared = getRadius() * getRadius();
float a = diff.dot(diff) - radiusSquared;
if (a <= 0.0) {
// in sphere
return true;
}
// outside sphere
float b = ray.getDirection().dot(diff);
if (b >= 0.0) {
return false;
}
return b*b >= a;
}
/*
* (non-Javadoc)
*
* @see com.jme.bounding.BoundingVolume#intersectsWhere(com.jme.math.Ray)
*/
public IntersectionRecord intersectsWhere(Ray ray) {
Vector3f diff = _compVect1.set(ray.getOrigin()).subtractLocal(
getCenter());
float a = diff.dot(diff) - (getRadius()*getRadius());
float a1, discr, root;
if (a <= 0.0) {
// inside sphere
a1 = ray.direction.dot(diff);
discr = (a1 * a1) - a;
root = FastMath.sqrt(discr);
float[] distances = new float[] { root - a1 };
Vector3f[] points = new Vector3f[] { new Vector3f(ray.direction)
.multLocal(distances[0]).addLocal(ray.origin) };
IntersectionRecord record = new IntersectionRecord(distances, points);
return record;
}
a1 = ray.direction.dot(diff);
if (a1 >= 0.0) {
return new IntersectionRecord();
}
discr = a1*a1 - a;
if (discr < 0.0)
return new IntersectionRecord();
else if (discr >= FastMath.ZERO_TOLERANCE) {
root = FastMath.sqrt(discr);
float[] distances = new float[] { -a1 - root, -a1 + root };
Vector3f[] points = new Vector3f[] {
new Vector3f(ray.direction).multLocal(distances[0]).addLocal(ray.origin),
new Vector3f(ray.direction).multLocal(distances[1]).addLocal(ray.origin)
};
IntersectionRecord record = new IntersectionRecord(distances, points);
return record;
} else {
float[] distances = new float[] { -a1 };
Vector3f[] points = new Vector3f[] {
new Vector3f(ray.direction).multLocal(distances[0]).addLocal(ray.origin)
};
IntersectionRecord record = new IntersectionRecord(distances, points);
return record;
}
}
@Override
public boolean contains(Vector3f point) {
return getCenter().distanceSquared(point) < (getRadius() * getRadius());
}
public float distanceToEdge(Vector3f point) {
return center.distance(point) - radius;
}
public void write(JMEExporter e) throws IOException {
super.write(e);
try {
e.getCapsule(this).write(radius, "radius", 0);
} catch (IOException ex) {
logger.throwing(this.getClass().toString(), "write(JMEExporter)", ex);
}
}
public void read(JMEImporter e) throws IOException {
super.read(e);
try {
radius = e.getCapsule(this).readFloat("radius", 0);
} catch (IOException ex) {
logger.throwing(this.getClass().toString(), "read(JMEImporter)", ex);
}
}
@Override
public float getVolume() {
return 4 * FastMath.ONE_THIRD * FastMath.PI * radius * radius * radius;
}
}
