Revision: 73922
          http://sourceforge.net/p/brlcad/code/73922
Author:   starseeker
Date:     2019-09-12 23:21:09 +0000 (Thu, 12 Sep 2019)
Log Message:
-----------
For the first time, all valid NIST examples ran through a CDT cycle without 
reporting invalidities in output.  Very slow, and not as sparse in the triangle 
count department as might be wished, but still a significant marker.

Modified Paths:
--------------
    brlcad/trunk/src/libbrep/cdt_surf.cpp

Modified: brlcad/trunk/src/libbrep/cdt_surf.cpp
===================================================================
--- brlcad/trunk/src/libbrep/cdt_surf.cpp       2019-09-12 23:11:51 UTC (rev 
73921)
+++ brlcad/trunk/src/libbrep/cdt_surf.cpp       2019-09-12 23:21:09 UTC (rev 
73922)
@@ -106,18 +106,18 @@
     ON_2dPoint p2dmax(umax, vmax);
     ON_Line line(p2dmin, p2dmax);
     ON_BoundingBox bb = line.BoundingBox();
-    fastf_t pt[4][3];                  
-    VSET(pt[0], bb.Max().x, bb.Min().y, 0);    
-    VSET(pt[1], bb.Max().x, bb.Max().y, 0);    
-    VSET(pt[2], bb.Min().x, bb.Max().y, 0);    
-    VSET(pt[3], bb.Min().x, bb.Min().y, 0);    
-    pdv_3move(plot_file, pt[0]); 
-    pdv_3cont(plot_file, pt[1]); 
-    pdv_3cont(plot_file, pt[2]); 
-    pdv_3cont(plot_file, pt[3]); 
-    pdv_3cont(plot_file, pt[0]); 
+    fastf_t pt[4][3];
+    VSET(pt[0], bb.Max().x, bb.Min().y, 0);
+    VSET(pt[1], bb.Max().x, bb.Max().y, 0);
+    VSET(pt[2], bb.Min().x, bb.Max().y, 0);
+    VSET(pt[3], bb.Min().x, bb.Min().y, 0);
+    pdv_3move(plot_file, pt[0]);
+    pdv_3cont(plot_file, pt[1]);
+    pdv_3cont(plot_file, pt[2]);
+    pdv_3cont(plot_file, pt[3]);
+    pdv_3cont(plot_file, pt[0]);
 
-    fclose(plot_file); 
+    fclose(plot_file);
 }
 
 static double

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

Reply via email to