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 Matrix binding = Matrix.ONE;
122 Vertex bound_to = this;
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() {
214 ? (quadric.preAndPostMultiply(p) * 100) / quadric_count
217 : nearest_in_other_mesh != null
218 ? nearest_in_other_mesh.fundamentalQuadric().preAndPostMultiply(p) * 100 * 10
219 : score_against != null
220 ? score_against.nearest(p).fundamentalQuadric().preAndPostMultiply(p) * 100 * 10
222 for(E e = this.e; e!=null; e=e.pair.next==this.e?null:e.pair.next) {
223 double ang = Math.abs(e.crossAngle());
224 if (ang > Math.PI) throw new Error();
225 float minangle = (float)(Math.PI * 0.8);
227 oldscore += (ang - minangle);
232 private void removeTrianglesFromRTree() {
233 for(E e = this.e; e!=null; e=e.pair.next==this.e?null:e.pair.next)
234 if (e.t != null) e.t.removeFromRTree();
236 private void addTrianglesToRTree() {
237 for(E e = this.e; e!=null; e=e.pair.next==this.e?null:e.pair.next)
238 if (e.t != null) e.t.addToRTree();
241 /** does NOT update bound pairs! */
242 public boolean transform(Matrix m) {
243 if (immutableVertices) throw new Error();
245 unApplyQuadricToNeighbor();
248 if (vertices.get(this.p)==null) throw new Error();
249 vertices.remove(this);
250 removeTrianglesFromRTree();
251 float newx = m.a*p.x + m.b*p.y + m.c*p.z + m.d;
252 float newy = m.e*p.x + m.f*p.y + m.g*p.z + m.h;
253 float newz = m.i*p.x + m.j*p.y + m.k*p.z + m.l;
254 this.p = new Point(newx, newy, newz);
255 addTrianglesToRTree();
258 applyQuadricToNeighbor();
262 for(E e = this.e; e!=null; e=e.pair.next==this.e?null:e.pair.next) {
263 if (Math.abs(e.crossAngle()) > (Math.PI * 0.9) || Math.abs(e.next.crossAngle()) > (Math.PI * 0.9)) good = false;
264 if (e.t.aspect() < 0.1) good = false;
265 e.p2.quadricStale = true;
268 if (!ignorecollision && good) triangles.range(oldp, this.p, (Visitor<T>)this);
270 reComputeErrorAround();
274 public void visit(T t) {
276 for(E e = Vertex.this.e; e!=null; e=e.pair.next==Vertex.this.e?null:e.pair.next) {
277 if (!t.has(e.p1) && !t.has(e.p2) && e.intersects(t)) { good = false; }
279 if (!e.t.has(t.e1().p1) && !e.t.has(t.e1().p2) && t.e1().intersects(e.t)) { good = false; }
280 if (!e.t.has(t.e2().p1) && !e.t.has(t.e2().p2) && t.e2().intersects(e.t)) { good = false; }
281 if (!e.t.has(t.e3().p1) && !e.t.has(t.e3().p2) && t.e3().intersects(e.t)) { good = false; }
285 private boolean good;
287 public boolean move(Vec v) {
288 Matrix m = Matrix.translate(v);
292 good &= p.transform(m);
298 public E getFreeIncident() {
299 E ret = getFreeIncident(e, e);
300 if (ret != null) return ret;
301 for(E e = this.e; e!=null; e=e.pair.next==this.e?null:e.pair.next)
302 System.out.println(e + " " + e.t);
303 throw new Error("unable to find free incident to " + this);
306 public E getFreeIncident(E start, E before) {
307 for(E e = start; e!=null; e=e.pair.next==before?null:e.pair.next)
308 if (e.pair.p2 == this && e.pair.t == null && e.pair.next.t == null)
313 public E getE(Point p2) {
314 Vertex v = vertices.get(p2);
315 if (v==null) return null;
318 public E getE(Vertex p2) {
319 for(E e = this.e; e!=null; e=e.pair.next==this.e?null:e.pair.next)
320 if (e.p1 == this && e.p2 == p2) return e;
325 Vec norm = new Vec(0, 0, 0);
326 for(E e = this.e; e!=null; e=e.pair.next==this.e?null:e.pair.next)
328 norm = norm.plus(e.t.norm().times((float)e.prev.angle()));
332 public boolean isBoundTo(Vertex p) {
333 for(Vertex px = p; px!=null; px=(px.bound_to==p?null:px.bound_to))
338 public void unbind() { bound_to = this; binding = Matrix.ONE; }
339 public void bind(Vertex p) { bind(p, Matrix.ONE); }
340 public void bind(Vertex p, Matrix binding) {
341 if (isBoundTo(p)) return;
342 Vertex temp_bound_to = p.bound_to;
343 Matrix temp_binding = p.binding;
344 p.bound_to = this.bound_to;
345 p.binding = binding.times(this.binding); // FIXME: may have order wrong here
346 this.bound_to = temp_bound_to;
347 this.binding = temp_binding.times(temp_binding); // FIXME: may have order wrong here
351 public class BindingGroup {
352 private HashSet<E> set = new HashSet<E>();
353 public BindingGroup bind_others;
354 public BindingGroup other() { return bind_others; }
355 public BindingGroup(BindingGroup bind_others) { this.bind_others = bind_others; }
356 public BindingGroup() { this.bind_others = new BindingGroup(this); }
357 public BindingGroup(E e) { this(); set.add(e); }
358 public void add(E e) {
359 if (set.contains(e)) return;
361 BindingGroup e_bind_peers = e.bind_peers;
362 BindingGroup e_bind_to = e.bind_to;
364 e.bind_to = bind_others;
365 for (E epeer : e_bind_peers.set) add(epeer);
366 for (E eother : e_bind_to.set) bind_others.add(eother);
368 for(E eother : bind_others.set) {
369 if (e.next.bind_to.set.contains(eother.prev)) {
370 e.next.next.bindEdge(eother.prev.prev);
372 if (e.prev.bind_to.set.contains(eother.next)) {
373 e.prev.prev.bindEdge(eother.next.next);
378 public void dobind(E e) {
379 for(E ebound : set) {
380 e.p1.bind(ebound.p2);
381 e.p2.bind(ebound.p1);
384 public void shatter(BindingGroup bg1, BindingGroup bg2) {
386 e.shatter(e.midpoint(), bg1, bg2);
391 /** [UNIQUE] an edge */
392 public final class E implements Comparable<E> {
394 public final Vertex p1, p2;
395 T t; // triangle to our "left"
396 E prev; // previous half-edge
397 E next; // next half-edge
398 E pair; // partner half-edge
399 public BindingGroup bind_peers = new BindingGroup(this);
400 public BindingGroup bind_to = bind_peers.other();
401 boolean shattered = false;
403 public boolean intersects(T t) { return t.intersects(p1.p, p2.p); }
404 public float comparator() {
405 Vertex nearest = score_against.nearest(midpoint());
406 //if (t==null) return length();
408 double ang = Math.abs(crossAngle());
409 float minangle = (float)(Math.PI * 0.9);
414 if ((length() * length()) / t.area() > 10)
415 return (float)(length()*Math.sqrt(t.area()));
416 return length()*t.area();
418 return (float)Math.max(length(), midpoint().distance(nearest.p));
421 public int compareTo(E e) {
422 return e.comparator() > comparator() ? 1 : -1;
424 public void bindEdge(E e) { bind_to.add(e); }
425 public void dobind() { bind_to.dobind(this); }
427 public Point shatter() { return shatter(midpoint(), null, null); }
428 public Point shatter(Point mid, BindingGroup bg1, BindingGroup bg2) {
429 if (shattered || destroyed) return mid;
436 int old_colorclass = t==null ? 0 : t.colorclass;
437 if (bg1==null) bg1 = new BindingGroup();
438 if (bg2==null) bg2 = new BindingGroup();
439 BindingGroup old_bind_to = bind_to;
440 bind_peers.shatter(bg1, bg2);
441 old_bind_to.shatter(bg2.other(), bg1.other());
445 newT(r.p, p1.p, mid, null, old_colorclass);
446 newT(r.p, mid, p2.p, null, old_colorclass);
447 bg1.add(p1.getE(mid));
448 bg2.add(p2.getE(mid).pair);
452 public boolean destroyed = false;
453 public void destroy() {
454 if (destroyed) return;
456 pair.destroyed = true;
458 if (t != null) t.destroy();
461 if (pair.t != null) pair.t.destroy();
464 if (next.t != null) next.t.destroy();
465 if (prev.t != null) prev.t.destroy();
469 if (pair.next.t != null) pair.next.t.destroy();
470 if (pair.prev.t != null) pair.next.t.destroy();
476 this.bind_peers = null;
477 pair.bind_peers = null;
478 pair.prev.next = next;
479 next.prev = pair.prev;
480 prev.next = pair.next;
482 if (p1.e == this) p1.e = prev.next;
483 if (pair.p1.e == pair) pair.p1.e = pair.prev.next;
486 private void sync() {
487 this.prev.next = this;
488 this.next.prev = this;
489 this.pair.pair = this;
490 bind_peers.add(this);
491 if (this.next.p1 != p2) throw new Error();
492 if (this.prev.p2 != p1) throw new Error();
493 if (this.p1.e == null) this.p1.e = this;
494 if (!added) added = true;
496 private boolean added = false;
498 public T makeT(int colorclass) { return t==null ? (t = new T(this, colorclass)) : t; }
500 public double crossAngle() {
501 Vec v1 = t.norm().times(-1);
502 Vec v2 = pair.t.norm().times(-1);
503 return Math.acos(v1.norm().dot(v2.norm()));
506 /** angle between this half-edge and the next */
507 public double angle() {
508 Vec v1 = next.p2.p.minus(p2.p);
509 Vec v2 = this.p1.p.minus(p2.p);
510 return Math.acos(v1.norm().dot(v2.norm()));
513 public void makeAdjacent(E e) {
514 if (this.next == e) return;
515 if (p2 != e.p1) throw new Error("cannot make adjacent -- no shared vertex");
516 if (t != null || e.t != null) throw new Error("cannot make adjacent -- edges not both free");
518 E freeIncident = p2.getFreeIncident(e, this);
520 e.prev.next = freeIncident.next;
521 freeIncident.next.prev = e.prev;
523 freeIncident.next = this.next;
524 this.next.prev = freeIncident;
533 /** creates an isolated edge out in the middle of space */
534 public E(Point p1, Point p2) {
535 if (vertices.get(p1) != null) throw new Error();
536 if (vertices.get(p2) != null) throw new Error();
537 this.p1 = new Vertex(p1);
538 this.p2 = new Vertex(p2);
539 this.prev = this.next = this.pair = new E(this, this, this);
541 this.p2.e = this.pair;
545 /** adds a new half-edge from prev.p2 to p2 */
546 public E(E prev, Point p) {
548 p2 = vertices.get(p);
549 if (p2 == null) p2 = new Vertex(p);
553 if (p2.getE(p1) != null) throw new Error();
555 this.next = this.pair = new E(this, this, prev.next);
557 E q = p2.getFreeIncident();
559 this.next.prev = this;
561 this.prev.next = this;
562 this.pair = new E(q, this, z);
564 if (p2.e==null) p2.e = this.pair;
568 /** adds a new half-edge to the mesh with a given predecessor, successor, and pair */
569 public E(E prev, E pair, E next) {
577 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); }
578 public boolean has(Vertex v) { return v==p1 || v==p2; }
579 public float length() { return p1.p.minus(p2.p).mag(); }
580 public String toString() { return p1+"->"+p2; }
584 public E makeE(Point p1, Point p2) {
585 Vertex v1 = vertices.get(p1);
586 Vertex v2 = vertices.get(p2);
587 if (v1 != null && v2 != null) {
589 if (e != null) return e;
591 if (e != null) return e;
593 if (v1 != null) return new E(v1.getFreeIncident(), p2);
594 if (v2 != null) return new E(v2.getFreeIncident(), p1).pair;
595 return new E(p1, p2);
597 public T newT(Point p1, Point p2, Point p3, Vec norm, int colorclass) {
599 Vec norm2 = p3.minus(p1).cross(p2.minus(p1));
600 float dot = norm.dot(norm2);
601 //if (Math.abs(dot) < EPointSILON) throw new Error("dot products within evertsilon of each other: "+norm+" "+norm2);
602 if (dot < 0) { Point p = p1; p1=p2; p2 = p; }
604 E e12 = makeE(p1, p2);
605 E e23 = makeE(p2, p3);
606 E e31 = makeE(p3, p1);
607 while(e12.next != e23 || e23.next != e31 || e31.next != e12) {
608 e12.makeAdjacent(e23);
609 e23.makeAdjacent(e31);
610 e31.makeAdjacent(e12);
612 T ret = e12.makeT(colorclass);
613 if (e12.t == null) throw new Error();
614 if (e23.t == null) throw new Error();
615 if (e31.t == null) throw new Error();
620 /** [UNIQUE] a triangle (face) */
621 public final class T extends Triangle {
623 public final int color;
624 public final int colorclass;
626 public void removeFromRTree() { triangles.remove(this); }
627 public void addToRTree() { triangles.insert(this); }
629 public void destroy() { triangles.remove(this); }
631 T(E e1, int colorclass) {
635 if (e1==e2 || e1==e3) throw new Error();
636 if (e3.next!=e1) throw new Error();
637 if (e1.t!=null || e2.t!=null || e3.t!=null) throw new Error("non-manifold surface or disagreeing normals");
640 e1.next.next.t = this;
642 // FIXME: check for sealed/watertight surface once construction is complete (and infer normal(s)?)
644 int color = Math.abs(random.nextInt());
647 if (e1().pair.t != null && color == e1().pair.t.color) { color++; continue; }
648 if (e2().pair.t != null && color == e2().pair.t.color) { color++; continue; }
649 if (e3().pair.t != null && color == e3().pair.t.color) { color++; continue; }
653 this.colorclass = colorclass;
656 public E e1() { return e1; }
657 public E e2() { return e1.next; }
658 public E e3() { return e1.prev; }
659 public Vertex v1() { return e1.p1; }
660 public Vertex v2() { return e1.p2; }
661 public Vertex v3() { return e1.next.p2; }
662 public Point p1() { return e1.p1.p; }
663 public Point p2() { return e1.p2.p; }
664 public Point p3() { return e1.next.p2.p; }
665 public boolean hasE(E e) { return e1==e || e1.next==e || e1.prev==e; }
666 public boolean has(Vertex v) { return v1()==v || v2()==v || v3()==v; }
668 public boolean shouldBeDrawn() {
669 if (e1().bind_to.set.size() == 0) return false;
670 if (e2().bind_to.set.size() == 0) return false;
671 if (e3().bind_to.set.size() == 0) return false;