X-Git-Url: http://git.megacz.com/?p=anneal.git;a=blobdiff_plain;f=src%2Fedu%2Fberkeley%2Fqfat%2FMesh.java;h=15cd3fc2e4accd62aac6efc0d1df814b956f3a64;hp=48fb47bb8929f27dccf326e51dd38306f3c7c609;hb=57f53f050333a8168f51b48d028a276214837a2d;hpb=d0a170a80133a2d71ea35fd427fc7f97643564da

diff --git a/src/edu/berkeley/qfat/Mesh.java b/src/edu/berkeley/qfat/Mesh.java
index 48fb47b..15cd3fc 100644
--- a/src/edu/berkeley/qfat/Mesh.java
+++ b/src/edu/berkeley/qfat/Mesh.java
@@ -295,15 +295,13 @@ public class Mesh implements Iterable<Mesh.T> {
 
             good = true;
 
-            
-            E e = this.e;
-            do {
+            for(E e = this.e; ;) {
                 if (Math.abs(e.crossAngle()) > (Math.PI * 0.9) || Math.abs(e.next.crossAngle()) > (Math.PI * 0.9)) good = false;
                 if (e.t.aspect() < 0.1) good = false;
-                // should recompute fundamental quadrics of all vertices sharing a face, but we defer...
                 e.p2.quadricStale = true;
                 e = e.pair.next;
-            } while(e != this.e);
+                if (e==this.e) break;
+            }
 
             if (!ignorecollision && good) triangles.range(oldp, this.p, (Visitor<T>)this);