PolyhedronsSet

PolyhedronsSet

The leaf nodes of the BSP tree must have a
Boolean attribute representing the inside status of
the corresponding cell (true for inside cells, false for outside
cells). In order to avoid building too many small objects, it is
recommended to use the predefined constants
Boolean.TRUE and Boolean.FALSE

PolyhedronsSet

The boundary is provided as a collection of sub-hyperplanes. Each sub-hyperplane has the
interior part of the region on its minus side and the exterior on
its plus side.

The boundary elements can be in any order, and can form
several non-connected sets (like for example polyhedrons with holes
or a set of disjoint polyhedrons considered as a whole). In
fact, the elements do not even need to be connected together
(their topological connections are not used here). However, if the
boundary does not really separate an inside open from an outside
open (open having here its topological meaning), then subsequent
calls to the checkPoint method will
not be meaningful anymore.

If the boundary is empty, the region will represent the whole
space.

Parameters:

boundary - collection of boundary elements, as a
collection of SubHyperplane objects

buildNew

This method allow to create new instances without knowing
exactly the type of the region. It is an application of the
prototype design pattern.

The leaf nodes of the BSP tree must have a
Boolean attribute representing the inside status of
the corresponding cell (true for inside cells, false for outside
cells). In order to avoid building too many small objects, it is
recommended to use the predefined constants
Boolean.TRUE and Boolean.FALSE. The
tree also must have either null internal nodes or
internal nodes representing the boundary as specified in the
getTree method).