Revision: 73955
http://sourceforge.net/p/brlcad/code/73955
Author: starseeker
Date: 2019-09-18 15:28:15 +0000 (Wed, 18 Sep 2019)
Log Message:
-----------
Not sure RTrees are actually faster here, at least using them naively - still
liking the possibility of using them during overlap checking, so may need to
consider a fallback strategy.
Modified Paths:
--------------
brlcad/trunk/src/libbrep/cdt_mesh.h
Modified: brlcad/trunk/src/libbrep/cdt_mesh.h
===================================================================
--- brlcad/trunk/src/libbrep/cdt_mesh.h 2019-09-18 15:23:49 UTC (rev 73954)
+++ brlcad/trunk/src/libbrep/cdt_mesh.h 2019-09-18 15:28:15 UTC (rev 73955)
@@ -456,7 +456,13 @@
edges2tris.clear();
};
- /* The 3D triangle set (defined by index values) and it associated points
array */
+ /* The 3D triangle set (defined by index values) and it associated points
array.
+ *
+ * TODO - need to get perf on this - it's not trivially clear the RTree is
+ * actually faster than the set yet just adding individual triangle boxes
+ * to it - might need to nest RTrees with some upper limit on how many
+ * triangles are in each cell before subdividing, to keep each local RTree
+ * easier to handle? */
//std::set<triangle_t> tris;
std::vector<triangle_t> tris_vect;
RTree<size_t, double, 3> tris_tree;
This was sent by the SourceForge.net collaborative development platform, the
world's largest Open Source development site.
_______________________________________________
BRL-CAD Source Commits mailing list
[email protected]
https://lists.sourceforge.net/lists/listinfo/brlcad-commits
