S - Type of the space.public interface BSPTreeVisitor<S extends Space>
BSP tree nodes.
 Navigation through BSP trees can be done using
 two different point of views:
BSPTree.getPlus(), BSPTree.getMinus() and BSPTree.getParent() methods. Terminal nodes without associated
     sub-hyperplanes can be visited this way,
     there is no constraint in the visit order, and it is possible
     to visit either all nodes or only a subset of the nodes
   BSPTree, 
SubHyperplane| Modifier and Type | Interface and Description | 
|---|---|
| static class  | BSPTreeVisitor.OrderEnumerate for visit order with respect to plus sub-tree, minus sub-tree and cut sub-hyperplane. | 
| Modifier and Type | Method and Description | 
|---|---|
| void | visitInternalNode(BSPTree<S> node)Visit a BSP tree node node having a non-null sub-hyperplane. | 
| void | visitLeafNode(BSPTree<S> node)Visit a leaf BSP tree node node having a null sub-hyperplane. | 
| BSPTreeVisitor.Order | visitOrder(BSPTree<S> node)Determine the visit order for this node. | 
BSPTreeVisitor.Order visitOrder(BSPTree<S> node)
Before attempting to visit an internal node, this method is
 called to determine the desired ordering of the visit. It is
 guaranteed that this method will be called before visitInternalNode for a given node, it will be
 called exactly once for each internal node.
node - BSP node guaranteed to have a non null cut sub-hyperplaneBSPTreeVisitor.Order.PLUS_MINUS_SUB, BSPTreeVisitor.Order.PLUS_SUB_MINUS,
 BSPTreeVisitor.Order.MINUS_PLUS_SUB, BSPTreeVisitor.Order.MINUS_SUB_PLUS,
 BSPTreeVisitor.Order.SUB_PLUS_MINUS, BSPTreeVisitor.Order.SUB_MINUS_PLUSvoid visitInternalNode(BSPTree<S> node)
It is guaranteed that this method will be called after visitOrder has been called for a given node,
 it wil be called exactly once for each internal node.
node - BSP node guaranteed to have a non null cut sub-hyperplanevisitLeafNode(org.apache.commons.math3.geometry.partitioning.BSPTree<S>)void visitLeafNode(BSPTree<S> node)
node - leaf BSP node having a null sub-hyperplanevisitInternalNode(org.apache.commons.math3.geometry.partitioning.BSPTree<S>)Copyright © 2003–2016 The Apache Software Foundation. All rights reserved.