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 RTree<T> triangles = new RTree<T>();
18 private PointSet<Vertex> vertices = new PointSet<Vertex>();
20 public boolean immutableVertices;
21 public boolean ignorecollision = false;
22 public Mesh score_against = null;
23 public double score = 0;
25 public Mesh(boolean immutableVertices) { this.immutableVertices = immutableVertices; }
27 public void makeVerticesImmutable() { this.immutableVertices = true; }
28 public float score() { return (float)score; }
30 public int size() { return vertices.size(); }
31 public Iterable<Vertex> vertices() { return vertices; }
32 public Iterator<T> iterator() { return triangles.iterator(); }
34 public void rebindPoints() {
36 for(Mesh.T t : this) {
41 // ask edges to re-implement their bindings
42 for(Mesh.T t : this) {
49 public void unApplyQuadricToNeighborAll() {
50 HashSet<Vertex> done = new HashSet<Vertex>();
52 for(Vertex p : new Vertex[] { t.v1(), t.v2(), t.v3() }) {
53 if (done.contains(p)) continue;
55 p.unApplyQuadricToNeighbor();
58 public void recomputeAllFundamentalQuadrics() {
59 HashSet<Vertex> done = new HashSet<Vertex>();
61 for(Vertex p : new Vertex[] { t.v1(), t.v2(), t.v3() }) {
62 if (done.contains(p)) continue;
64 p.recomputeFundamentalQuadric();
67 public float applyQuadricToNeighborAll() {
70 HashSet<Vertex> done = new HashSet<Vertex>();
72 for(Vertex p : new Vertex[] { t.v1(), t.v2(), t.v3() }) {
73 if (done.contains(p)) continue;
75 p.applyQuadricToNeighbor();
78 return (float)(dist/num);
81 public void transform(Matrix m) {
82 ArrayList<Vertex> set = new ArrayList<Vertex>();
83 for(Vertex v : vertices) set.add(v);
84 for(Vertex v : set) v.transform(m);
87 public void rebuild() { /*vertices.rebuild();*/ }
88 public Vec diagonal() { return vertices.diagonal(); }
89 public Point centroid() { return vertices.centroid(); }
90 public Vertex nearest(Point p) { return vertices.nearest(p); }
92 /** compute the volume of the mesh */
93 public float volume() {
96 double area = t.area();
97 Vec origin_to_centroid = new Vec(new Point(0, 0, 0), t.centroid());
98 boolean facingAway = t.norm().dot(origin_to_centroid) > 0;
99 double height = Math.abs(t.norm().dot(origin_to_centroid));
100 total += ((facingAway ? 1 : -1) * area * height) / 3.0;
106 // Vertexices //////////////////////////////////////////////////////////////////////////////
108 /** a vertex in the mesh */
109 public final class Vertex extends HasPoint implements Visitor<T> {
110 public String toString() { return p.toString(); }
112 E e; // some edge *leaving* this point
114 /** the nearest vertex in the "score_against" mesh */
115 Vertex nearest_in_other_mesh;
116 /** the number of vertices in the other mesh for which this is the nearest_in_other_mesh */
118 /** the total error quadric (contributions from all vertices in other mesh for which this is nearest) */
119 Matrix quadric = Matrix.ZERO;
121 Vertex bound_to = this;
122 Matrix binding = Matrix.ONE;
124 boolean quadricStale = false;
126 public Matrix errorQuadric() { return quadric; }
127 public Point getPoint() { return p; }
128 public float score() { return oldscore; }
130 private Matrix fundamentalQuadric = null;
131 public Matrix fundamentalQuadric() {
132 if (fundamentalQuadric == null) recomputeFundamentalQuadric();
133 return fundamentalQuadric;
136 private Vertex(Point p) {
138 if (vertices.get(p) != null) throw new Error();
142 private void glNormal(GL gl) {
144 gl.glNormal3f(norm.x, norm.y, norm.z);
147 public void recomputeFundamentalQuadric() {
148 if (!quadricStale && fundamentalQuadric != null) return;
149 quadricStale = false;
150 unApplyQuadricToNeighbor();
151 Matrix m = Matrix.ZERO;
153 for(E e = this.e; e!=null; e=e.pair.next==this.e?null:e.pair.next) {
155 m = m.plus(t.norm().fundamentalQuadric(t.centroid()));
158 fundamentalQuadric = m.times(1/(float)count);
159 applyQuadricToNeighbor();
162 public void unApplyQuadricToNeighbor() {
163 if (nearest_in_other_mesh == null) return;
164 if (fundamentalQuadric == null) return;
165 nearest_in_other_mesh.unComputeError();
166 nearest_in_other_mesh.quadric = nearest_in_other_mesh.quadric.minus(fundamentalQuadric);
167 nearest_in_other_mesh.quadric_count--;
168 if (nearest_in_other_mesh.quadric_count==0)
169 nearest_in_other_mesh.quadric = Matrix.ZERO;
170 nearest_in_other_mesh.computeError();
171 nearest_in_other_mesh = null;
174 public void applyQuadricToNeighbor() {
175 if (score_against == null) return;
177 Vertex new_nearest = score_against.nearest(p);
178 if (nearest_in_other_mesh != null && new_nearest == nearest_in_other_mesh) return;
180 if (nearest_in_other_mesh != null) unApplyQuadricToNeighbor();
181 if (nearest_in_other_mesh != null) throw new Error();
183 nearest_in_other_mesh = new_nearest;
185 // don't attract to vertices that face the other way
186 if (nearest_in_other_mesh.e == null || nearest_in_other_mesh.norm().dot(norm()) < 0) {
187 nearest_in_other_mesh = null;
189 nearest_in_other_mesh.unComputeError();
190 nearest_in_other_mesh.quadric = nearest_in_other_mesh.quadric.plus(fundamentalQuadric());
191 nearest_in_other_mesh.quadric_count++;
192 nearest_in_other_mesh.computeError();
197 public void reComputeErrorAround() {
199 if (nearest_in_other_mesh != null) nearest_in_other_mesh.reComputeError();
200 for(E e = this.e; e!=null; e=e.pair.next==this.e?null:e.pair.next)
201 e.p2.reComputeError();
203 public void reComputeError() {
207 public void unComputeError() {
211 public void computeError() {
212 if (quadric_count == 0) {
213 if (immutableVertices) {
214 } else if (nearest_in_other_mesh == null) {
215 if (score_against != null) {
216 Vertex ne = score_against.nearest(p);
217 oldscore = ne.fundamentalQuadric().preAndPostMultiply(p) * 100 * 10;
222 oldscore = nearest_in_other_mesh.fundamentalQuadric().preAndPostMultiply(p) * 100 * 10;
225 oldscore = (quadric.preAndPostMultiply(p) * 100) / quadric_count;
232 for(E e = this.e; e!=null; e=e.pair.next==this.e?null:e.pair.next) {
233 //double ang = Math.abs(e.crossAngle());
234 double ang = Math.abs(e.crossAngle());
235 if (ang > Math.PI) throw new Error();
239 aspects += e.t.aspect()*e.t.aspect();
243 float minangle = (float)(Math.PI * 0.8);
245 oldscore += (ang - minangle);
247 if (numaspects > 0) oldscore += (aspects / numaspects);
249 //System.out.println(oldscore);
250 //oldscore = oldscore*oldscore;
254 private void removeTrianglesFromRTree() {
255 for(E e = this.e; e!=null; e=e.pair.next==this.e?null:e.pair.next)
256 if (e.t != null) e.t.removeFromRTree();
258 private void addTrianglesToRTree() {
259 for(E e = this.e; e!=null; e=e.pair.next==this.e?null:e.pair.next)
260 if (e.t != null) e.t.addToRTree();
263 /** does NOT update bound pairs! */
264 public boolean transform(Matrix m) {
265 if (immutableVertices) throw new Error();
267 unApplyQuadricToNeighbor();
270 if (vertices.get(this.p)==null) throw new Error();
271 vertices.remove(this);
272 removeTrianglesFromRTree();
273 float newx = m.a*p.x + m.b*p.y + m.c*p.z + m.d;
274 float newy = m.e*p.x + m.f*p.y + m.g*p.z + m.h;
275 float newz = m.i*p.x + m.j*p.y + m.k*p.z + m.l;
276 this.p = new Point(newx, newy, newz);
277 addTrianglesToRTree();
280 applyQuadricToNeighbor();
284 for(E e = this.e; e!=null; e=e.pair.next==this.e?null:e.pair.next) {
285 if (Math.abs(e.crossAngle()) > (Math.PI * 0.9) || Math.abs(e.next.crossAngle()) > (Math.PI * 0.9)) good = false;
286 if (e.t.aspect() < 0.1) good = false;
287 e.p2.quadricStale = true;
290 if (!ignorecollision && good) triangles.range(oldp, this.p, (Visitor<T>)this);
292 reComputeErrorAround();
296 public void visit(T t) {
298 for(E e = Vertex.this.e; e!=null; e=e.pair.next==Vertex.this.e?null:e.pair.next) {
299 if (!t.has(e.p1) && !t.has(e.p2) && e.intersects(t)) { good = false; }
301 if (!e.t.has(t.e1().p1) && !e.t.has(t.e1().p2) && t.e1().intersects(e.t)) { good = false; }
302 if (!e.t.has(t.e2().p1) && !e.t.has(t.e2().p2) && t.e2().intersects(e.t)) { good = false; }
303 if (!e.t.has(t.e3().p1) && !e.t.has(t.e3().p2) && t.e3().intersects(e.t)) { good = false; }
307 private boolean good;
309 public boolean move(Vec v) {
310 Matrix m = Matrix.translate(v);
314 good &= p.transform(m);
320 public E getFreeIncident() {
321 E ret = getFreeIncident(e, e);
322 if (ret != null) return ret;
323 ret = getFreeIncident(e.pair.next, e.pair.next);
327 System.out.println(ex + " " + ex.t);
330 throw new Error("unable to find free incident to " + this);
335 public E getFreeIncident(E start, E before) {
338 if (e.pair.p2 == this && e.pair.t == null && e.pair.next.t == null) return e.pair;
340 } while(e != before);
344 public E getE(Point p2) {
345 Vertex v = vertices.get(p2);
346 if (v==null) return null;
349 public E getE(Vertex p2) {
352 if (e==null) return null;
353 if (e.p1 == this && e.p2 == p2) return e;
360 Vec norm = new Vec(0, 0, 0);
363 if (e.t != null) norm = norm.plus(e.t.norm().times((float)e.prev.angle()));
365 } while(e != this.e);
369 public boolean isBoundTo(Vertex p) {
372 if (px==this) return true;
377 public void unbind() { bound_to = this; binding = Matrix.ONE; }
378 public void bind(Vertex p) { bind(p, Matrix.ONE); }
379 public void bind(Vertex p, Matrix binding) {
380 if (isBoundTo(p)) return;
381 Vertex temp_bound_to = p.bound_to;
382 Matrix temp_binding = p.binding;
383 p.bound_to = this.bound_to;
384 p.binding = binding.times(this.binding); // FIXME: may have order wrong here
385 this.bound_to = temp_bound_to;
386 this.binding = temp_binding.times(temp_binding); // FIXME: may have order wrong here
390 public class BindingGroup {
391 private HashSet<E> set = new HashSet<E>();
392 public BindingGroup bind_others;
393 public BindingGroup other() { return bind_others; }
394 public BindingGroup(BindingGroup bind_others) { this.bind_others = bind_others; }
395 public BindingGroup() { this.bind_others = new BindingGroup(this); }
396 public BindingGroup(E e) { this(); set.add(e); }
397 public void add(E e) {
398 if (set.contains(e)) return;
400 BindingGroup e_bind_peers = e.bind_peers;
401 BindingGroup e_bind_to = e.bind_to;
403 e.bind_to = bind_others;
404 for (E epeer : e_bind_peers.set) add(epeer);
405 for (E eother : e_bind_to.set) bind_others.add(eother);
407 for(E eother : bind_others.set) {
408 if (e.next.bind_to.set.contains(eother.prev)) {
409 e.next.next.bindEdge(eother.prev.prev);
411 if (e.prev.bind_to.set.contains(eother.next)) {
412 e.prev.prev.bindEdge(eother.next.next);
417 public void dobind(E e) {
418 for(E ebound : set) {
419 e.p1.bind(ebound.p2);
420 e.p2.bind(ebound.p1);
423 public void shatter(BindingGroup bg1, BindingGroup bg2) {
425 e.shatter(e.midpoint(), bg1, bg2);
430 /** [UNIQUE] an edge */
431 public final class E implements Comparable<E> {
433 public final Vertex p1, p2;
434 T t; // triangle to our "left"
435 E prev; // previous half-edge
436 E next; // next half-edge
437 E pair; // partner half-edge
438 public BindingGroup bind_peers = new BindingGroup(this);
439 public BindingGroup bind_to = bind_peers.other();
440 boolean shattered = false;
442 public boolean intersects(T t) { return t.intersects(p1.p, p2.p); }
443 public float comparator() {
444 Vertex nearest = score_against.nearest(midpoint());
445 //if (t==null) return length();
447 double ang = Math.abs(crossAngle());
448 float minangle = (float)(Math.PI * 0.9);
453 if ((length() * length()) / t.area() > 10)
454 return (float)(length()*Math.sqrt(t.area()));
455 return length()*t.area();
457 return (float)Math.max(length(), midpoint().distance(nearest.p));
460 public int compareTo(E e) {
461 return e.comparator() > comparator() ? 1 : -1;
463 public void bindEdge(E e) { bind_to.add(e); }
464 public void dobind() { bind_to.dobind(this); }
466 public Point shatter() { return shatter(midpoint(), null, null); }
467 public Point shatter(Point mid, BindingGroup bg1, BindingGroup bg2) {
468 if (shattered || destroyed) return mid;
475 int old_colorclass = t==null ? 0 : t.colorclass;
476 if (bg1==null) bg1 = new BindingGroup();
477 if (bg2==null) bg2 = new BindingGroup();
478 BindingGroup old_bind_to = bind_to;
479 bind_peers.shatter(bg1, bg2);
480 old_bind_to.shatter(bg2.other(), bg1.other());
484 newT(r.p, p1.p, mid, null, old_colorclass);
485 newT(r.p, mid, p2.p, null, old_colorclass);
486 bg1.add(p1.getE(mid));
487 bg2.add(p2.getE(mid).pair);
491 public boolean destroyed = false;
492 public void destroy() {
493 if (destroyed) return;
495 pair.destroyed = true;
497 if (t != null) t.destroy();
500 if (pair.t != null) pair.t.destroy();
503 if (next.t != null) next.t.destroy();
504 if (prev.t != null) prev.t.destroy();
508 if (pair.next.t != null) pair.next.t.destroy();
509 if (pair.prev.t != null) pair.next.t.destroy();
515 this.bind_peers = null;
516 pair.bind_peers = null;
517 pair.prev.next = next;
518 next.prev = pair.prev;
519 prev.next = pair.next;
521 if (p1.e == this) p1.e = prev.next;
522 if (pair.p1.e == pair) pair.p1.e = pair.prev.next;
525 private void sync() {
526 this.prev.next = this;
527 this.next.prev = this;
528 this.pair.pair = this;
529 bind_peers.add(this);
530 if (this.next.p1 != p2) throw new Error();
531 if (this.prev.p2 != p1) throw new Error();
532 if (this.p1.e == null) this.p1.e = this;
533 if (!added) added = true;
535 private boolean added = false;
537 public T makeT(int colorclass) { return t==null ? (t = new T(this, colorclass)) : t; }
539 public double crossAngle() {
540 Vec v1 = t.norm().times(-1);
541 Vec v2 = pair.t.norm().times(-1);
542 return Math.acos(v1.norm().dot(v2.norm()));
545 /** angle between this half-edge and the next */
546 public double angle() {
547 Vec v1 = next.p2.p.minus(p2.p);
548 Vec v2 = this.p1.p.minus(p2.p);
549 return Math.acos(v1.norm().dot(v2.norm()));
552 public void makeAdjacent(E e) {
553 if (this.next == e) return;
554 if (p2 != e.p1) throw new Error("cannot make adjacent -- no shared vertex");
555 if (t != null || e.t != null) throw new Error("cannot make adjacent -- edges not both free");
557 E freeIncident = p2.getFreeIncident(e, this);
559 e.prev.next = freeIncident.next;
560 freeIncident.next.prev = e.prev;
562 freeIncident.next = this.next;
563 this.next.prev = freeIncident;
572 /** creates an isolated edge out in the middle of space */
573 public E(Point p1, Point p2) {
574 if (vertices.get(p1) != null) throw new Error();
575 if (vertices.get(p2) != null) throw new Error();
576 this.p1 = new Vertex(p1);
577 this.p2 = new Vertex(p2);
578 this.prev = this.next = this.pair = new E(this, this, this);
580 this.p2.e = this.pair;
584 /** adds a new half-edge from prev.p2 to p2 */
585 public E(E prev, Point p) {
587 p2 = vertices.get(p);
588 if (p2 == null) p2 = new Vertex(p);
592 if (p2.getE(p1) != null) throw new Error();
594 this.next = this.pair = new E(this, this, prev.next);
596 E q = p2.getFreeIncident();
598 this.next.prev = this;
600 this.prev.next = this;
601 this.pair = new E(q, this, z);
603 if (p2.e==null) p2.e = this.pair;
607 /** adds a new half-edge to the mesh with a given predecessor, successor, and pair */
608 public E(E prev, E pair, E next) {
616 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); }
617 public boolean has(Vertex v) { return v==p1 || v==p2; }
618 public float length() { return p1.p.minus(p2.p).mag(); }
619 public String toString() { return p1+"->"+p2; }
623 public E makeE(Point p1, Point p2) {
624 Vertex v1 = vertices.get(p1);
625 Vertex v2 = vertices.get(p2);
626 if (v1 != null && v2 != null) {
628 if (e != null) return e;
630 if (e != null) return e;
632 if (v1 != null) return new E(v1.getFreeIncident(), p2);
633 if (v2 != null) return new E(v2.getFreeIncident(), p1).pair;
634 return new E(p1, p2);
636 public T newT(Point p1, Point p2, Point p3, Vec norm, int colorclass) {
638 Vec norm2 = p3.minus(p1).cross(p2.minus(p1));
639 float dot = norm.dot(norm2);
640 //if (Math.abs(dot) < EPointSILON) throw new Error("dot products within evertsilon of each other: "+norm+" "+norm2);
641 if (dot < 0) { Point p = p1; p1=p2; p2 = p; }
643 E e12 = makeE(p1, p2);
644 E e23 = makeE(p2, p3);
645 E e31 = makeE(p3, p1);
646 while(e12.next != e23 || e23.next != e31 || e31.next != e12) {
647 e12.makeAdjacent(e23);
648 e23.makeAdjacent(e31);
649 e31.makeAdjacent(e12);
651 T ret = e12.makeT(colorclass);
652 if (e12.t == null) throw new Error();
653 if (e23.t == null) throw new Error();
654 if (e31.t == null) throw new Error();
659 /** [UNIQUE] a triangle (face) */
660 public final class T extends Triangle {
662 public final int color;
663 public final int colorclass;
665 public void removeFromRTree() { triangles.remove(this); }
666 public void addToRTree() { triangles.insert(this); }
668 public void destroy() { triangles.remove(this); }
670 T(E e1, int colorclass) {
674 if (e1==e2 || e1==e3) throw new Error();
675 if (e3.next!=e1) throw new Error();
676 if (e1.t!=null || e2.t!=null || e3.t!=null) throw new Error("non-manifold surface or disagreeing normals");
679 e1.next.next.t = this;
681 // FIXME: check for sealed/watertight surface once construction is complete (and infer normal(s)?)
683 int color = Math.abs(random.nextInt());
686 if (e1().pair.t != null && color == e1().pair.t.color) { color++; continue; }
687 if (e2().pair.t != null && color == e2().pair.t.color) { color++; continue; }
688 if (e3().pair.t != null && color == e3().pair.t.color) { color++; continue; }
692 this.colorclass = colorclass;
695 public E e1() { return e1; }
696 public E e2() { return e1.next; }
697 public E e3() { return e1.prev; }
698 public Vertex v1() { return e1.p1; }
699 public Vertex v2() { return e1.p2; }
700 public Vertex v3() { return e1.next.p2; }
701 public Point p1() { return e1.p1.p; }
702 public Point p2() { return e1.p2.p; }
703 public Point p3() { return e1.next.p2.p; }
704 public boolean hasE(E e) { return e1==e || e1.next==e || e1.prev==e; }
705 public boolean has(Vertex v) { return v1()==v || v2()==v || v3()==v; }
707 public boolean shouldBeDrawn() {
708 if (e1().bind_to.set.size() == 0) return false;
709 if (e2().bind_to.set.size() == 0) return false;
710 if (e3().bind_to.set.size() == 0) return false;