X-Git-Url: http://git.megacz.com/?a=blobdiff_plain;ds=sidebyside;f=src%2Fedu%2Fberkeley%2Fqfat%2FMesh.java;h=18a9512dbb7cdce50bd6279de889bb4a9ac44fdd;hb=2254944e7fe6d643074411a20d635815c38536dc;hp=48fb47bb8929f27dccf326e51dd38306f3c7c609;hpb=d0a170a80133a2d71ea35fd427fc7f97643564da;p=anneal.git

diff --git a/src/edu/berkeley/qfat/Mesh.java b/src/edu/berkeley/qfat/Mesh.java
index 48fb47b..18a9512 100644
--- a/src/edu/berkeley/qfat/Mesh.java
+++ b/src/edu/berkeley/qfat/Mesh.java
@@ -295,15 +295,11 @@ public class Mesh implements Iterable<Mesh.T> {
 
             good = true;
 
-            
-            E e = this.e;
-            do {
+            for(E e = this.e; e!=null; e=e.pair.next==this.e?null:e.pair.next) {
                 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 (!ignorecollision && good) triangles.range(oldp, this.p, (Visitor<T>)this);