Revision: 73853
http://sourceforge.net/p/brlcad/code/73853
Author: starseeker
Date: 2019-09-07 14:58:07 +0000 (Sat, 07 Sep 2019)
Log Message:
-----------
The two polyedges connected to any given edge will most likely have overlapping
bboxes, and that's OK - it's the non-neighbor overlaps that are the indication
that an opposite edge is too close to be reliably worked.
Modified Paths:
--------------
brlcad/trunk/src/libbrep/cdt.cpp
Modified: brlcad/trunk/src/libbrep/cdt.cpp
===================================================================
--- brlcad/trunk/src/libbrep/cdt.cpp 2019-09-07 12:07:33 UTC (rev 73852)
+++ brlcad/trunk/src/libbrep/cdt.cpp 2019-09-07 14:58:07 UTC (rev 73853)
@@ -1603,8 +1603,9 @@
//
// TODO - the below won't work in general, since without surface points
// we can't guarantee validity. Instead, check the expanded 2D RTree
bboxes
- // to see if any of them interfere with each other. If they do, keep
splitting
- // until the UV polygon curve bboxes are NOT self interfering.
+ // for overlaps from edges other than the two edges connected to the
current edge.
+ // Keep splitting any edges with such overlaps until the UV polygon
+ // curve bboxes are NOT self interfering except with their two
neighbors.
//
// Ideally we'll reuse the RTree and just Remove and Insert new nodes
as we
// refine, but we need to test Remove in the RTree.h code to make sure
it does
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
