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

diff --git a/src/edu/berkeley/qfat/Mesh.java b/src/edu/berkeley/qfat/Mesh.java
index 15cd3fc..88e6d04 100644
--- a/src/edu/berkeley/qfat/Mesh.java
+++ b/src/edu/berkeley/qfat/Mesh.java
@@ -295,12 +295,10 @@ public class Mesh implements Iterable<Mesh.T> {
 
             good = true;
 
-            for(E e = this.e; ;) {
+            for(E e = null; e!=this.e; e=e.pair.next) { if (e==null) 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;
                 e.p2.quadricStale = true;
-                e = e.pair.next;
-                if (e==this.e) break;
             }
 
             if (!ignorecollision && good) triangles.range(oldp, this.p, (Visitor<T>)this);