X-Git-Url: http://git.megacz.com/?p=anneal.git;a=blobdiff_plain;f=src%2Fedu%2Fberkeley%2Fqfat%2FMesh.java;h=60aa9aba531a63fa35d43e29595939006140fe89;hp=c563563a906c1e87c9706793570fdfac3c1292f5;hb=2b09dab499516873839b9bdbc972c980829e9bac;hpb=366e1c99a39b4ac6e8a55828678ce0213e1badc2

diff --git a/src/edu/berkeley/qfat/Mesh.java b/src/edu/berkeley/qfat/Mesh.java
index c563563..60aa9ab 100644
--- 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;
@@ -19,14 +20,13 @@ public class Mesh implements Iterable<Mesh.T> {
     private PointSet<Vertex> vertices  = new PointSet<Vertex>();
 
     public boolean immutableVertices;
-    public boolean ignorecollision    = false;
-    public Mesh    score_against      = null;
-    public double  score              = 0;
+    public Mesh    error_against      = null;
+    public double  error              = 0;
 
     public Mesh(boolean immutableVertices) { this.immutableVertices = immutableVertices; }
 
     public void makeVerticesImmutable() { this.immutableVertices = true; }
-    public float score() { return (float)score; }
+    public float error() { return (float)error; }
 
     public int size() { return vertices.size(); }
     public Iterable<Vertex> vertices() { return vertices; }
@@ -45,12 +45,13 @@ public class Mesh implements Iterable<Mesh.T> {
             t.e2().dobind();
             t.e3().dobind();
         }
+        System.out.println("rebound!");
     }
 
     public void transform(Matrix m) {
         ArrayList<Vertex> set = new ArrayList<Vertex>();
         for(Vertex v : vertices) set.add(v);
-        for(Vertex v : set) v.transform(m);
+        for(Vertex v : set) v.transform(m.times(v.p), true);
     }
 
     public void rebuild() { /*vertices.rebuild();*/ }
