Package org.hipparchus.geometry.partitioning

Class AbstractRegion<S extends Space,​P extends Point<S,​P>,​H extends Hyperplane<S,​P,​H,​I>,​I extends SubHyperplane<S,​P,​H,​I>,​T extends Space,​Q extends Point<T,​Q>,​F extends Hyperplane<T,​Q,​F,​J>,​J extends SubHyperplane<T,​Q,​F,​J>>

  • Type Parameters:
    S - Type of the space.
    P - Type of the points in space.
    H - Type of the hyperplane.
    I - Type of the sub-hyperplane.
    T - Type of the sub-space.
    Q - Type of the points in sub-space.
    F - Type of the hyperplane.
    J - Type of the sub-hyperplane.
    All Implemented Interfaces:
    Region<S,​P,​H,​I>
    Direct Known Subclasses:
    ArcsSet, IntervalsSet, PolygonsSet, PolyhedronsSet, SphericalPolygonsSet
    public abstract class AbstractRegion<S extends Space,​P extends Point<S,​P>,​H extends Hyperplane<S,​P,​H,​I>,​I extends SubHyperplane<S,​P,​H,​I>,​T extends Space,​Q extends Point<T,​Q>,​F extends Hyperplane<T,​Q,​F,​J>,​J extends SubHyperplane<T,​Q,​F,​J>>
