| /dports/math/apache-commons-math/commons-math3-3.6.1-src/src/main/java/org/apache/commons/math3/geometry/partitioning/ |
| H A D | RegionFactory.java | 175 private BSPTree<S> recurseComplement(final BSPTree<S> node) { in recurseComplement()
178 final Map<BSPTree<S>, BSPTree<S>> map = new HashMap<BSPTree<S>, BSPTree<S>>(); in recurseComplement()
182 for (final Map.Entry<BSPTree<S>, BSPTree<S>> entry : map.entrySet()) { in recurseComplement()
205 private BSPTree<S> recurseComplement(final BSPTree<S> node, in recurseComplement()
206 final Map<BSPTree<S>, BSPTree<S>> map) { in recurseComplement()
238 public BSPTree<S> merge(final BSPTree<S> leaf, final BSPTree<S> tree, in merge()
255 public BSPTree<S> merge(final BSPTree<S> leaf, final BSPTree<S> tree, in merge()
272 public BSPTree<S> merge(final BSPTree<S> leaf, final BSPTree<S> tree, in merge()
304 public BSPTree<S> merge(final BSPTree<S> leaf, final BSPTree<S> tree, in merge()
322 public BSPTree<S> fixNode(final BSPTree<S> node) { in fixNode()
[all …]
|
| H A D | BSPTree.java | 74 private BSPTree<S> plus;
77 private BSPTree<S> minus;
87 public BSPTree() { in BSPTree() method in BSPTree
119 public BSPTree(final SubHyperplane<S> cut, final BSPTree<S> plus, final BSPTree<S> minus, in BSPTree() method in BSPTree
359 final List<BSPTree<S>> close = new ArrayList<BSPTree<S>>(); in getCloseCuts()
426 public BSPTree<S> merge(final BSPTree<S> tree, final LeafMerger<S> leafMerger) { in merge()
445 private BSPTree<S> merge(final BSPTree<S> tree, final LeafMerger<S> leafMerger, in merge()
525 BSPTree<S> merge(BSPTree<S> leaf, BSPTree<S> tree, BSPTree<S> parentTree, in merge()
548 BSPTree<S> fixNode(BSPTree<S> node); in fixNode()
651 public BSPTree<S> fixNode(BSPTree<S> node) { in insertInTree()
[all …]
|
| H A D | AbstractRegion.java | 41 private BSPTree<S> tree;
105 tree = new BSPTree<S>(Boolean.TRUE); in AbstractRegion()
123 tree = new BSPTree<S>(); in AbstractRegion()
160 tree = new BSPTree<S>(Boolean.FALSE); in AbstractRegion()
167 BSPTree<S> node = tree; in AbstractRegion()
276 public boolean isFull(final BSPTree<S> node) { in isFull()
480 final Map<BSPTree<S>, BSPTree<S>> map = new HashMap<BSPTree<S>, BSPTree<S>>(); in applyTransform()
484 for (final Map.Entry<BSPTree<S>, BSPTree<S>> entry : map.entrySet()) { in applyTransform()
509 private BSPTree<S> recurseTransform(final BSPTree<S> node, final Transform<S, T> transform, in recurseTransform()
510 final Map<BSPTree<S>, BSPTree<S>> map) { in recurseTransform()
[all …]
|
| H A D | AbstractSubHyperplane.java | 115 final Map<BSPTree<T>, BSPTree<T>> map = new HashMap<BSPTree<T>, BSPTree<T>>(); in applyTransform()
116 final BSPTree<T> tTree = in applyTransform()
120 for (final Map.Entry<BSPTree<T>, BSPTree<T>> entry : map.entrySet()) { in applyTransform()
127 for (final BSPTree<T> splitter : original.getSplitters()) { in applyTransform()
145 private BSPTree<T> recurseTransform(final BSPTree<T> node, in recurseTransform()
148 final Map<BSPTree<T>, BSPTree<T>> map) { in recurseTransform()
150 final BSPTree<T> transformedNode; in recurseTransform()
152 transformedNode = new BSPTree<T>(node.getAttribute()); in recurseTransform()
166 … transformedNode = new BSPTree<T>(transform.apply(node.getCut(), hyperplane, transformed), in recurseTransform()
|
| H A D | NodesSet.java | 30 public class NodesSet<S extends Space> implements Iterable<BSPTree<S>> {
33 private List<BSPTree<S>> list;
38 list = new ArrayList<BSPTree<S>>(); in NodesSet()
44 public void add(final BSPTree<S> node) { in add()
46 for (final BSPTree<S> existing : list) { in add()
61 public void addAll(final Iterable<BSPTree<S>> iterator) { in addAll()
62 for (final BSPTree<S> node : iterator) { in addAll()
68 public Iterator<BSPTree<S>> iterator() { in iterator()
|
| /dports/math/apache-commons-math/commons-math3-3.6.1-src/src/main/java/org/apache/commons/math3/geometry/euclidean/oned/ |
| H A D | IntervalsSet.java | 197 return new BSPTree<Euclidean1D>(lowerCut, in buildTree()
344 private BSPTree<Euclidean1D> getFirstLeaf(final BSPTree<Euclidean1D> root) { in getFirstLeaf()
351 BSPTree<Euclidean1D> smallest = null; in getFirstLeaf()
433 private BSPTree<Euclidean1D> nextInternalNode(BSPTree<Euclidean1D> node) { in nextInternalNode()
453 private BSPTree<Euclidean1D> previousInternalNode(BSPTree<Euclidean1D> node) { in previousInternalNode()
472 private BSPTree<Euclidean1D> leafBefore(BSPTree<Euclidean1D> node) { in leafBefore()
487 private BSPTree<Euclidean1D> leafAfter(BSPTree<Euclidean1D> node) { in leafAfter()
528 private BSPTree<Euclidean1D> childBefore(BSPTree<Euclidean1D> node) { in childBefore()
542 private BSPTree<Euclidean1D> childAfter(BSPTree<Euclidean1D> node) { in childAfter()
585 private BSPTree<Euclidean1D> current;
[all …]
|
| /dports/math/apache-commons-math/commons-math3-3.6.1-src/src/main/java/org/apache/commons/math3/geometry/spherical/oned/ |
| H A D | ArcsSet.java | 201 private BSPTree<Sphere1D> getFirstLeaf(final BSPTree<Sphere1D> root) { in getFirstLeaf()
208 BSPTree<Sphere1D> smallest = null; in getFirstLeaf()
221 private BSPTree<Sphere1D> getLastLeaf(final BSPTree<Sphere1D> root) { in getLastLeaf()
228 BSPTree<Sphere1D> largest = null; in getLastLeaf()
310 private BSPTree<Sphere1D> nextInternalNode(BSPTree<Sphere1D> node) { in nextInternalNode()
330 private BSPTree<Sphere1D> previousInternalNode(BSPTree<Sphere1D> node) { in previousInternalNode()
349 private BSPTree<Sphere1D> leafBefore(BSPTree<Sphere1D> node) { in leafBefore()
364 private BSPTree<Sphere1D> leafAfter(BSPTree<Sphere1D> node) { in leafAfter()
405 private BSPTree<Sphere1D> childBefore(BSPTree<Sphere1D> node) { in childBefore()
419 private BSPTree<Sphere1D> childAfter(BSPTree<Sphere1D> node) { in childAfter()
[all …]
|
| /dports/graphics/geomview/geomview-1.9.5/src/lib/gprim/geom/ |
| H A D | bsptree.h | 25 typedef struct BSPTree BSPTree; typedef
27 extern BSPTree *BSPTreeCreate(BSPTree *tree, Geom *object);
28 extern void BSPTreeAddObject(BSPTree *bsp_tree, Geom *object);
29 extern void BSPTreeFinalize(BSPTree *bsp);
30 extern void BSPTreeFree(BSPTree *bsp);
31 extern void BSPTreeFreeTree(const BSPTree *tree);
33 extern BSPTree *BSPTreeSet(BSPTree *tree, int attr1, ...);
39 extern void BSPTreeInvalidate(Handle **chp, Ref *unused, BSPTree *tree);
|
| H A D | bsptreeP.h | 55 struct BSPTree { struct
109 static inline void BSPTreeSetId(BSPTree *tree) in BSPTreeSetId()
130 static inline const void **BSPTreePushAppearance(BSPTree *bsptree, Geom *geom) in BSPTreePushAppearance()
140 BSPTreePopAppearance(BSPTree *bsptree, const void **old_tagged_app) in BSPTreePopAppearance()
147 static inline TransformPtr BSPTreePushTransform(BSPTree *tree, TransformPtr T) in BSPTreePushTransform()
163 static inline void BSPTreeSetTransform(BSPTree *tree, TransformPtr T) in BSPTreeSetTransform()
173 static inline void BSPTreePopTransform(BSPTree *tree, TransformPtr old_T) in BSPTreePopTransform()
183 static inline TransformPtr BSPTreePushTxTransform(BSPTree *tree, TransformPtr T) in BSPTreePushTxTransform()
196 static inline void BSPTreeSetTxTransform(BSPTree *tree, TransformPtr T) in BSPTreeSetTxTransform()
203 static inline void BSPTreePopTxTransform(BSPTree *tree, TransformPtr old_T) in BSPTreePopTxTransform()
|
| /dports/math/apache-commons-math/commons-math3-3.6.1-src/src/test/java/org/apache/commons/math3/geometry/euclidean/twod/ |
| H A D | PolygonsSetTest.java | 673 BSPTree<Euclidean2D> tree = new BSPTree<Euclidean2D>(Boolean.TRUE); in testChoppedHexagon()
723 BSPTree<Euclidean2D> a0 = in testBug20040520()
729 BSPTree<Euclidean2D> a1 = in testBug20040520()
733 BSPTree<Euclidean2D> a2 = in testBug20040520()
737 BSPTree<Euclidean2D> a3 = in testBug20040520()
743 BSPTree<Euclidean2D> a4 = in testBug20040520()
748 BSPTree<Euclidean2D> a5 = in testBug20040520()
754 BSPTree<Euclidean2D> a6 = in testBug20040520()
759 BSPTree<Euclidean2D> a7 = in testBug20040520()
764 BSPTree<Euclidean2D> a8 = in testBug20040520()
[all …]
|
| /dports/math/moab/fathomteam-moab-7bde9dfb84a8/test/ |
| H A D | bsp_tree_test.cpp | 80 BSPTree::Plane p; in test_set_plane()
108 BSPTree::Plane p; in test_iterator()
277 BSPTree::Plane p; in test_box_iterator()
385 BSPTree::Plane p; in test_tree_create()
480 BSPTree::Plane p; in test_box_tree_create()
809 BSPTree::Plane p; in test_leaf_containing_point_bounded_tree()
956 BSPTree::Plane p; in test_leaf_containing_point_unbounded_tree()
1062 BSPTree::Plane p; in test_merge_leaf()
1164 BSPTree::Plane p; in test_box_iter_neighbors()
1820 BSPTree::Plane Y3( BSPTree::Y, 3.0 ); in test_leaf_intersects_ray_common()
[all …]
|
| /dports/www/firefox-esr/firefox-91.8.0/gfx/tests/gtest/ |
| H A D | TestBSPTree.cpp | 29 const BSPTree tree(layers); in RunTest()
41 TEST(BSPTree, SameNode) in TEST() argument
54 TEST(BSPTree, OneChild) in TEST() argument
68 TEST(BSPTree, SharedEdge1) in TEST() argument
81 TEST(BSPTree, SharedEdge2) in TEST() argument
94 TEST(BSPTree, SplitSharedEdge) in TEST() argument
118 TEST(BSPTree, SplitSimple1) in TEST() argument
140 TEST(BSPTree, SplitSimple2) in TEST() argument
168 TEST(BSPTree, NoSplit1) in TEST() argument
200 TEST(BSPTree, NoSplit2) in TEST() argument
[all …]
|
| /dports/lang/spidermonkey78/firefox-78.9.0/gfx/tests/gtest/ |
| H A D | TestBSPTree.cpp | 29 const BSPTree tree(layers); in RunTest()
41 TEST(BSPTree, SameNode) in TEST() argument
54 TEST(BSPTree, OneChild) in TEST() argument
68 TEST(BSPTree, SharedEdge1) in TEST() argument
81 TEST(BSPTree, SharedEdge2) in TEST() argument
94 TEST(BSPTree, SplitSharedEdge) in TEST() argument
118 TEST(BSPTree, SplitSimple1) in TEST() argument
140 TEST(BSPTree, SplitSimple2) in TEST() argument
168 TEST(BSPTree, NoSplit1) in TEST() argument
200 TEST(BSPTree, NoSplit2) in TEST() argument
[all …]
|
| /dports/www/firefox/firefox-99.0/gfx/tests/gtest/ |
| H A D | TestBSPTree.cpp | 29 const BSPTree tree(layers); in RunTest()
41 TEST(BSPTree, SameNode) in TEST() argument
54 TEST(BSPTree, OneChild) in TEST() argument
68 TEST(BSPTree, SharedEdge1) in TEST() argument
81 TEST(BSPTree, SharedEdge2) in TEST() argument
94 TEST(BSPTree, SplitSharedEdge) in TEST() argument
118 TEST(BSPTree, SplitSimple1) in TEST() argument
140 TEST(BSPTree, SplitSimple2) in TEST() argument
168 TEST(BSPTree, NoSplit1) in TEST() argument
200 TEST(BSPTree, NoSplit2) in TEST() argument
[all …]
|
| /dports/mail/thunderbird/thunderbird-91.8.0/gfx/tests/gtest/ |
| H A D | TestBSPTree.cpp | 29 const BSPTree tree(layers); in RunTest()
41 TEST(BSPTree, SameNode) in TEST() argument
54 TEST(BSPTree, OneChild) in TEST() argument
68 TEST(BSPTree, SharedEdge1) in TEST() argument
81 TEST(BSPTree, SharedEdge2) in TEST() argument
94 TEST(BSPTree, SplitSharedEdge) in TEST() argument
118 TEST(BSPTree, SplitSimple1) in TEST() argument
140 TEST(BSPTree, SplitSimple2) in TEST() argument
168 TEST(BSPTree, NoSplit1) in TEST() argument
200 TEST(BSPTree, NoSplit2) in TEST() argument
[all …]
|
| /dports/www/firefox-legacy/firefox-52.8.0esr/gfx/tests/gtest/ |
| H A D | TestBSPTree.cpp | 27 const BSPTree tree(layers);
40 TEST(BSPTree, SameNode)
60 TEST(BSPTree, OneChild)
80 TEST(BSPTree, SharedEdge1)
99 TEST(BSPTree, SharedEdge2)
118 TEST(BSPTree, SplitSharedEdge)
158 TEST(BSPTree, SplitSimple1)
193 TEST(BSPTree, SplitSimple2) {
232 TEST(BSPTree, NoSplit1) {
277 TEST(BSPTree, NoSplit2) {
[all …]
|
| /dports/lang/spidermonkey60/firefox-60.9.0/gfx/tests/gtest/ |
| H A D | TestBSPTree.cpp | 29 const BSPTree tree(layers); in RunTest()
41 TEST(BSPTree, SameNode) { in TEST() argument
53 TEST(BSPTree, OneChild) { in TEST() argument
66 TEST(BSPTree, SharedEdge1) { in TEST() argument
78 TEST(BSPTree, SharedEdge2) { in TEST() argument
90 TEST(BSPTree, SplitSharedEdge) { in TEST() argument
113 TEST(BSPTree, SplitSimple1) { in TEST() argument
134 TEST(BSPTree, SplitSimple2) { in TEST() argument
161 TEST(BSPTree, NoSplit1) { in TEST() argument
192 TEST(BSPTree, NoSplit2) { in TEST() argument
[all …]
|
| /dports/math/apache-commons-math/commons-math3-3.6.1-src/src/main/java/org/apache/commons/math3/geometry/spherical/twod/ |
| H A D | EdgesBuilder.java | 27 import org.apache.commons.math3.geometry.partitioning.BSPTree;
40 private final BSPTree<Sphere2D> root;
46 private final Map<Edge, BSPTree<Sphere2D>> edgeToNode;
49 private final Map<BSPTree<Sphere2D>, List<Edge>> nodeToEdgesList;
55 EdgesBuilder(final BSPTree<Sphere2D> root, final double tolerance) { in EdgesBuilder()
58 this.edgeToNode = new IdentityHashMap<Edge, BSPTree<Sphere2D>>(); in EdgesBuilder()
63 public Order visitOrder(final BSPTree<Sphere2D> node) { in visitOrder()
68 public void visitInternalNode(final BSPTree<Sphere2D> node) { in visitInternalNode()
81 public void visitLeafNode(final BSPTree<Sphere2D> node) { in visitLeafNode()
90 final BSPTree<Sphere2D> node) { in addContribution()
[all …]
|
| /dports/math/apache-commons-math/commons-math3-3.6.1-src/src/main/java/org/apache/commons/math3/geometry/euclidean/twod/ |
| H A D | PolygonsSet.java | 306 final BSPTree<Euclidean2D> tree = new BSPTree<Euclidean2D>(); in verticesToTree()
524 private BSPTree<Euclidean2D> node;
576 public BSPTree<Euclidean2D> getNode() { in getNode()
949 private final BSPTree<Euclidean2D> node;
952 private final BSPTree<Euclidean2D> startNode;
955 private final BSPTree<Euclidean2D> endNode;
990 public BSPTree<Euclidean2D> getNode() { in getNode()
997 public BSPTree<Euclidean2D> getStartNode() { in getStartNode()
1004 public BSPTree<Euclidean2D> getEndNode() { in getEndNode()
1134 …private BSPTree<Euclidean2D> selectClosest(final Vector2D point, final Iterable<BSPTree<Euclidean2… in selectClosest()
[all …]
|
| /dports/math/moab/fathomteam-moab-7bde9dfb84a8/src/moab/ |
| H A D | BSPTree.hpp | 41 class BSPTree class
56 BSPTree( Interface* iface,
60 BSPTree( Interface* iface,
65 ~BSPTree();
241 friend class BSPTree;
243 BSPTree* treeTool;
254 virtual ErrorCode initialize( BSPTree* tool,
264 BSPTree* tool() const in tool()
355 virtual ErrorCode initialize( BSPTree* tool,
411 XSect splits( const BSPTree::Plane& plane ) const;
[all …]
|
| /dports/math/moab/fathomteam-moab-7bde9dfb84a8/src/ |
| H A D | BSPTree.cpp | 118 BSPTree::BSPTree( Interface* mb, in BSPTree() function in moab::BSPTree
124 BSPTree::BSPTree( Interface* mb, in BSPTree() function in moab::BSPTree
131 BSPTree::~BSPTree() in ~BSPTree()
575 BSPTree::Plane plane; in calculate_polyhedron()
841 BSPTree::Plane plane; in step_to_first_leaf()
878 BSPTree::Plane plane; in up()
924 BSPTree::Plane plane; in step()
1096 BSPTree::Plane plane; in sibling_side()
1111 BSPTree::Plane plane; in get_neighbors()
1366 BSPTree* toolPtr;
[all …]
|
| /dports/math/apache-commons-math/commons-math3-3.6.1-src/src/main/java/org/apache/commons/math3/geometry/euclidean/threed/ |
| H A D | SubPlane.java | 26 import org.apache.commons.math3.geometry.partitioning.BSPTree;
92 final BSPTree<Euclidean2D> splitTree = getRemainingRegion().getTree(false).split(l2DMinus); in split()
93 final BSPTree<Euclidean2D> plusTree = getRemainingRegion().isEmpty(splitTree.getPlus()) ? in split()
94 new BSPTree<Euclidean2D>(Boolean.FALSE) : in split()
95 … new BSPTree<Euclidean2D>(l2DPlus, new BSPTree<Euclidean2D>(Boolean.FALSE), in split()
98 final BSPTree<Euclidean2D> minusTree = getRemainingRegion().isEmpty(splitTree.getMinus()) ? in split()
99 new BSPTree<Euclidean2D>(Boolean.FALSE) : in split()
100 … new BSPTree<Euclidean2D>(l2DMinus, new BSPTree<Euclidean2D>(Boolean.FALSE), in split()
|
| /dports/math/vtk8/VTK-8.2.0/Filters/FlowPaths/ |
| H A D | vtkCachingInterpolatedVelocityField.cxx | 40 this->BSPTree = nullptr; in IVFDataSetInfo()
54 this->BSPTree = locator; in SetDataSet()
58 if (!this->BSPTree) in SetDataSet()
60 this->BSPTree = vtkSmartPointer<vtkCellLocator>::New(); in SetDataSet()
62 this->BSPTree->SetLazyEvaluation(1); in SetDataSet()
63 this->BSPTree->SetDataSet(this->DataSet); in SetDataSet()
91 this->BSPTree = ivfci.BSPTree; in IVFDataSetInfo()
105 this->BSPTree = ivfci.BSPTree; in operator =()
286 if (data->BSPTree && !data->BSPTree->InsideCellBounds(x, this->LastCellId)) in FunctionValues()
300 if (data->BSPTree) in FunctionValues()
[all …]
|
| /dports/math/vtk9/VTK-9.1.0/Filters/FlowPaths/ |
| H A D | vtkCachingInterpolatedVelocityField.cxx | 40 this->BSPTree = nullptr; in IVFDataSetInfo()
55 this->BSPTree = locator; in SetDataSet()
59 if (!this->BSPTree) in SetDataSet()
61 this->BSPTree = vtkSmartPointer<vtkCellLocator>::New(); in SetDataSet()
63 this->BSPTree->SetLazyEvaluation(1); in SetDataSet()
64 this->BSPTree->SetDataSet(this->DataSet); in SetDataSet()
65 this->BSPTree->SetUseExistingSearchStructure(this->StaticDataSet); in SetDataSet()
91 this->BSPTree = ivfci.BSPTree; in IVFDataSetInfo()
110 this->BSPTree = ivfci.BSPTree; in operator =()
290 if (data->BSPTree && !data->BSPTree->InsideCellBounds(x, this->LastCellId)) in FunctionValues()
[all …]
|
| /dports/math/vtk6/VTK-6.2.0/Filters/FlowPaths/ |
| H A D | vtkCachingInterpolatedVelocityField.cxx | 48 this->BSPTree = NULL; in IVFDataSetInfo()
61 this->BSPTree = locator; in SetDataSet()
64 if (!this->BSPTree) { in SetDataSet()
65 this->BSPTree = vtkSmartPointer<Custom_TreeType>::New(); in SetDataSet()
67 this->BSPTree->SetLazyEvaluation(1); in SetDataSet()
68 this->BSPTree->SetDataSet(this->DataSet); in SetDataSet()
92 this->BSPTree = ivfci.BSPTree; in IVFDataSetInfo()
103 this->BSPTree = ivfci.BSPTree; in operator =()
268 if (data->BSPTree && !data->BSPTree->InsideCellBounds(x, this->LastCellId)) { in FunctionValues()
281 if (data->BSPTree) in FunctionValues()
[all …]
|