@@ -76,167 +77,158 @@ public class Mesh implements Iterable<Mesh.T> {
 
     /** a vertex in the mesh */
     public final class Vertex extends HasQuadric implements Visitor {
-        public String toString() { return p.toString(); }
-        public Point p;
+        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; }
-        public float score() { return oldscore; }
+        public float error() { return olderror; }
 
         private Vertex(Point p) {
             this.p = p;
+            this.goodp = p;
             if (vertices.get(p) != null) throw new Error();
             vertices.add(this);
         }
 
-        private void glNormal(GL gl) {
-            Vec norm = norm();
-            gl.glNormal3f(norm.x, norm.y, norm.z);
+        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 void _recomputeFundamentalQuadric() {
-            Matrix m = Matrix.ZERO;
+        public float olderror = 0;
+        public void setError(float nerror) {
+            error -= olderror;
+            olderror = nerror;
+            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) {
-                T t = e.t;
-                m = m.plus(t.norm().fundamentalQuadric(t.centroid()));
+                ret += e.t.area();
                 count++;
             }
-            quadricStale = false;
-            fundamentalQuadric = m.times(1/(float)count);
+            return ret/count;
         }
-
-        public void applyQuadricToNeighbor() {
-            if (score_against == null) return;
-
-            Vertex new_nearest = (Vertex)nearest();
-            if (nearest_in_other_mesh != null && new_nearest == nearest_in_other_mesh) return;
-
-            if (nearest_in_other_mesh != null) unApplyQuadricToNeighbor();
-            if (nearest_in_other_mesh != null) throw new Error();
-
-            nearest_in_other_mesh = new_nearest;
-                
-            nearest_in_other_mesh.unComputeError();
-            nearest_in_other_mesh.quadric = nearest_in_other_mesh.quadric.plus(fundamentalQuadric());
-            nearest_in_other_mesh.quadric_count++;
-            nearest_in_other_mesh.computeError();
-
-            reComputeError();
+        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 void reComputeErrorAround() {
-            reComputeError();
-            if (nearest_in_other_mesh != null) nearest_in_other_mesh.reComputeError();
-            for(E e = this.e; e!=null; e=e.pair.next==this.e?null:e.pair.next)
-                e.p2.reComputeError();
-        }
-        public void reComputeError() {
-            unComputeError();
-            computeError();
-        }
-        public void unComputeError() {
-            score -= oldscore;
-            oldscore = 0;
+        public Matrix _recomputeFundamentalQuadric() {
+            Matrix m = Matrix.ZERO;
+            int count = 0;
+            for(E e = this.e; e!=null; e=e.pair.next==this.e?null:e.pair.next) {
+                m = m.plus(e.t.norm().fundamentalQuadric(e.t.centroid()));
+                count++;
+            }
+            return m.times(1/(float)count);
         }
-        public HasQuadric nearest() { return score_against.vertices.nearest(p, this); }
+
+        public HasQuadric nearest() { return error_against==null ? null : error_against.vertices.nearest(p, this); }
         public void computeError() {
-            oldscore =
-                quadric_count != 0
-                ? (quadric.preAndPostMultiply(p) * 100) / quadric_count
-                : immutableVertices
-                ? oldscore
-                : nearest_in_other_mesh != null
-                ? nearest_in_other_mesh.fundamentalQuadric().preAndPostMultiply(p) * 100 * 10
-                : score_against != null
-                ? nearest().fundamentalQuadric().preAndPostMultiply(p) * 100 * 10
-                : 0;
+            if (error_against==null) return;
+            float nerror =
+                nearest_in_other_mesh != null
+                ? nearest_in_other_mesh.fundamentalQuadric().preAndPostMultiply(p)
+                : nearest().fundamentalQuadric().preAndPostMultiply(p);
+            if (quadric_count != 0)
+                nerror = (nerror + quadric.preAndPostMultiply(p))/(quadric_count+1);
+
             for(E e = this.e; e!=null; e=e.pair.next==this.e?null:e.pair.next) {
-                double ang = Math.abs(e.crossAngle());
+                double ang = Math.abs(e.dihedralAngle());
                 if (ang > Math.PI) throw new Error();
                 float minangle = (float)(Math.PI * 0.8);
-                if (ang > minangle)
-                    oldscore += (ang - minangle);
+                if (ang > minangle) nerror += (ang - minangle);
+                /*
+                if (e.t.aspect() < 0.2) {
+                    nerror += (0.2-e.t.aspect()) * 10;
+                }
+                */
             }
-            score += oldscore;
-        }
 
-        private void removeTrianglesFromRTree() {
-            for(E e = this.e; e!=null; e=e.pair.next==this.e?null:e.pair.next)
-                if (e.t != null) e.t.removeFromRTree();
+            setError(nerror);
         }
-        private void addTrianglesToRTree() {
-            for(E e = this.e; e!=null; e=e.pair.next==this.e?null:e.pair.next)
-                if (e.t != null) e.t.addToRTree();
+
+        public boolean move(Matrix m, boolean ignoreProblems) {
+            boolean good = true;
+
+            //     t1' = M * t1
+            //     t2' = t2.getMatrix(t1) * t1'
+            //     t2' = t2.getMatrix(t1) * M * t1
+            //     t1 =     t1.getMatrix(t2) * t2
+            // M * t1 = M * t1.getMatrix(t2) * t2
+            for(Vertex v : (Iterable<Vertex>)getBoundPeers())
+                good &= v.transform(v.getBindingMatrix(this).times(m).times(this.p),
+                                    ignoreProblems);
+
+            for(Vertex v : (Iterable<Vertex>)getBoundPeers())
+                if (good || ignoreProblems)  v.reComputeErrorAround();
+                else                         v.transform(v.oldp, true);
+
+            return good;
         }
 
         /** does NOT update bound pairs! */
-        public boolean transform(Matrix m) {
+        private boolean transform(Point newp, boolean ignoreProblems) {
+            this.oldp = this.p;
             if (immutableVertices) throw new Error();
 
             unApplyQuadricToNeighbor();
-            Point oldp = this.p;
-
-            if (vertices.get(this.p)==null) throw new Error();
-            vertices.remove(this);
-            removeTrianglesFromRTree();
-            float newx = m.a*p.x + m.b*p.y + m.c*p.z + m.d;
-            float newy = m.e*p.x + m.f*p.y + m.g*p.z + m.h;
-            float newz = m.i*p.x + m.j*p.y + m.k*p.z + m.l;
-            this.p = new Point(newx, newy, newz);
-            addTrianglesToRTree();
-            vertices.add(this);
-
+            this.p = newp;
+            reinsert();
             applyQuadricToNeighbor();
 
-            good = true;
+            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;
+        } 
 
+        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)) good = false;
-                if (e.t.aspect() < 0.1) good = false;
-                e.p2.quadricStale = true;
+                if (Math.abs(e.dihedralAngle()) > (Math.PI * 0.9) ||
+                    Math.abs(e.next.dihedralAngle()) > (Math.PI * 0.9)) illegal = true;
+                if (e.t.aspect() < 0.1) illegal = true;
             }
+            */
+            if (!illegal) triangles.range(oldp, this.p, (Visitor<T>)this);
+        }
 
-            if (!ignorecollision && good) triangles.range(oldp, this.p, (Visitor<T>)this);
-
-            reComputeErrorAround();
-            return good;
+        public void reComputeErrorAround() {
+            reComputeError();
+            if (nearest_in_other_mesh != null)
+                nearest_in_other_mesh.reComputeError();
+            for(E e = this.e; e!=null; e=e.pair.next==this.e?null:e.pair.next)
+                e.p2.reComputeError();
         }
 
         public boolean visit(Object o) {
-            if (o instanceof T) {
-                T t = (T)o;
-                if (!good) 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 (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 (o instanceof Vertex)
+                return ((Vertex)o).e != null && ((Vertex)o).norm().dot(Vertex.this.norm()) >= 0;
+            T t = (T)o;
+            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)) { illegal = true; }
+                if (e.t != null) {
+                    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;
-            } else {
-                Vertex v = (Vertex)o;
-                if (v.e==null || v.norm().dot(Vertex.this.norm()) < 0)
-                    return false;
-                return true;
             }
-        }
-        private boolean good;
-
-        public boolean move(Vec v) {
-            Matrix m = Matrix.translate(v);
-            Vertex p = this;
-            boolean good = true;
-            do {
-                good &= p.transform(m);
-                p = p.bound_to;
-            } while (p != this);
-            return good;
+            return !illegal;
         }
 
         public E getFreeIncident() {
@@ -265,6 +257,10 @@ public class Mesh implements Iterable<Mesh.T> {
             return null;
         }
 
+        private void glNormal(GL gl) {
+            Vec norm = norm();
+            gl.glNormal3f(norm.x, norm.y, norm.z);
+        }
         public Vec norm() {
             Vec norm = new Vec(0, 0, 0);
             for(E e = this.e; e!=null; e=e.pair.next==this.e?null:e.pair.next)
@@ -273,24 +269,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,7 +288,7 @@ public class Mesh implements Iterable<Mesh.T> {
             e.bind_to    = bind_others;
             for (E epeer  : e_bind_peers.set) add(epeer);
             for (E eother : e_bind_to.set)    bind_others.add(eother);
-
+            /*
             for(E eother : bind_others.set) {
                 if (e.next.bind_to.set.contains(eother.prev)) {
                     e.next.next.bindEdge(eother.prev.prev);
@@ -318,23 +297,23 @@ public class Mesh implements Iterable<Mesh.T> {
                     e.prev.prev.bindEdge(eother.next.next);
                 }
             }
-
+            */
         }
         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) {
+        public void shatter(BindingGroup bg1, BindingGroup bg2, boolean triangles) {
             for(E e : set) {
-                e.shatter(e.midpoint(), bg1, bg2);
+                e.shatter(e.midpoint(), bg1, bg2, triangles);
             }
         }
     }
 
     /** [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"
@@ -346,18 +325,77 @@ public class Mesh implements Iterable<Mesh.T> {
         boolean shattered = false;
 
         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);
+            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;
+        }
         public float comparator() {
-            Vertex nearest = score_against.nearest(midpoint());
-            return (float)Math.max(length(), midpoint().distance(nearest.p));
+            return length();
+            //return t==null?0:(1/t.aspect());
         }
         public int compareTo(E e) {
             return e.comparator() > comparator() ? 1 : -1;
         }
-        public void bindEdge(E e) { bind_to.add(e); }
-        public void dobind() { bind_to.dobind(this); }
+        public void bindEdge(E e, Matrix m) {
+            //bind_to.add(e);
+
+            //assumes edges are identical length at binding time
+            e = e.pair;
+            Vec reflectionPlaneNormal = e.p2.p.minus(e.p1.p).norm();
+            float a = reflectionPlaneNormal.x;
+            float b = reflectionPlaneNormal.y;
+            float c = reflectionPlaneNormal.z;
+            Matrix reflectionMatrix =
+                new Matrix( 1-2*a*a,  -2*a*b,  -2*a*c, 0,
+                            -2*a*b,  1-2*b*b,  -2*b*c, 0,
+                            -2*a*c,   -2*b*c, 1-2*c*c, 0,
+                            0,       0,       0,       1);
+            /*
+            m = m.times(Matrix.translate(e.midpoint().minus(Point.ORIGIN))
+                        .times(reflectionMatrix)
+                        .times(Matrix.translate(Point.ORIGIN.minus(e.midpoint()))));
+            */
+            System.out.println(reflectionPlaneNormal);
+            System.out.println("  " + p1.p + " " + m.times(e.p1.p));
+            System.out.println("  " + p2.p + " " + m.times(e.p2.p));
+            if (m.times(e.p1.p).minus(p1.p).mag() > EPSILON) throw new Error();
+            if (m.times(e.p2.p).minus(p2.p).mag() > EPSILON) throw new Error();
+            this.bindTo(m, e);
+        }
+        
+        public void dobind() {
+            //bind_to.dobind(this);
+            for(E e : (Iterable<E>)getBoundPeers()) {
+                if (e==this) continue;
+                p1.bindTo(getBindingMatrix(e), e.p1);
+                p2.bindTo(getBindingMatrix(e), e.p2);
+            }
+        }
 
-        public Point shatter() { return shatter(midpoint(), null, null); }
-        public Point shatter(Point mid, BindingGroup bg1, BindingGroup bg2) {
+        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,15 +407,22 @@ public class Mesh implements Iterable<Mesh.T> {
             if (bg1==null) bg1 = new BindingGroup();
             if (bg2==null) bg2 = new BindingGroup();
             BindingGroup old_bind_to = bind_to;
-            bind_peers.shatter(bg1, bg2);
-            old_bind_to.shatter(bg2.other(), bg1.other());
+            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();
 
-            newT(r.p, p1.p, mid, null, old_colorclass);
-            newT(r.p, mid, p2.p, null, old_colorclass);
-            bg1.add(p1.getE(mid));
-            bg2.add(p2.getE(mid).pair);
+            if (triangles) {
+                newT(r.p, p1.p, mid, null, old_colorclass);
+                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;
         }
 
@@ -429,7 +474,7 @@ public class Mesh implements Iterable<Mesh.T> {
 
         public T makeT(int colorclass) { return t==null ? (t = new T(this, colorclass)) : t; }
 
-        public double crossAngle() {
+        public double dihedralAngle() {
             Vec v1 = t.norm().times(-1);
             Vec v2 = pair.t.norm().times(-1);
             return Math.acos(v1.norm().dot(v2.norm()));
@@ -548,18 +593,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;
@@ -597,12 +636,34 @@ 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==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;
+            */
             return true;
         }
 
+        /** issue gl.glVertex() for each of the triangle's points */
+        public void glVertices(GL gl) {
+            if (!shouldBeDrawn()) return;
+            norm().glNormal(gl);
+            Point p1 = v1().goodp;
+            Point p2 = v2().goodp;
+            Point p3 = v3().goodp;
+            p1.glVertex(gl);
+            p2.glVertex(gl);
+            p3.glVertex(gl);
+        }
+
     }
 }