checkpoint

[anneal.git] / src / edu / berkeley / qfat / Mesh.java

diff --git a/src/edu/berkeley/qfat/Mesh.java b/src/edu/berkeley/qfat/Mesh.java
index edd82d6..d5e0db2 100644 (file)
--- a/src/edu/berkeley/qfat/Mesh.java
+++ b/src/edu/berkeley/qfat/Mesh.java
@@ -6,6 +6,7 @@ import javax.swing.*;
 import javax.media.opengl.*;
 import javax.media.opengl.glu.*;
 import edu.berkeley.qfat.geom.*;
+import edu.berkeley.qfat.geom.HasBindingGroup;
 import edu.wlu.cs.levy.CG.KDTree;
 import edu.berkeley.qfat.geom.Point;
 import com.infomatiq.jsi.IntProcedure;
@@ -78,8 +79,6 @@ public class Mesh implements Iterable<Mesh.T> {
         public Point p, oldp, goodp;
         E e;                // some edge *leaving* this point
 
-        Matrix binding = Matrix.ONE;
-        Vertex bound_to = this;
         private boolean illegal = false;
 
         public Point getPoint() { return p; }
@@ -161,11 +160,14 @@ public class Mesh implements Iterable<Mesh.T> {
 
         public boolean move(Matrix m, boolean ignoreProblems) {
             boolean good = true;
-            for(Vertex p = this; p != null; p = (p.bound_to==this)?null:p.bound_to)
+
+            for(Vertex p : (Iterable<Vertex>)getBoundPeers())
                 good &= p.transform(m.times(p.p), ignoreProblems);
-            for(Vertex p = this; p != null; p = (p.bound_to==this)?null:p.bound_to)
+
+            for(Vertex p : (Iterable<Vertex>)getBoundPeers())
                 if (good || ignoreProblems)  p.reComputeErrorAround();
                 else                         p.transform(p.oldp, true);
+
             return good;
         }
 
@@ -260,24 +262,7 @@ public class Mesh implements Iterable<Mesh.T> {
             return norm.norm();
         }
 
-        public boolean isBoundTo(Vertex p) {
-            for(Vertex px = p; px!=null; px=(px.bound_to==p?null:px.bound_to))
-                if (px==this)
-                    return true;
-            return false;
-        }
-
-        public void unbind() { bound_to = this; binding = Matrix.ONE; }
-        public void bind(Vertex p) { bind(p, Matrix.ONE); }
-        public void bind(Vertex p, Matrix binding) {
-            if (isBoundTo(p)) return;
-            Vertex temp_bound_to = p.bound_to;
-            Matrix temp_binding = p.binding;
-            p.bound_to = this.bound_to;
-            p.binding = binding.times(this.binding); // FIXME: may have order wrong here
-            this.bound_to = temp_bound_to;
-            this.binding = temp_binding.times(temp_binding); // FIXME: may have order wrong here
-        }
+        public void bindTo(Vertex p) { bindTo(Matrix.ONE, p); }
     }
 
     public class BindingGroup {
@@ -309,8 +294,8 @@ public class Mesh implements Iterable<Mesh.T> {
         }
         public void dobind(E e) {
             for(E ebound : set) {
-                e.p1.bind(ebound.p2);
-                e.p2.bind(ebound.p1);
+                e.p1.bindTo(Matrix.ONE, ebound.p2);
+                e.p2.bindTo(Matrix.ONE, ebound.p1);
             }
         }
         public void shatter(BindingGroup bg1, BindingGroup bg2, boolean triangles) {
@@ -321,7 +306,7 @@ public class Mesh implements Iterable<Mesh.T> {
     }
 
     /** [UNIQUE] an edge */
-    public final class E implements Comparable<E> {
+    public final class E extends HasBindingGroup implements Comparable<E> {
 
         public final Vertex p1, p2;
         T t;     // triangle to our "left"
@@ -334,6 +319,16 @@ public class Mesh implements Iterable<Mesh.T> {
 
         public boolean intersects(T t) { return t.intersects(p1.p, p2.p); }
 
+        public void bindingGroupChanged(edu.berkeley.qfat.geom.BindingGroup newBindingGroup_) {
+            edu.berkeley.qfat.geom.BindingGroup<E> newBindingGroup = (edu.berkeley.qfat.geom.BindingGroup<E>)newBindingGroup_;
+            if (newBindingGroup==null) return;
+            if (this==newBindingGroup.getMaster()) return;
+            for(E eother : (Iterable<E>)newBindingGroup) {
+                this.next.bindTo(newBindingGroup.getMatrix(eother), eother.next);
+                this.prev.bindTo(newBindingGroup.getMatrix(eother), eother.prev);
+            }
+        }
+
         public float stretchRatio() {
             Vertex nearest = error_against.nearest(midpoint());
             float nearest_distance = midpoint().distance(nearest.p);
@@ -343,8 +338,6 @@ public class Mesh implements Iterable<Mesh.T> {
             return nearest_distance/other_distance;
         }
         public float comparator() {
-            
-
             return length();
             //return t==null?0:(1/t.aspect());
         }
@@ -354,8 +347,12 @@ public class Mesh implements Iterable<Mesh.T> {
         public void bindEdge(E e) { bind_to.add(e); }
         public void dobind() { bind_to.dobind(this); }
 
-        public Point shatter() { return shatter(midpoint(), null, null, true); }
+        public Point shatter() { return shatter(true); }
+        public Point shatter(boolean triangles) { return shatter(midpoint(), null, null, triangles); }
         public Point shatter(Point mid, BindingGroup bg1, BindingGroup bg2, boolean triangles) {
+            return shatter(mid, bg1, bg2, triangles, false);
+        }
+        public Point shatter(Point mid, BindingGroup bg1, BindingGroup bg2, boolean triangles, boolean leader) {
             if (shattered || destroyed) return mid;
             shattered = true;
 
@@ -369,6 +366,10 @@ public class Mesh implements Iterable<Mesh.T> {
             BindingGroup old_bind_to = bind_to;
             bind_peers.shatter(bg1, bg2, triangles);
             old_bind_to.shatter(bg2.other(), bg1.other(), triangles);
+            if (!triangles) {
+                next.shatter(false);
+                prev.shatter(false);
+            }
             pair.shatter();
             destroy();
 
@@ -377,6 +378,7 @@ public class Mesh implements Iterable<Mesh.T> {
                 newT(r.p, mid, p2.p, null, old_colorclass);
                 bg1.add(p1.getE(mid));
                 bg2.add(p2.getE(mid).pair);
+                if (leader) p1.getE(mid).shatter();
             }
             return mid;
         }
@@ -597,6 +599,9 @@ public class Mesh implements Iterable<Mesh.T> {
         public void reinsert() { triangles.remove(this); triangles.add(this); }
 
         public boolean shouldBeDrawn() {
+            if (e1().bind_to==null) return false;
+            if (e2().bind_to==null) return false;
+            if (e3().bind_to==null) return false;
             if (e1().bind_to.set.size() == 0) return false;
             if (e2().bind_to.set.size() == 0) return false;
             if (e3().bind_to.set.size() == 0) return false;