1 package edu.berkeley.qfat;
4 import java.awt.event.*;
6 import javax.media.opengl.*;
7 import javax.media.opengl.glu.*;
8 import edu.berkeley.qfat.geom.*;
9 import edu.wlu.cs.levy.CG.KDTree;
10 import edu.berkeley.qfat.geom.Point;
12 public class Mesh implements Iterable<Mesh.T> {
14 public static final float EPSILON = (float)0.0001;
15 public static final Random random = new Random();
17 private PointSet<Vert> pointset = new PointSet<Vert>();
19 public Iterable<Vert> vertices() { return pointset; }
21 public Iterable<E> edges() {
24 public Iterator<E> iterator() {
26 HashSet<E> hse = new HashSet<E>();
27 for(T t : Mesh.this) {
35 return hse.iterator();
39 public Iterator<T> iterator() {
40 for(Vert v : pointset)
41 if (v.e != null && v.e.t != null)
42 return new FaceIterator(v);
43 return new FaceIterator();
46 public Mesh score_against = null;
47 public double score = 0;
48 public float score() { return (float)score; }
50 public int numedges = 0;
51 public float avgedge = 0;
53 public void rebindPoints() {
55 for(Mesh.T t : this) {
60 // ask edges to re-implement their bindings
61 for(Mesh.T t : this) {
68 public void unApplyQuadricToNeighborAll() {
69 HashSet<Vert> done = new HashSet<Vert>();
71 for(Vert p : new Vert[] { t.v1(), t.v2(), t.v3() }) {
72 if (done.contains(p)) continue;
74 p.unApplyQuadricToNeighbor();
77 public void recomputeAllFundamentalQuadrics() {
78 HashSet<Vert> done = new HashSet<Vert>();
80 for(Vert p : new Vert[] { t.v1(), t.v2(), t.v3() }) {
81 if (done.contains(p)) continue;
83 p.recomputeFundamentalQuadric();
86 public float applyQuadricToNeighborAll() {
89 HashSet<Vert> done = new HashSet<Vert>();
91 for(Vert p : new Vert[] { t.v1(), t.v2(), t.v3() }) {
92 if (done.contains(p)) continue;
94 p.applyQuadricToNeighbor();
97 return (float)(dist/num);
100 public void transform(Matrix m) {
101 ArrayList<Vert> set = new ArrayList<Vert>();
102 for (Vert v : pointset)
104 for(Vert v : set) v.transform(m);
107 public float volume() {
110 double area = t.area();
111 Vec origin_to_centroid = new Vec(new Point(0, 0, 0), t.centroid());
112 boolean facingAway = t.norm().dot(origin_to_centroid) > 0;
113 double height = Math.abs(t.norm().dot(origin_to_centroid));
114 total += ((facingAway ? 1 : -1) * area * height) / 3.0;
119 public void rebuildPointSet() { pointset.rebuild(); }
120 public Vec diagonal() { return pointset.diagonal(); }
121 public Point centroid() { return pointset.centroid(); }
122 public Vert nearest(Point p) { return pointset.nearest(p); }
124 public final class Vert extends HasPoint {
126 E e; // some edge *leaving* this point
128 /** the nearest vertex in the "score_against" mesh */
129 Vert nearest_in_other_mesh;
130 /** the number of vertices in the other mesh for which this is the nearest_in_other_mesh */
132 /** the total error quadric (contributions from all vertices in other mesh for which this is nearest) */
133 Matrix quadric = Matrix.ZERO;
135 Vert bound_to = this;
136 Matrix binding = new Matrix();
138 boolean quadricStale = false;
140 public Matrix errorQuadric() { return quadric; }
141 public Point getPoint() { return p; }
142 public float score() { return oldscore; }
144 private Matrix fundamentalQuadric = null;
145 public Matrix fundamentalQuadric() {
146 if (fundamentalQuadric == null) recomputeFundamentalQuadric();
147 return fundamentalQuadric;
150 private Vert(Point p) {
152 if (pointset.get(p) != null) throw new Error();
156 public void recomputeFundamentalQuadric() {
157 if (!quadricStale && fundamentalQuadric != null) return;
158 quadricStale = false;
159 unApplyQuadricToNeighbor();
160 Matrix m = Matrix.ZERO;
164 m = m.plus(t.norm().fundamentalQuadric(t.centroid()));
166 } while(e != this.e);
167 fundamentalQuadric = m;
168 applyQuadricToNeighbor();
171 public void unApplyQuadricToNeighbor() {
172 if (nearest_in_other_mesh == null) return;
173 if (fundamentalQuadric == null) return;
174 nearest_in_other_mesh.unComputeError();
175 nearest_in_other_mesh.quadric = nearest_in_other_mesh.quadric.minus(fundamentalQuadric);
176 nearest_in_other_mesh.quadric_count--;
177 if (nearest_in_other_mesh.quadric_count==0)
178 nearest_in_other_mesh.quadric = Matrix.ZERO;
179 nearest_in_other_mesh.computeError();
180 nearest_in_other_mesh = null;
183 public void applyQuadricToNeighbor() {
184 if (score_against == null) return;
186 Vert new_nearest = score_against.nearest(p);
187 if (nearest_in_other_mesh != null && new_nearest == nearest_in_other_mesh) return;
189 if (nearest_in_other_mesh != null) unApplyQuadricToNeighbor();
190 if (nearest_in_other_mesh != null) throw new Error();
192 nearest_in_other_mesh = new_nearest;
194 // don't attract to vertices that face the other way
195 if (nearest_in_other_mesh.e == null || nearest_in_other_mesh.norm().dot(norm()) < 0) {
196 nearest_in_other_mesh = null;
198 nearest_in_other_mesh.unComputeError();
199 nearest_in_other_mesh.quadric = nearest_in_other_mesh.quadric.plus(fundamentalQuadric());
200 nearest_in_other_mesh.quadric_count++;
201 nearest_in_other_mesh.computeError();
206 public void reComputeError() {
210 public void unComputeError() {
214 public void computeError() {
215 oldscore = quadric_count == 0 ? 0 : (quadric.preAndPostMultiply(p) / quadric_count);
219 /** does NOT update bound pairs! */
220 public boolean transform(Matrix m) {
221 unApplyQuadricToNeighbor();
223 if (pointset.get(this.p)==null) throw new Error();
224 pointset.remove(this);
225 float newx = m.a*p.x + m.b*p.y + m.c*p.z + m.d;
226 float newy = m.e*p.x + m.f*p.y + m.g*p.z + m.h;
227 float newz = m.i*p.x + m.j*p.y + m.k*p.z + m.l;
228 this.p = new Point(newx, newy, newz);
230 } catch (Exception e) {
231 throw new RuntimeException(e);
233 applyQuadricToNeighbor();
235 // should recompute fundamental quadrics of all vertices sharing a face, but we defer...
238 e.p2.quadricStale = true;
240 } while(e != this.e);
243 // FIXME: intersection test needed?
247 public boolean move(Vec v) {
248 Matrix m = new Matrix(v);
252 good &= p.transform(m);
258 public E getFreeIncident() {
259 E ret = getFreeIncident(e, e);
260 if (ret != null) return ret;
261 ret = getFreeIncident(e.pair.next, e.pair.next);
262 if (ret == null) throw new Error("unable to find free incident to " + this);
266 public E getFreeIncident(E start, E before) {
269 if (e.pair.p2 == this && e.pair.t == null && e.pair.next.t == null) return e.pair;
271 } while(e != before);
275 public E getE(Point p2) {
276 Vert v = pointset.get(p2);
277 if (v==null) return null;
280 public E getE(Vert p2) {
283 if (e==null) return null;
284 if (e.p1 == this && e.p2 == p2) return e;
291 Vec norm = new Vec(0, 0, 0);
294 if (e.t != null) norm = norm.plus(e.t.norm().times((float)e.prev.angle()));
296 } while(e != this.e);
300 public boolean isBoundTo(Vert p) {
303 if (px==this) return true;
308 public void unbind() { bound_to = this; binding = new Matrix(); }
309 public void bind(Vert p) { bind(p, new Matrix()); }
310 public void bind(Vert p, Matrix binding) {
311 if (isBoundTo(p)) return;
312 Vert temp_bound_to = p.bound_to;
313 Matrix temp_binding = p.binding;
314 p.bound_to = this.bound_to;
315 p.binding = binding.times(this.binding); // FIXME: may have order wrong here
316 this.bound_to = temp_bound_to;
317 this.binding = temp_binding.times(temp_binding); // FIXME: may have order wrong here
321 public class BindingGroup {
322 private HashSet<E> left = new HashSet<E>();
323 private HashSet<E> right = new HashSet<E>();
324 public BindingGroup() { }
325 public BindingGroup(E e) {
328 public void add(E e, boolean swap) {
330 if (e.bg == this) return;
331 for(E ex : (!swap ? e.bg.left : e.bg.right)) {
335 for(E ex : (!swap ? e.bg.right : e.bg.left)) {
340 (!swap ? left : right).add(e);
344 public void dobind(E e) {
345 // assumes e is part of the "left" set
348 if (left.contains(e)) { v1 = e.p1; v2 = e.p2; }
349 if (right.contains(e)) { v1 = e.p2; v2 = e.p1; }
361 public void shatter(BindingGroup bg1, BindingGroup bg2) {
363 e.shatter(e.midpoint(), bg1, bg2);
366 e.shatter(e.midpoint(), bg2, bg1); /* swap correct? */
371 /** [UNIQUE] an edge */
372 public final class E implements Comparable<E> {
374 public final Vert p1, p2;
375 T t; // triangle to our "left"
376 E prev; // previous half-edge
377 E next; // next half-edge
378 E pair; // partner half-edge
379 public BindingGroup bg = new BindingGroup(this);
380 boolean shattered = false;
382 public int compareTo(E e) { return e.length() > length() ? 1 : -1; }
384 public void bindEdge(E e) {
385 e.pair.bg.add(this, false);
387 public void dobind() { if (bg != null) bg.dobind(this); }
389 public Point shatter() { return shatter(midpoint(), null, null); }
390 public Point shatter(Point mid, BindingGroup bg1, BindingGroup bg2) {
391 if (shattered) return mid;
398 if (bg1==null) bg1 = new BindingGroup();
399 if (bg2==null) bg2 = new BindingGroup();
400 bg.shatter(bg1, bg2);
404 newT(r.p, p1.p, mid, null);
405 newT(r.p, mid, p2.p, null);
406 bg1.add(p1.getE(mid), false);
407 bg2.add(p2.getE(mid).pair, false);
411 public boolean destroyed = false;
412 public void destroy() {
413 if (destroyed) return;
415 pair.destroyed = true;
416 if (next.t != null) next.t.destroy();
417 if (prev.t != null) prev.t.destroy();
424 pair.prev.next = next;
425 next.prev = pair.prev;
426 prev.next = pair.next;
428 if (p1.e == this) p1.e = prev.next;
429 if (pair.p1.e == pair) pair.p1.e = pair.prev.next;
430 avgedge -= this.length();
431 avgedge -= pair.length();
436 private void sync() {
437 this.prev.next = this;
438 this.next.prev = this;
439 this.pair.pair = this;
440 if (this.next.p1 != p2) throw new Error();
441 if (this.prev.p2 != p1) throw new Error();
442 if (this.p1.e == null) this.p1.e = this;
449 private boolean added = false;
451 public T makeT() { return t==null ? (t = new T(this)) : t; }
453 /** angle between this half-edge and the next */
454 public double angle() {
455 Vec v1 = next.p2.p.minus(p2.p);
456 Vec v2 = this.p1.p.minus(p2.p);
457 return Math.acos(v1.norm().dot(v2.norm()));
460 public void makeAdjacent(E e) {
461 if (this.next == e) return;
462 if (p2 != e.p1) throw new Error("cannot make adjacent -- no shared vertex");
463 if (t != null || e.t != null) throw new Error("cannot make adjacent -- edges not both free");
465 E freeIncident = p2.getFreeIncident(e, this);
467 e.prev.next = freeIncident.next;
468 freeIncident.next.prev = e.prev;
470 freeIncident.next = this.next;
471 this.next.prev = freeIncident;
480 /** creates an isolated edge out in the middle of space */
481 public E(Point p1, Point p2) {
482 if (pointset.get(p1) != null) throw new Error();
483 if (pointset.get(p2) != null) throw new Error();
484 this.p1 = new Vert(p1);
485 this.p2 = new Vert(p2);
486 this.prev = this.next = this.pair = new E(this, this, this);
488 this.p2.e = this.pair;
492 /** adds a new half-edge from prev.p2 to p2 */
493 public E(E prev, Point p) {
495 p2 = pointset.get(p);
496 if (p2 == null) p2 = new Vert(p);
500 if (p2.getE(p1) != null) throw new Error();
502 this.next = this.pair = new E(this, this, prev.next);
504 E q = p2.getFreeIncident();
506 this.next.prev = this;
508 this.prev.next = this;
509 this.pair = new E(q, this, z);
511 if (p2.e==null) p2.e = this.pair;
515 /** adds a new half-edge to the mesh with a given predecessor, successor, and pair */
516 public E(E prev, E pair, E next) {
524 public Point midpoint() { return new Point((p1.p.x+p2.p.x)/2, (p1.p.y+p2.p.y)/2, (p1.p.z+p2.p.z)/2); }
525 public boolean has(Vert v) { return v==p1 || v==p2; }
526 public float length() { return p1.p.minus(p2.p).mag(); }
527 public String toString() { return p1+"->"+p2; }
529 public boolean intersects(T t) {
530 double A0=t.v1().p.x, A1=t.v1().p.y, A2=t.v1().p.z;
531 double B0=t.v2().p.x, B1=t.v2().p.y, B2=t.v2().p.z;
532 double C0=t.v3().p.x, C1=t.v3().p.y, C2=t.v3().p.z;
533 double j0=p1.p.x, j1=p1.p.y, j2=p1.p.z;
534 double k0=p2.p.x, k1=p2.p.y, k2=p2.p.z;
542 double R00, R01, R02, R03,
556 /* c = a × b */
557 c0 = a1 * b2 - a2 * b1;
558 c1 = a2 * b0 - a0 * b2;
559 c2 = a0 * b1 - a1 * b0;
561 /* M^(-1) = (1/det(M)) * adj(M) */
562 in_det = 1 / (c0 * c0 + c1 * c1 + c2 * c2);
563 R00 = (b1 * c2 - b2 * c1) * in_det;
564 R01 = (b2 * c0 - b0 * c2) * in_det;
565 R02 = (b0 * c1 - b1 * c0) * in_det;
566 R10 = (c1 * a2 - c2 * a1) * in_det;
567 R11 = (c2 * a0 - c0 * a2) * in_det;
568 R12 = (c0 * a1 - c1 * a0) * in_det;
574 R03 = -(R00 * A0 + R01 * A1 + R02 * A2);
575 R13 = -(R10 * A0 + R11 * A1 + R12 * A2);
576 R23 = -(R20 * A0 + R21 * A1 + R22 * A2);
578 /* fill in last row of 4x4 matrix */
582 J2 = R20 * j0 + R21 * j1 + R22 * j2 + R23;
583 K2 = R20 * k0 + R21 * k1 + R22 * k2 + R23;
584 if (J2 * K2 >= 0) return false;
586 J0 = R00 * j0 + R01 * j1 + R02 * j2 + R03;
587 K0 = R00 * k0 + R01 * k1 + R02 * k2 + R03;
588 i0 = J0 + J2 * ((K0 - J0) / (J2 - K2));
589 if (i0 < 0 || i0 > 1) return false;
591 J1 = R10 * j0 + R11 * j1 + R12 * j2 + R13;
592 K1 = R10 * k0 + R11 * k1 + R12 * k2 + R13;
593 i1 = J1 + J2 * ((K1 - J1) / (J2 - K2));
594 if (i1 < 0 || i1 > 1 || i0 + i1 > 1) return false;
600 public E makeE(Point p1, Point p2) {
601 Vert v1 = pointset.get(p1);
602 Vert v2 = pointset.get(p2);
603 if (v1 != null && v2 != null) {
605 if (e != null) return e;
607 if (e != null) return e;
609 if (v1 != null) return new E(v1.getFreeIncident(), p2);
610 if (v2 != null) return new E(v2.getFreeIncident(), p1).pair;
611 return new E(p1, p2);
613 public T newT(Point p1, Point p2, Point p3, Vec norm) {
615 Vec norm2 = p3.minus(p1).cross(p2.minus(p1));
616 float dot = norm.dot(norm2);
617 //if (Math.abs(dot) < EPointSILON) throw new Error("dot products within evertsilon of each other: "+norm+" "+norm2);
618 if (dot < 0) { Point p = p1; p1=p2; p2 = p; }
620 E e12 = makeE(p1, p2);
621 E e23 = makeE(p2, p3);
622 E e31 = makeE(p3, p1);
623 while(e12.next != e23 || e23.next != e31 || e31.next != e12) {
624 e12.makeAdjacent(e23);
625 e23.makeAdjacent(e31);
626 e31.makeAdjacent(e12);
629 if (e12.t == null) throw new Error();
630 if (e23.t == null) throw new Error();
631 if (e31.t == null) throw new Error();
636 public class FaceIterator implements Iterator<T> {
637 private HashSet<T> visited = new HashSet<T>();
638 private LinkedList<T> next = new LinkedList<T>();
639 public FaceIterator() { }
640 public FaceIterator(Vert v) { next.addFirst(v.e.t); }
641 public boolean hasNext() { return next.peek()!=null; }
642 public void remove() { throw new Error(); }
644 T ret = next.removeFirst();
645 if (ret == null) return null;
647 T t1 = ret.e1().pair.t;
648 T t2 = ret.e2().pair.t;
649 T t3 = ret.e3().pair.t;
650 if (t1 != null && !visited.contains(t1)) next.addFirst(t1);
651 if (t2 != null && !visited.contains(t2)) next.addFirst(t2);
652 if (t3 != null && !visited.contains(t3)) next.addFirst(t3);
657 /** [UNIQUE] a triangle (face) */
658 public final class T extends Triangle {
660 public final int color;
662 public void destroy() {
669 if (e1==e2 || e1==e3) throw new Error();
670 if (e3.next!=e1) throw new Error();
671 if (e1.t!=null || e2.t!=null || e3.t!=null) throw new Error("non-manifold surface or disagreeing normals");
674 e1.next.next.t = this;
676 // FIXME: check for sealed/watertight surface once construction is complete (and infer normal(s)?)
678 int color = Math.abs(random.nextInt());
681 if (e1().pair.t != null && color == e1().pair.t.color) { color++; continue; }
682 if (e2().pair.t != null && color == e2().pair.t.color) { color++; continue; }
683 if (e3().pair.t != null && color == e3().pair.t.color) { color++; continue; }
688 public E e1() { return e1; }
689 public E e2() { return e1.next; }
690 public E e3() { return e1.prev; }
691 public Vert v1() { return e1.p1; }
692 public Vert v2() { return e1.p2; }
693 public Vert v3() { return e1.next.p2; }
694 public Point p1() { return e1.p1.p; }
695 public Point p2() { return e1.p2.p; }
696 public Point p3() { return e1.next.p2.p; }
697 public boolean hasE(E e) { return e1==e || e1.next==e || e1.prev==e; }
698 public boolean has(Vert v) { return v1()==v || v2()==v || v3()==v; }