extends Object
implements Region<S,​P,​H,​I>
    Abstract class for all regions, independently of geometry type or dimension.

    • Constructor Detail

      • AbstractRegion

        protected AbstractRegion​(double tolerance)
        Build a region representing the whole space.
        Parameters:
        tolerance - tolerance below which points are considered identical.

      • AbstractRegion

        protected AbstractRegion​(BSPTree<S,​P,​H,​I> tree,
                         double tolerance)
        Build a region from an inside/outside BSP tree.

        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).

        Parameters:
        tree - inside/outside BSP tree representing the region
        tolerance - tolerance below which points are considered identical.

      • AbstractRegion

        protected AbstractRegion​(Collection<I> boundary,
                         double tolerance)
        Build a Region from a Boundary REPresentation (B-rep).

        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 polygons with holes or a set of disjoints 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
        tolerance - tolerance below which points are considered identical.

      • AbstractRegion

        public AbstractRegion​(H[] hyperplanes,
                      double tolerance)
        Build a convex region from an array of bounding hyperplanes.
        Parameters:
        hyperplanes - array of bounding hyperplanes (if null, an empty region will be built)
        tolerance - tolerance below which points are considered identical.

    • Method Detail

      • buildNew

        public abstract AbstractRegion<S,​P,​H,​I,​T,​Q,​F,​J> buildNew​(BSPTree<S,​P,​H,​I> newTree)
        Build a region using the instance as a prototype.

        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).

        Specified by:
        buildNew in interface Region<S extends Space,​P extends Point<S,​P>,​H extends Hyperplane<S,​P,​H,​I>,​I extends SubHyperplane<S,​P,​H,​I>>
        Parameters:
        newTree - inside/outside BSP tree representing the new region
        Returns:
        the built region

      • getTolerance

        public double getTolerance()
        Get the tolerance below which points are considered to belong to hyperplanes.
        Returns:
        tolerance below which points are considered to belong to hyperplanes

      • copySelf

        public AbstractRegion<S,​P,​H,​I,​T,​Q,​F,​J> copySelf()
        Copy the instance.

        The instance created is completely independant of the original one. A deep copy is used, none of the underlying objects are shared (except for the underlying tree Boolean attributes and immutable objects).

        Specified by:
        copySelf in interface Region<S extends Space,​P extends Point<S,​P>,​H extends Hyperplane<S,​P,​H,​I>,​I extends SubHyperplane<S,​P,​H,​I>>
        Returns:
        a new region, copy of the instance

      • isEmpty

        public boolean isEmpty​(BSPTree<S,​P,​H,​I> node)
        Check if the sub-tree starting at a given node is empty.
        Specified by:
        isEmpty in interface Region<S extends Space,​P extends Point<S,​P>,​H extends Hyperplane<S,​P,​H,​I>,​I extends SubHyperplane<S,​P,​H,​I>>
        Parameters:
        node - root node of the sub-tree (must have Region tree semantics, i.e. the leaf nodes must have Boolean attributes representing an inside/outside property)
        Returns:
        true if the sub-tree starting at the given node is empty

      • isFull

        public boolean isFull()
        Check if the instance covers the full space.
        Specified by:
        isFull in interface Region<S extends Space,​P extends Point<S,​P>,​H extends Hyperplane<S,​P,​H,​I>,​I extends SubHyperplane<S,​P,​H,​I>>
        Returns:
        true if the instance covers the full space

      • isFull

        public boolean isFull​(BSPTree<S,​P,​H,​I> node)
        Check if the sub-tree starting at a given node covers the full space.
        Specified by:
        isFull in interface Region<S extends Space,​P extends Point<S,​P>,​H extends Hyperplane<S,​P,​H,​I>,​I extends SubHyperplane<S,​P,​H,​I>>
        Parameters:
        node - root node of the sub-tree (must have Region tree semantics, i.e. the leaf nodes must have Boolean attributes representing an inside/outside property)
        Returns:
        true if the sub-tree starting at the given node covers the full space

      • contains

        public boolean contains​(Region<S,​P,​H,​I> region)
        Check if the instance entirely contains another region.
        Specified by:
        contains in interface Region<S extends Space,​P extends Point<S,​P>,​H extends Hyperplane<S,​P,​H,​I>,​I extends SubHyperplane<S,​P,​H,​I>>
        Parameters:
        region - region to check against the instance
        Returns:
        true if the instance contains the specified tree

      • checkPoint

        protected Region.Location checkPoint​(BSPTree<S,​P,​H,​I> node,
                                     P point)
        Check a point with respect to the region starting at a given node.
        Parameters:
        node - root node of the region
        point - point to check
        Returns:
        a code representing the point status: either INSIDE, OUTSIDE or BOUNDARY

      • getTree

        public BSPTree<S,​P,​H,​I> getTree​(boolean includeBoundaryAttributes)
        Get the underlying BSP tree.

        Regions are represented by an underlying inside/outside BSP tree whose leaf attributes are Boolean instances representing inside leaf cells if the attribute value is true and outside leaf cells if the attribute is false. These leaf attributes are always present and guaranteed to be non null.

        In addition to the leaf attributes, the internal nodes which correspond to cells split by cut sub-hyperplanes may contain BoundaryAttribute objects representing the parts of the corresponding cut sub-hyperplane that belong to the boundary. When the boundary attributes have been computed, all internal nodes are guaranteed to have non-null attributes, however some BoundaryAttribute instances may have their getPlusInside and getPlusOutside methods both returning null if the corresponding cut sub-hyperplane does not have any parts belonging to the boundary.

        Since computing the boundary is not always required and can be time-consuming for large trees, these internal nodes attributes are computed using lazy evaluation only when required by setting the includeBoundaryAttributes argument to true. Once computed, these attributes remain in the tree, which implies that in this case, further calls to the method for the same region will always include these attributes regardless of the value of the includeBoundaryAttributes argument.

        Specified by:
        getTree in interface Region<S extends Space,​P extends Point<S,​P>,​H extends Hyperplane<S,​P,​H,​I>,​I extends SubHyperplane<S,​P,​H,​I>>
        Parameters:
        includeBoundaryAttributes - if true, the boundary attributes at internal nodes are guaranteed to be included (they may be included even if the argument is false, if they have already been computed due to a previous call)
        Returns:
        underlying BSP tree
        See Also:
        BoundaryAttribute

      • getBoundarySize

        public double getBoundarySize()
        Get the size of the boundary.
        Specified by:
        getBoundarySize in interface Region<S extends Space,​P extends Point<S,​P>,​H extends Hyperplane<S,​P,​H,​I>,​I extends SubHyperplane<S,​P,​H,​I>>
        Returns:
        the size of the boundary (this is 0 in 1D, a length in 2D, an area in 3D ...)

      • getSize

        public double getSize()
        Get the size of the instance.
        Specified by:
        getSize in interface Region<S extends Space,​P extends Point<S,​P>,​H extends Hyperplane<S,​P,​H,​I>,​I extends SubHyperplane<S,​P,​H,​I>>
        Returns:
        the size of the instance (this is a length in 1D, an area in 2D, a volume in 3D ...)

      • setSize

        protected void setSize​(double size)
        Set the size of the instance.
        Parameters:
        size - size of the instance

      • setBarycenter

        protected void setBarycenter​(P barycenter)
        Set the barycenter of the instance.
        Parameters:
        barycenter - barycenter of the instance

      • computeGeometricalProperties

        protected abstract void computeGeometricalProperties()
        Compute some geometrical properties.

        The properties to compute are the barycenter and the size.

      • intersection

        public I intersection​(I sub)
        Get the parts of a sub-hyperplane that are contained in the region.

        The parts of the sub-hyperplane that belong to the boundary are not included in the resulting parts.

        Specified by:
        intersection in interface Region<S extends Space,​P extends Point<S,​P>,​H extends Hyperplane<S,​P,​H,​I>,​I extends SubHyperplane<S,​P,​H,​I>>
        Parameters:
        sub - sub-hyperplane traversing the region
        Returns:
        filtered sub-hyperplane

      • applyTransform

        public AbstractRegion<S,​P,​H,​I,​T,​Q,​F,​J> applyTransform​(Transform<S,​P,​H,​I,​T,​Q,​F,​J> transform)
        Transform a region.

        Applying a transform to a region consist in applying the transform to all the hyperplanes of the underlying BSP tree and of the boundary (and also to the sub-hyperplanes embedded in these hyperplanes) and to the barycenter. The instance is not modified, a new instance is built.

        Parameters:
        transform - transform to apply
        Returns:
        a new region, resulting from the application of the transform to the instance