de.grogra.vecmath.geom
public class CSGIntersection extends CompoundVolume
volumes| Constructor and Description |
|---|
CSGIntersection()
Creates a new
CSGIntersection whose list of volumes
is empty. |
CSGIntersection(Volume a,
Volume b)
Creates a new
CSGIntersection whose list of volumes
is set to [a, b]. |
| Modifier and Type | Method and Description |
|---|---|
boolean |
computeIntersections(Line line,
int which,
IntersectionList list,
Intersection excludeStart,
Intersection excludeEnd)
Computes intersections between the boundary surface of this object
and the specified
line. |
boolean |
contains(Tuple3d point,
boolean open)
Determines if the given
point lies within this object. |
void |
getExtent(Tuple3d min,
Tuple3d max,
Variables temp)
Computes the extent of this volume, i.e., an axis-aligned
bounding box between
min and max. |
Volume |
operator$and(Volume v)
This operator method creates the intersection of this volume
and
v. |
boxContainsBoundary, computeNormal, computeTangents, computeUVaddConvexIntersections, getId, operator$com, operator$or, operator$sub, setIdpublic CSGIntersection()
CSGIntersection whose list of volumes
is empty.public boolean computeIntersections(Line line, int which, IntersectionList list, Intersection excludeStart, Intersection excludeEnd)
Volumeline. The intersections are added
to list in ascending order of distance
(i.e., of Intersection.parameter), where the
parameter has to lie between line.start
and line.end.
Implementations of this method must not
clear or modify the existing intersections in list.
The parameter which has to be one of
Intersection.ALL, Intersection.CLOSEST,
Intersection.ANY. It determines if all intersections
have to be added to the list, only the closest (minimal
value of Intersection.parameter), or an arbitrary
of the set of all intersections. Only in case of ALL,
the return value of this method is precise.
If specific intersection points should be excluded from the list
of computed intersections, they have to be specified in
excludeStart and excludeEnd.
The intersection point of excludeStart has to be the
starting point of line, the intersection point of
excludeEnd has to be the end point of line.
The exclusion of intersections is a useful feature for
ray-tracing, e.g., when a ray is re-emitted at an intersection point
in another direction.
line - a linewhich - one of Intersection.ALL,
Intersection.CLOSEST, Intersection.ANY, this
determines which intersections have to be added to listlist - the intersections are added to this listexcludeStart - intersection at start point which shall be excluded, or nullexcludeEnd - intersection at end point which shall be excluded, or nulltrue iff the beginning of the line lies
within the volume (i.e., if the line starts within the volume or
enters the volume at the starting point); however note that the returned
value is valid only if which == Intersection.ALLpublic boolean contains(Tuple3d point, boolean open)
Volumepoint lies within this object.
If open is true, the interior of the volume
is considered (the largest open set contained in the volume,
i.e., excluding the boundary), otherwise the closure of the volume.point - a point in global world coordinatesopen - consider open or closed settrue iff point is an element of the setpublic void getExtent(Tuple3d min, Tuple3d max, Variables temp)
Volumemin and max.min - minimum coordinates of bounding box are placed in heremax - maximum coordinates of bounding box are placed in heretemp - has to be provided by the invoker, may be used in implementationspublic Volume operator$and(Volume v)
Volumev.operator$and in interface Volumeoperator$and in class VolumeBasev - a volumea and bCSGIntersection