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 float EPSILON = (float)0.0001;
15 public static 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 unbind() {
54 for(Mesh.T t : this) {
62 for(Mesh.T t : this) {
69 public float rescore() {
72 HashSet<Vert> done = new HashSet<Vert>();
74 for(Vert p : new Vert[] { t.v1(), t.v2(), t.v3() }) {
75 if (done.contains(p)) continue;
79 return (float)(dist/num);
82 public void transform(Matrix m) {
83 ArrayList<Vert> set = new ArrayList<Vert>();
84 for (Vert v : pointset)
86 for(Vert v : set) v.transform(m);
89 public float volume() {
92 double area = t.area();
93 Vec origin_to_centroid = new Vec(new Point(0, 0, 0), t.centroid());
94 boolean facingAway = t.norm().dot(origin_to_centroid) > 0;
95 double height = Math.abs(t.norm().dot(origin_to_centroid));
96 total += ((facingAway ? 1 : -1) * area * height) / 3.0;
102 public class BindingGroup {
103 public HashSet<E> es = new HashSet<E>();
104 public BindingGroup() { }
105 public BindingGroup(E e) {
108 public void add(E e) {
109 if (e.bg != null) { merge(e.bg); return; }
113 public void merge(BindingGroup bg) {
121 public Vec diagonal() { return pointset.diagonal(); }
122 public Point centroid() { return pointset.centroid(); }
123 public Vert nearest(Point p) { return pointset.nearest(p); }
125 public final class Vert extends HasPoint {
127 public Point getPoint() { return p; }
128 private Vert(Point p) {
130 if (pointset.get(p) != null) throw new Error();
133 public float score() { return oldscore; }
134 public void unscore() {
135 if (watch == null) return;
136 watch.watch_x -= p.x;
137 watch.watch_y -= p.y;
138 watch.watch_z -= p.z;
140 if (watch.watch_count==0) {
147 public Vert partner() { return watch==null ? this : watch; }
148 public Point watchback() { return watch_count==0 ? partner().p :
149 new Point(watch_x/watch_count, watch_y/watch_count, watch_z/watch_count); }
150 public void rescore() {
151 if (score_against == null) return;
156 if (watch != null) unscore();
159 watch = score_against.nearest(po.p);
161 // don't attract to vertices that face the other way
162 if (watch.e == null || watch.norm().dot(norm()) < 0) {
165 watch.watch_x += po.p.x;
166 watch.watch_y += po.p.y;
167 watch.watch_z += po.p.z;
173 if (watch_count==0) s1 = 0;
174 else s1 = p.distance(watch_x/watch_count, watch_y/watch_count, watch_z/watch_count);
175 s2 = watch==null ? 0 : po.p.distance(watch.p);
176 oldscore = (float)(s1 + s2);
180 /** does NOT update bound pairs! */
181 public boolean transform(Matrix m) {
182 // FIXME: screws up kdtree
183 // FIXME: screws up hashmap
186 if (pointset.get(this.p)==null) throw new Error();
187 pointset.remove(this);
188 float newx = m.a*p.x + m.b*p.y + m.c*p.z + m.d;
189 float newy = m.e*p.x + m.f*p.y + m.g*p.z + m.h;
190 float newz = m.i*p.x + m.j*p.y + m.k*p.z + m.l;
191 this.p = new Point(newx, newy, newz);
192 // FIXME: what if we move onto exactly where another point is?
194 } catch (Exception e) {
195 throw new RuntimeException(e);
201 for(E e = this.e; ;) {
202 if (e.intersects(t)) { good = false; break; }
204 if (e == this.e) break;
209 if (t==this.t) continue;
210 if (this.intersects(t)) good = false;
215 public boolean move(Vec v) {
216 Matrix m = new Matrix(v);
220 good &= p.transform(m);
221 v = v.times(binding); // bleh wrong
227 public E getFreeIncident() {
228 E ret = getFreeIncident(e, e);
229 if (ret != null) return ret;
230 ret = getFreeIncident(e.pair.next, e.pair.next);
231 if (ret == null) throw new Error("unable to find free incident to " + this);
235 public E getFreeIncident(E start, E before) {
238 if (e.pair.p2 == this && e.pair.t == null && e.pair.next.t == null) return e.pair;
240 } while(e != before);
244 public E getE(Point p2) {
245 Vert v = pointset.get(p2);
246 if (v==null) return null;
249 public E getE(Vert p2) {
252 if (e==null) return null;
253 if (e.p1 == this && e.p2 == p2) return e;
259 public boolean isBoundTo(Vert p) {
262 if (px==this) return true;
268 public void unbind() { bound_to = this; binding = new Matrix(); }
269 public void bind(Vert p) { bind(p, new Matrix()); }
270 public void bind(Vert p, Matrix binding) {
271 if (isBoundTo(p)) return;
272 Vert temp_bound_to = p.bound_to;
273 Matrix temp_binding = p.binding;
274 p.bound_to = this.bound_to;
275 p.binding = binding.times(this.binding); // FIXME: may have order wrong here
276 this.bound_to = temp_bound_to;
277 this.binding = temp_binding.times(temp_binding); // FIXME: may have order wrong here
280 Vec norm = new Vec(0, 0, 0);
283 if (e.t != null) norm = norm.plus(e.t.norm().times((float)e.prev.angle()));
285 } while(e != this.e);
289 Vert bound_to = this;
295 E e; // some edge *leaving* this point
296 Matrix binding = new Matrix();
298 boolean inserted = false;
301 /** [UNIQUE] an edge */
302 public final class E implements Comparable<E> {
304 public final Vert p1, p2;
305 T t; // triangle to our "left"
306 E prev; // previous half-edge
307 E next; // next half-edge
308 E pair; // partner half-edge
309 public BindingGroup bg = new BindingGroup(this);
311 public int compareTo(E e) { return e.length() > length() ? 1 : -1; }
313 public void bind(E e) { bind(e, new Matrix()); }
314 public void bind(E e, Matrix m) { e.bg.add(this); }
316 public void dobind() {
317 if (bg==null) return;
319 if (ex==this) continue;
325 boolean shattered = false;
326 public Point shatter() { return shatter(midpoint(), null, null); }
327 public Point shatter(Point mid, BindingGroup bg1, BindingGroup bg2) {
328 if (shattered) return mid;
335 if (bg1==null) bg1 = new BindingGroup();
336 if (bg2==null) bg2 = new BindingGroup();
337 for(E e : bg.es) e.shatter(e.midpoint(), bg1, bg2);
341 newT(r.p, p1.p, mid, null);
342 newT(r.p, mid, p2.p, null);
343 bg1.add(p1.getE(mid));
344 bg2.add(p2.getE(mid).pair);
348 public boolean destroyed = false;
349 public void destroy() {
350 if (destroyed) return;
352 pair.destroyed = true;
353 if (next.t != null) next.t.destroy();
354 if (prev.t != null) prev.t.destroy();
361 pair.prev.next = next;
362 next.prev = pair.prev;
363 prev.next = pair.next;
365 if (p1.e == this) p1.e = prev.next;
366 if (pair.p1.e == pair) pair.p1.e = pair.prev.next;
367 avgedge -= this.length();
368 avgedge -= pair.length();
373 private void sync() {
374 this.prev.next = this;
375 this.next.prev = this;
376 this.pair.pair = this;
377 if (this.next.p1 != p2) throw new Error();
378 if (this.prev.p2 != p1) throw new Error();
379 if (this.p1.e == null) this.p1.e = this;
386 private boolean added = false;
388 public T makeT() { return t==null ? (t = new T(this)) : t; }
390 /** angle between this half-edge and the next */
391 public double angle() {
392 Vec v1 = next.p2.p.minus(p2.p);
393 Vec v2 = this.p1.p.minus(p2.p);
394 return Math.acos(v1.norm().dot(v2.norm()));
397 public void makeAdjacent(E e) {
398 if (this.next == e) return;
399 if (p2 != e.p1) throw new Error("cannot make adjacent -- no shared vertex");
400 if (t != null || e.t != null) throw new Error("cannot make adjacent -- edges not both free");
402 E freeIncident = p2.getFreeIncident(e, this);
404 e.prev.next = freeIncident.next;
405 freeIncident.next.prev = e.prev;
407 freeIncident.next = this.next;
408 this.next.prev = freeIncident;
417 /** creates an isolated edge out in the middle of space */
418 public E(Vert p1, Vert p2) {
419 if (p1==p2) throw new Error("attempt to create edge with single vertex: " + p1);
422 this.prev = this.next = this.pair = new E(this, this, this);
426 /** adds a new half-edge from prev.p2 to p2 */
427 public E(E prev, Vert p2) {
431 if (p2.getE(p1) != null) throw new Error();
433 this.next = this.pair = new E(this, this, prev.next);
435 E q = p2.getFreeIncident();
437 this.next.prev = this;
439 this.prev.next = this;
440 this.pair = new E(q, this, z);
445 /** adds a new half-edge to the mesh with a given predecessor, successor, and pair */
446 public E(E prev, E pair, E next) {
454 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); }
455 public boolean has(Vert v) { return v==p1 || v==p2; }
456 public float length() { return p1.p.minus(p2.p).mag(); }
457 public String toString() { return p1+"->"+p2; }
459 public boolean intersects(T t) {
460 double A0=t.v1().p.x, A1=t.v1().p.y, A2=t.v1().p.z;
461 double B0=t.v2().p.x, B1=t.v2().p.y, B2=t.v2().p.z;
462 double C0=t.v3().p.x, C1=t.v3().p.y, C2=t.v3().p.z;
463 double j0=p1.p.x, j1=p1.p.y, j2=p1.p.z;
464 double k0=p2.p.x, k1=p2.p.y, k2=p2.p.z;
472 double R00, R01, R02, R03,
486 /* c = a × b */
487 c0 = a1 * b2 - a2 * b1;
488 c1 = a2 * b0 - a0 * b2;
489 c2 = a0 * b1 - a1 * b0;
491 /* M^(-1) = (1/det(M)) * adj(M) */
492 in_det = 1 / (c0 * c0 + c1 * c1 + c2 * c2);
493 R00 = (b1 * c2 - b2 * c1) * in_det;
494 R01 = (b2 * c0 - b0 * c2) * in_det;
495 R02 = (b0 * c1 - b1 * c0) * in_det;
496 R10 = (c1 * a2 - c2 * a1) * in_det;
497 R11 = (c2 * a0 - c0 * a2) * in_det;
498 R12 = (c0 * a1 - c1 * a0) * in_det;
504 R03 = -(R00 * A0 + R01 * A1 + R02 * A2);
505 R13 = -(R10 * A0 + R11 * A1 + R12 * A2);
506 R23 = -(R20 * A0 + R21 * A1 + R22 * A2);
508 /* fill in last row of 4x4 matrix */
512 J2 = R20 * j0 + R21 * j1 + R22 * j2 + R23;
513 K2 = R20 * k0 + R21 * k1 + R22 * k2 + R23;
514 if (J2 * K2 >= 0) return false;
516 J0 = R00 * j0 + R01 * j1 + R02 * j2 + R03;
517 K0 = R00 * k0 + R01 * k1 + R02 * k2 + R03;
518 i0 = J0 + J2 * ((K0 - J0) / (J2 - K2));
519 if (i0 < 0 || i0 > 1) return false;
521 J1 = R10 * j0 + R11 * j1 + R12 * j2 + R13;
522 K1 = R10 * k0 + R11 * k1 + R12 * k2 + R13;
523 i1 = J1 + J2 * ((K1 - J1) / (J2 - K2));
524 if (i1 < 0 || i1 > 1 || i0 + i1 > 1) return false;
530 private Vert register(Point p) {
531 Vert v = pointset.get(p);
532 return v==null ? new Vert(p) : v;
534 public E makeE(Point p1, Point p2) {
535 Vert v1 = pointset.get(p1);
536 Vert v2 = pointset.get(p2);
537 if (v1 != null && v2 != null) {
539 if (e != null) return e;
541 if (e != null) return e;
543 if (v1 != null) return new E(v1.getFreeIncident(), register(p2));
544 if (v2 != null) return new E(v2.getFreeIncident(), register(p1)).pair;
545 return new E(register(p1), register(p2));
547 public T newT(Point p1, Point p2, Point p3, Vec norm) {
549 Vec norm2 = p3.minus(p1).cross(p2.minus(p1));
550 float dot = norm.dot(norm2);
551 //if (Math.abs(dot) < EPointSILON) throw new Error("dot products within evertsilon of each other: "+norm+" "+norm2);
552 if (dot < 0) { Point p = p1; p1=p2; p2 = p; }
554 E e12 = makeE(p1, p2);
555 E e23 = makeE(p2, p3);
556 E e31 = makeE(p3, p1);
557 while(e12.next != e23 || e23.next != e31 || e31.next != e12) {
558 e12.makeAdjacent(e23);
559 e23.makeAdjacent(e31);
560 e31.makeAdjacent(e12);
563 if (e12.t == null) throw new Error();
564 if (e23.t == null) throw new Error();
565 if (e31.t == null) throw new Error();
570 public class FaceIterator implements Iterator<T> {
571 private HashSet<T> visited = new HashSet<T>();
572 private LinkedList<T> next = new LinkedList<T>();
573 public FaceIterator() { }
574 public FaceIterator(Vert v) { next.addFirst(v.e.t); }
575 public boolean hasNext() { return next.peek()!=null; }
576 public void remove() { throw new Error(); }
578 T ret = next.removeFirst();
579 if (ret == null) return null;
581 T t1 = ret.e1().pair.t;
582 T t2 = ret.e2().pair.t;
583 T t3 = ret.e3().pair.t;
584 if (t1 != null && !visited.contains(t1)) next.addFirst(t1);
585 if (t2 != null && !visited.contains(t2)) next.addFirst(t2);
586 if (t3 != null && !visited.contains(t3)) next.addFirst(t3);
591 /** [UNIQUE] a triangle (face) */
592 public final class T extends Triangle {
594 public final int color;
596 public void destroy() {
603 if (e1==e2 || e1==e3) throw new Error();
604 if (e3.next!=e1) throw new Error();
605 if (e1.t!=null || e2.t!=null || e3.t!=null) throw new Error("non-manifold surface or disagreeing normals");
608 e1.next.next.t = this;
610 // FIXME: check for sealed/watertight surface once construction is complete (and infer normal(s)?)
612 int color = Math.abs(random.nextInt());
615 if (e1().pair.t != null && color == e1().pair.t.color) { color++; continue; }
616 if (e2().pair.t != null && color == e2().pair.t.color) { color++; continue; }
617 if (e3().pair.t != null && color == e3().pair.t.color) { color++; continue; }
622 public E e1() { return e1; }
623 public E e2() { return e1.next; }
624 public E e3() { return e1.prev; }
625 public Vert v1() { return e1.p1; }
626 public Vert v2() { return e1.p2; }
627 public Vert v3() { return e1.next.p2; }
628 public Point p1() { return e1.p1.p; }
629 public Point p2() { return e1.p2.p; }
630 public Point p3() { return e1.next.p2.p; }
631 public boolean hasE(E e) { return e1==e || e1.next==e || e1.prev==e; }
632 public boolean has(Vert v) { return v1()==v || v2()==v || v3()==v; }