public class PolyhedronsSet extends AbstractRegion<Euclidean3D,Euclidean2D>
Modifier and Type  Class and Description 

static class 
PolyhedronsSet.BRep
Container for Boundary REPresentation (BRep).

Region.Location
Constructor and Description 

PolyhedronsSet(BSPTree<Euclidean3D> tree,
double tolerance)
Build a polyhedrons set from a BSP tree.

PolyhedronsSet(Collection<SubHyperplane<Euclidean3D>> boundary,
double tolerance)
Build a polyhedrons set from a Boundary REPresentation (Brep) specified by subhyperplanes.

PolyhedronsSet(double tolerance)
Build a polyhedrons set representing the whole real line.

PolyhedronsSet(double xMin,
double xMax,
double yMin,
double yMax,
double zMin,
double zMax,
double tolerance)
Build a parallellepipedic box.

PolyhedronsSet(List<Vector3D> vertices,
List<int[]> facets,
double tolerance)
Build a polyhedrons set from a Boundary REPresentation (Brep) specified by connected vertices.

PolyhedronsSet(PolyhedronsSet.BRep brep,
double tolerance)
Build a polyhedrons set from a Boundary REPresentation (Brep) specified by connected vertices.

Modifier and Type  Method and Description 

PolyhedronsSet 
buildNew(BSPTree<Euclidean3D> tree)
Build a region using the instance as a prototype.

protected void 
computeGeometricalProperties()
Compute some geometrical properties.

SubHyperplane<Euclidean3D> 
firstIntersection(Vector3D point,
Line line)
Get the first subhyperplane crossed by a semiinfinite line.

PolyhedronsSet.BRep 
getBRep()
Get the boundary representation of the instance.

PolyhedronsSet 
rotate(Vector3D center,
Rotation rotation)
Rotate the region around the specified point.

PolyhedronsSet 
translate(Vector3D translation)
Translate the region by the specified amount.

applyTransform, checkPoint, checkPoint, checkPoint, checkPoint, contains, copySelf, getBarycenter, getBoundarySize, getSize, getTolerance, getTree, intersection, isEmpty, isEmpty, isFull, isFull, projectToBoundary, setBarycenter, setBarycenter, setSize
public PolyhedronsSet(double tolerance)
tolerance
 tolerance below which points are considered identicalpublic PolyhedronsSet(BSPTree<Euclidean3D> tree, double tolerance)
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
This constructor is aimed at expert use, as building the tree may
be a difficult task. It is not intended for general use and for
performances reasons does not check thoroughly its input, as this would
require walking the full tree each time. Failing to provide a tree with
the proper attributes, will therefore generate problems like
NullPointerException
or ClassCastException
only later on.
This limitation is known and explains why this constructor is for expert
use only. The caller does have the responsibility to provided correct arguments.
tree
 inside/outside BSP tree representing the regiontolerance
 tolerance below which points are considered identicalpublic PolyhedronsSet(Collection<SubHyperplane<Euclidean3D>> boundary, double tolerance)
The boundary is provided as a collection of subhyperplanes
. Each subhyperplane 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 nonconnected 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.
boundary
 collection of boundary elements, as a
collection of SubHyperplane
objectstolerance
 tolerance below which points are considered identicalpublic PolyhedronsSet(List<Vector3D> vertices, List<int[]> facets, double tolerance)
The boundary is provided as a list of vertices and a list of facets. Each facet is specified as an integer array containing the arrays vertices indices in the vertices list. Each facet normal is oriented by right hand rule to the facet vertices list.
Some basic sanity checks are performed but not everything is thoroughly assessed, so it remains under caller responsibility to ensure the vertices and facets are consistent and properly define a polyhedrons set.
vertices
 list of polyhedrons set verticesfacets
 list of facets, as vertices indices in the vertices listtolerance
 tolerance below which points are considered identicalMathIllegalArgumentException
 if some basic sanity checks failpublic PolyhedronsSet(PolyhedronsSet.BRep brep, double tolerance)
Some basic sanity checks are performed but not everything is thoroughly assessed, so it remains under caller responsibility to ensure the vertices and facets are consistent and properly define a polyhedrons set.
brep
 Boundary REPresentation of the polyhedron to buildtolerance
 tolerance below which points are considered identicalMathIllegalArgumentException
 if some basic sanity checks failpublic PolyhedronsSet(double xMin, double xMax, double yMin, double yMax, double zMin, double zMax, double tolerance)
xMin
 low bound along the x directionxMax
 high bound along the x directionyMin
 low bound along the y directionyMax
 high bound along the y directionzMin
 low bound along the z directionzMax
 high bound along the z directiontolerance
 tolerance below which points are considered identicalpublic PolyhedronsSet buildNew(BSPTree<Euclidean3D> tree)
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).
buildNew
in interface Region<Euclidean3D>
buildNew
in class AbstractRegion<Euclidean3D,Euclidean2D>
tree
 inside/outside BSP tree representing the new regionpublic PolyhedronsSet.BRep getBRep() throws MathRuntimeException
The boundary representation can be extracted only from
bounded polyhedrons sets. If the polyhedrons set is unbounded,
a MathRuntimeException
will be thrown.
The boundary representation extracted is not minimal, as for example canonical facets may be split into several smaller independent subfacets sharing the same plane and connected by their edges.
As the BRep
representation does not support
facets with several boundary loops (for example facets with
holes), an exception is triggered when attempting to extract
BRep from such complex polyhedrons sets.
MathRuntimeException
 if polyhedrons is unboundedprotected void computeGeometricalProperties()
The properties to compute are the barycenter and the size.
computeGeometricalProperties
in class AbstractRegion<Euclidean3D,Euclidean2D>
public SubHyperplane<Euclidean3D> firstIntersection(Vector3D point, Line line)
point
 start point of the part of the line consideredline
 line to consider (contains point)public PolyhedronsSet rotate(Vector3D center, Rotation rotation)
The instance is not modified, a new instance is created.
center
 rotation centerrotation
 vectorial rotation operatorpublic PolyhedronsSet translate(Vector3D translation)
The instance is not modified, a new instance is created.
translation
 translation to applyCopyright © 2016–2020 Hipparchus.org. All rights reserved.