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

diff --git a/src/edu/berkeley/qfat/Mesh.java b/src/edu/berkeley/qfat/Mesh.java
index ecc5e22..babad37 100644
--- a/src/edu/berkeley/qfat/Mesh.java
+++ b/src/edu/berkeley/qfat/Mesh.java
@@ -19,7 +19,6 @@ public class Mesh implements Iterable<Mesh.T> {
     private PointSet<Vertex> vertices  = new PointSet<Vertex>();
 
     public boolean immutableVertices;
-    public boolean ignorecollision    = false;
     public Mesh    error_against      = null;
     public double  error              = 0;
 
@@ -81,7 +80,7 @@ public class Mesh implements Iterable<Mesh.T> {
 
         Matrix binding = Matrix.ONE;
         Vertex bound_to = this;
-        private boolean good;
+        private boolean illegal = false;
 
         public Point getPoint() { return p; }
         public float error() { return olderror; }
@@ -92,6 +91,12 @@ public class Mesh implements Iterable<Mesh.T> {
             vertices.add(this);
         }
 
+        public void reinsert() {
+            vertices.remove(this);
+            vertices.add(this);
+            for(E e = this.e; e!=null; e=e.pair.next==this.e?null:e.pair.next) e.t.reinsert();
+        }
+
         public float olderror = 0;
         public void setError(float nerror) {
             error -= olderror;
@@ -99,6 +104,25 @@ public class Mesh implements Iterable<Mesh.T> {
             error += olderror;
         }
 
+        public float averageTriangleArea() {
+            int count = 0;
+            float ret = 0;
+            for(E e = this.e; e!=null; e=e.pair.next==this.e?null:e.pair.next) {
+                ret += e.t.area();
+                count++;
+            }
+            return ret/count;
+        }
+        public float averageEdgeLength() {
+            int count = 0;
+            float ret = 0;
+            for(E e = this.e; e!=null; e=e.pair.next==this.e?null:e.pair.next) {
+                ret += e.length();
+                count++;
+            }
+            return ret/count;
+        }
+
         public Matrix _recomputeFundamentalQuadric() {
             Matrix m = Matrix.ZERO;
             int count = 0;
@@ -111,19 +135,23 @@ public class Mesh implements Iterable<Mesh.T> {
 
         public HasQuadric nearest() { return error_against==null ? null : error_against.vertices.nearest(p, this); }
         public void computeError() {
+            if (error_against==null) return;
             float nerror =
                 quadric_count != 0
-                ? (quadric.preAndPostMultiply(p) * 100) / quadric_count
+                ? (quadric.preAndPostMultiply(p) * 100)/quadric_count
                 : nearest_in_other_mesh != null
-                ? nearest_in_other_mesh.fundamentalQuadric().preAndPostMultiply(p) * 100 * 10
-                : error_against != null
-                ? nearest().fundamentalQuadric().preAndPostMultiply(p) * 100 * 10
-                : 0;
+                ? nearest_in_other_mesh.fundamentalQuadric().preAndPostMultiply(p) * 100
+                : nearest().fundamentalQuadric().preAndPostMultiply(p) * 100;
             for(E e = this.e; e!=null; e=e.pair.next==this.e?null:e.pair.next) {
                 double ang = Math.abs(e.crossAngle());
                 if (ang > Math.PI) throw new Error();
                 float minangle = (float)(Math.PI * 0.8);
                 if (ang > minangle) nerror += (ang - minangle);
+                /*
+                if (e.t.aspect() < 0.2) {
+                    nerror += (0.2-e.t.aspect()) * 300;
+                }
+                */
             }
             setError(nerror);
         }
@@ -134,31 +162,25 @@ public class Mesh implements Iterable<Mesh.T> {
             if (immutableVertices) throw new Error();
 
             unApplyQuadricToNeighbor();
-
-            if (vertices.get(this.p)==null) throw new Error();
-            vertices.remove(this);
-            for(E e = this.e; e!=null; e=e.pair.next==this.e?null:e.pair.next)
-                if (e.t != null) e.t.removeFromRTree();
             this.p = newp;
-            for(E e = this.e; e!=null; e=e.pair.next==this.e?null:e.pair.next)
-                if (e.t != null) e.t.addToRTree();
-            vertices.add(this);
-
+            reinsert();
             applyQuadricToNeighbor();
 
-            good = true;
-
-            if (!ignoreProblems)
-                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;
-                    e.p2.quadricStale = true;
-                }
-
-            if (!ignorecollision && !ignoreProblems && good)
-                triangles.range(oldp, this.p, (Visitor<T>)this);
+            if (!ignoreProblems) {
+                illegal = false;
+                checkLegality();
+            }
+            for(E e = this.e; e!=null; e=e.pair.next==this.e?null:e.pair.next) e.p2.quadricStale = true;
+            return !illegal;
+        } 
 
-            return good;
+        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 (!illegal) triangles.range(oldp, this.p, (Visitor<T>)this);
         }
 
         public void reComputeErrorAround() {
@@ -173,16 +195,16 @@ public class Mesh implements Iterable<Mesh.T> {
             if (o instanceof Vertex)
                 return ((Vertex)o).e != null && ((Vertex)o).norm().dot(Vertex.this.norm()) >= 0;
             T t = (T)o;
-            if (!good) return false;
+            if (illegal) return false;
             for(E e = Vertex.this.e; e!=null; e=e.pair.next==Vertex.this.e?null:e.pair.next) {
-                if (!t.has(e.p1) && !t.has(e.p2) && e.intersects(t)) { good = false; }
+                if (!t.has(e.p1) && !t.has(e.p2) && e.intersects(t)) { illegal = true; }
                 if (e.t != null) {
-                    if (!e.t.has(t.e1().p1) && !e.t.has(t.e1().p2) && t.e1().intersects(e.t)) { good = false; }
-                    if (!e.t.has(t.e2().p1) && !e.t.has(t.e2().p2) && t.e2().intersects(e.t)) { good = false; }
-                    if (!e.t.has(t.e3().p1) && !e.t.has(t.e3().p2) && t.e3().intersects(e.t)) { good = false; }
+                    if (!e.t.has(t.e1().p1) && !e.t.has(t.e1().p2) && t.e1().intersects(e.t)) { illegal = true; }
+                    if (!e.t.has(t.e2().p1) && !e.t.has(t.e2().p2) && t.e2().intersects(e.t)) { illegal = true; }
+                    if (!e.t.has(t.e3().p1) && !e.t.has(t.e3().p2) && t.e3().intersects(e.t)) { illegal = true; }
                 }
             }
-            return good;
+            return !illegal;
         }
 
         public boolean move(Matrix m, boolean ignoreProblems) {
@@ -190,8 +212,8 @@ public class Mesh implements Iterable<Mesh.T> {
             for(Vertex p = this; p != null; p = (p.bound_to==this)?null:p.bound_to)
                 good &= p.transform(m.times(p.p), ignoreProblems);
             for(Vertex p = this; p != null; p = (p.bound_to==this)?null:p.bound_to)
-                if (good)  { p.reComputeError/*Around*/(); }
-                else       p.transform(p.oldp, true);
+                if (good || ignoreProblems)  p.reComputeErrorAround();
+                else                         p.transform(p.oldp, true);
             return good;
         }
 
@@ -307,8 +329,18 @@ public class Mesh implements Iterable<Mesh.T> {
 
         public boolean intersects(T t) { return t.intersects(p1.p, p2.p); }
         public float comparator() {
+            /*
             Vertex nearest = error_against.nearest(midpoint());
-            return (float)Math.max(length(), midpoint().distance(nearest.p));
+            //return (float)Math.max(length(), midpoint().distance(nearest.p));
+            //return length();
+            float nearest_distance = midpoint().distance(nearest.p);
+            float other_distance =
+                (p1.p.distance(error_against.nearest(p1.p).p)+
+                 p2.p.distance(error_against.nearest(p2.p).p))/2;
+            return nearest_distance/other_distance;
+            */
+            //return length();
+            return t==null?0:(1/t.aspect());
         }
         public int compareTo(E e) {
             return e.comparator() > comparator() ? 1 : -1;
@@ -508,18 +540,12 @@ public class Mesh implements Iterable<Mesh.T> {
         return ret;
     }
 
-
     /** [UNIQUE] a triangle (face) */
     public final class T extends Triangle {
         public final E e1;
         public final int color;
         public final int colorclass;
 
-        public void removeFromRTree() { triangles.remove(this); }
-        public void addToRTree() { triangles.insert(this); }
-
-        public void destroy() { triangles.remove(this); }
-
         T(E e1, int colorclass) {
             this.e1 = e1;
             E e2 = e1.next;
@@ -557,6 +583,11 @@ public class Mesh implements Iterable<Mesh.T> {
         public boolean hasE(E e) { return e1==e || e1.next==e || e1.prev==e; }
         public boolean has(Vertex v) { return v1()==v || v2()==v || v3()==v; }
 
+        public void removeFromRTree() { triangles.remove(this); }
+        public void addToRTree() { triangles.insert(this); }
+        public void destroy() { triangles.remove(this); }
+        public void reinsert() { triangles.remove(this); triangles.add(this); }
+
         public boolean shouldBeDrawn() {
             if (e1().bind_to.set.size() == 0) return false;
             if (e2().bind_to.set.size() == 0) return false;