X-Git-Url: http://git.megacz.com/?p=anneal.git;a=blobdiff_plain;f=src%2Fedu%2Fberkeley%2Fqfat%2FMesh.java;h=a2e175ba68b89eb767c566b1abaf93dd2a79d439;hp=babad37acb604937337d81c0d48a01ba3bd6a367;hb=fbca4976519ff24520c6a1a6f4ded57694964732;hpb=0525dcc815af1e875699147e9f203969eeae723d

diff --git a/src/edu/berkeley/qfat/Mesh.java b/src/edu/berkeley/qfat/Mesh.java
index babad37..a2e175b 100644
--- a/src/edu/berkeley/qfat/Mesh.java
+++ b/src/edu/berkeley/qfat/Mesh.java
@@ -175,11 +175,13 @@ public class Mesh implements Iterable<Mesh.T> {
         } 
 
         public void checkLegality() {
+            /*
             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)) illegal = true;
-                //if (e.t.aspect() < 0.1) illegal = true;
+                if (e.t.aspect() < 0.1) illegal = true;
             }
+            */
             if (!illegal) triangles.range(oldp, this.p, (Visitor<T>)this);
         }
 
@@ -339,8 +341,8 @@ public class Mesh implements Iterable<Mesh.T> {
                  p2.p.distance(error_against.nearest(p2.p).p))/2;
             return nearest_distance/other_distance;
             */
-            //return length();
-            return t==null?0:(1/t.aspect());
+            return length();
+            //return t==null?0:(1/t.aspect());
         }
         public int compareTo(E e) {
             return e.comparator() > comparator() ? 1 : -1;