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 Vert register(Point p) { Vert v = pointset.get(p); return v==null ? new Vert(p) : v; }
126 public final class Vert extends HasPoint {
128 public Point getPoint() { return p; }
129 private Vert(Point p) {
131 if (pointset.get(p) != null) throw new Error();
134 public float score() { return oldscore; }
135 public void unscore() {
136 if (watch == null) return;
137 watch.watch_x -= p.x;
138 watch.watch_y -= p.y;
139 watch.watch_z -= p.z;
141 if (watch.watch_count==0) {
148 public Vert partner() { return watch==null ? this : watch; }
149 public Vert watchback() { return watch_count==0 ? partner() :
150 register(new Point(watch_x/watch_count, watch_y/watch_count, watch_z/watch_count)); }
151 public void rescore() {
152 if (score_against == null) return;
157 if (watch != null) unscore();
160 watch = score_against.nearest(po.p);
162 // don't attract to vertices that face the other way
163 if (watch.e == null || watch.norm().dot(norm()) < 0) {
166 watch.watch_x += po.p.x;
167 watch.watch_y += po.p.y;
168 watch.watch_z += po.p.z;
174 if (watch_count==0) s1 = 0;
175 else s1 = p.distance(watch_x/watch_count, watch_y/watch_count, watch_z/watch_count);
176 s2 = watch==null ? 0 : po.p.distance(watch.p);
177 oldscore = (float)(s1 + s2);
181 /** does NOT update bound pairs! */
182 public boolean transform(Matrix m) {
183 // FIXME: screws up kdtree
184 // FIXME: screws up hashmap
187 if (pointset.get(this.p)==null) throw new Error();
188 pointset.remove(this);
189 float newx = m.a*p.x + m.b*p.y + m.c*p.z + m.d;
190 float newy = m.e*p.x + m.f*p.y + m.g*p.z + m.h;
191 float newz = m.i*p.x + m.j*p.y + m.k*p.z + m.l;
192 this.p = new Point(newx, newy, newz);
193 // FIXME: what if we move onto exactly where another point is?
195 } catch (Exception e) {
196 throw new RuntimeException(e);
202 for(E e = this.e; ;) {
203 if (e.intersects(t)) { good = false; break; }
205 if (e == this.e) break;
210 if (t==this.t) continue;
211 if (this.intersects(t)) good = false;
216 public boolean move(Vec v) {
217 Matrix m = new Matrix(v);
221 good &= p.transform(m);
222 v = v.times(binding); // bleh wrong
228 public E makeE(Vert p2) {
230 if (e != null) return e;
232 if (this.e == null && p2.e == null) return this.e = new E(this, p2);
233 if (this.e == null && p2.e != null) return p2.makeE(this).pair;
234 return new E(getFreeIncident(), p2);
237 public E getFreeIncident() {
238 E ret = getFreeIncident(e, e);
239 if (ret != null) return ret;
240 ret = getFreeIncident(e.pair.next, e.pair.next);
241 if (ret == null) throw new Error("unable to find free incident to " + this);
245 public E getFreeIncident(E start, E before) {
248 if (e.pair.p2 == this && e.pair.t == null && e.pair.next.t == null) return e.pair;
250 } while(e != before);
254 public E getE(Vert p2) {
257 if (e==null) return null;
258 if (e.p1 == this && e.p2 == p2) return e;
264 public boolean isBoundTo(Vert p) {
267 if (px==this) return true;
273 public void unbind() { bound_to = this; binding = new Matrix(); }
274 public void bind(Vert p) { bind(p, new Matrix()); }
275 public void bind(Vert p, Matrix binding) {
276 if (isBoundTo(p)) return;
277 Vert temp_bound_to = p.bound_to;
278 Matrix temp_binding = p.binding;
279 p.bound_to = this.bound_to;
280 p.binding = binding.times(this.binding); // FIXME: may have order wrong here
281 this.bound_to = temp_bound_to;
282 this.binding = temp_binding.times(temp_binding); // FIXME: may have order wrong here
285 Vec norm = new Vec(0, 0, 0);
288 if (e.t != null) norm = norm.plus(e.t.norm().times((float)e.prev.angle()));
290 } while(e != this.e);
294 Vert bound_to = this;
300 E e; // some edge *leaving* this point
301 Matrix binding = new Matrix();
303 boolean inserted = false;
306 /** [UNIQUE] an edge */
307 public final class E implements Comparable<E> {
309 public final Vert p1, p2;
310 T t; // triangle to our "left"
311 E prev; // previous half-edge
312 E next; // next half-edge
313 E pair; // partner half-edge
314 public BindingGroup bg = new BindingGroup(this);
316 public int compareTo(E e) { return e.length() > length() ? 1 : -1; }
318 public void bind(E e) { bind(e, new Matrix()); }
319 public void bind(E e, Matrix m) { e.bg.add(this); }
321 public void dobind() {
322 if (bg==null) return;
324 if (ex==this) continue;
330 boolean shattered = false;
331 public Vert shatter() { return shatter(register(midpoint()), null, null); }
332 public Vert shatter(Vert mid, BindingGroup bg1, BindingGroup bg2) {
333 if (shattered) return mid;
340 if (bg1==null) bg1 = new BindingGroup();
341 if (bg2==null) bg2 = new BindingGroup();
342 for(E e : bg.es) e.shatter(register(e.midpoint()), bg1, bg2);
346 newT(r, p1, mid, null);
347 newT(r, mid, p2, null);
348 bg1.add(p1.getE(mid));
349 bg2.add(mid.getE(p2));
353 public boolean destroyed = false;
354 public void destroy() {
355 if (destroyed) return;
357 pair.destroyed = true;
358 if (next.t != null) next.t.destroy();
359 if (prev.t != null) prev.t.destroy();
366 pair.prev.next = next;
367 next.prev = pair.prev;
368 prev.next = pair.next;
370 if (p1.e == this) p1.e = prev.next;
371 if (pair.p1.e == pair) pair.p1.e = pair.prev.next;
372 avgedge -= this.length();
373 avgedge -= pair.length();
378 private void sync() {
379 this.prev.next = this;
380 this.next.prev = this;
381 this.pair.pair = this;
382 if (this.next.p1 != p2) throw new Error();
383 if (this.prev.p2 != p1) throw new Error();
384 if (this.p1.e == null) this.p1.e = this;
391 private boolean added = false;
393 public T makeT() { return t==null ? (t = new T(this)) : t; }
395 /** angle between this half-edge and the next */
396 public double angle() {
397 Vec v1 = next.p2.p.minus(p2.p);
398 Vec v2 = this.p1.p.minus(p2.p);
399 return Math.acos(v1.norm().dot(v2.norm()));
402 public void makeAdjacent(E e) {
403 if (this.next == e) return;
404 if (p2 != e.p1) throw new Error("cannot make adjacent -- no shared vertex");
405 if (t != null || e.t != null) throw new Error("cannot make adjacent -- edges not both free");
407 E freeIncident = p2.getFreeIncident(e, this);
409 e.prev.next = freeIncident.next;
410 freeIncident.next.prev = e.prev;
412 freeIncident.next = this.next;
413 this.next.prev = freeIncident;
422 /** creates an isolated edge out in the middle of space */
423 public E(Vert p1, Vert p2) {
424 if (p1==p2) throw new Error("attempt to create edge with single vertex: " + p1);
427 this.prev = this.next = this.pair = new E(this, this, this);
431 /** adds a new half-edge from prev.p2 to p2 */
432 public E(E prev, Vert p2) {
436 if (p2.getE(p1) != null) throw new Error();
438 this.next = this.pair = new E(this, this, prev.next);
440 E q = p2.getFreeIncident();
442 this.next.prev = this;
444 this.prev.next = this;
445 this.pair = new E(q, this, z);
450 /** adds a new half-edge to the mesh with a given predecessor, successor, and pair */
451 public E(E prev, E pair, E next) {
459 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); }
460 public boolean has(Vert v) { return v==p1 || v==p2; }
461 public float length() { return p1.p.minus(p2.p).mag(); }
462 public String toString() { return p1+"->"+p2; }
464 public boolean intersects(T t) {
465 double A0=t.v1().p.x, A1=t.v1().p.y, A2=t.v1().p.z;
466 double B0=t.v2().p.x, B1=t.v2().p.y, B2=t.v2().p.z;
467 double C0=t.v3().p.x, C1=t.v3().p.y, C2=t.v3().p.z;
468 double j0=p1.p.x, j1=p1.p.y, j2=p1.p.z;
469 double k0=p2.p.x, k1=p2.p.y, k2=p2.p.z;
477 double R00, R01, R02, R03,
491 /* c = a × b */
492 c0 = a1 * b2 - a2 * b1;
493 c1 = a2 * b0 - a0 * b2;
494 c2 = a0 * b1 - a1 * b0;
496 /* M^(-1) = (1/det(M)) * adj(M) */
497 in_det = 1 / (c0 * c0 + c1 * c1 + c2 * c2);
498 R00 = (b1 * c2 - b2 * c1) * in_det;
499 R01 = (b2 * c0 - b0 * c2) * in_det;
500 R02 = (b0 * c1 - b1 * c0) * in_det;
501 R10 = (c1 * a2 - c2 * a1) * in_det;
502 R11 = (c2 * a0 - c0 * a2) * in_det;
503 R12 = (c0 * a1 - c1 * a0) * in_det;
509 R03 = -(R00 * A0 + R01 * A1 + R02 * A2);
510 R13 = -(R10 * A0 + R11 * A1 + R12 * A2);
511 R23 = -(R20 * A0 + R21 * A1 + R22 * A2);
513 /* fill in last row of 4x4 matrix */
517 J2 = R20 * j0 + R21 * j1 + R22 * j2 + R23;
518 K2 = R20 * k0 + R21 * k1 + R22 * k2 + R23;
519 if (J2 * K2 >= 0) return false;
521 J0 = R00 * j0 + R01 * j1 + R02 * j2 + R03;
522 K0 = R00 * k0 + R01 * k1 + R02 * k2 + R03;
523 i0 = J0 + J2 * ((K0 - J0) / (J2 - K2));
524 if (i0 < 0 || i0 > 1) return false;
526 J1 = R10 * j0 + R11 * j1 + R12 * j2 + R13;
527 K1 = R10 * k0 + R11 * k1 + R12 * k2 + R13;
528 i1 = J1 + J2 * ((K1 - J1) / (J2 - K2));
529 if (i1 < 0 || i1 > 1 || i0 + i1 > 1) return false;
535 public T newT(Point p1, Point p2, Point p3, Vec norm) { return newT(register(p1), register(p2), register(p3), norm); }
536 public T newT(Vert p1, Vert p2, Vert p3, Vec norm) {
538 Vec norm2 = p3.p.minus(p1.p).cross(p2.p.minus(p1.p));
539 float dot = norm.dot(norm2);
540 //if (Math.abs(dot) < EPointSILON) throw new Error("dot products within evertsilon of each other: "+norm+" "+norm2);
541 if (dot < 0) { Vert p = p1; p1=p2; p2 = p; }
543 E e12 = p1.makeE(p2);
544 E e23 = p2.makeE(p3);
545 E e31 = p3.makeE(p1);
546 while(e12.next != e23 || e23.next != e31 || e31.next != e12) {
547 e12.makeAdjacent(e23);
548 e23.makeAdjacent(e31);
549 e31.makeAdjacent(e12);
552 if (e12.t == null) throw new Error();
553 if (e23.t == null) throw new Error();
554 if (e31.t == null) throw new Error();
559 public class FaceIterator implements Iterator<T> {
560 private HashSet<T> visited = new HashSet<T>();
561 private LinkedList<T> next = new LinkedList<T>();
562 public FaceIterator() { }
563 public FaceIterator(Vert v) { next.addFirst(v.e.t); }
564 public boolean hasNext() { return next.peek()!=null; }
565 public void remove() { throw new Error(); }
567 T ret = next.removeFirst();
568 if (ret == null) return null;
570 T t1 = ret.e1().pair.t;
571 T t2 = ret.e2().pair.t;
572 T t3 = ret.e3().pair.t;
573 if (t1 != null && !visited.contains(t1)) next.addFirst(t1);
574 if (t2 != null && !visited.contains(t2)) next.addFirst(t2);
575 if (t3 != null && !visited.contains(t3)) next.addFirst(t3);
580 /** [UNIQUE] a triangle (face) */
581 public final class T extends Triangle {
583 public final int color;
585 public void destroy() {
592 if (e1==e2 || e1==e3) throw new Error();
593 if (e3.next!=e1) throw new Error();
594 if (e1.t!=null || e2.t!=null || e3.t!=null) throw new Error("non-manifold surface or disagreeing normals");
597 e1.next.next.t = this;
599 // FIXME: check for sealed/watertight surface once construction is complete (and infer normal(s)?)
601 int color = Math.abs(random.nextInt());
604 if (e1().pair.t != null && color == e1().pair.t.color) { color++; continue; }
605 if (e2().pair.t != null && color == e2().pair.t.color) { color++; continue; }
606 if (e3().pair.t != null && color == e3().pair.t.color) { color++; continue; }
611 public E e1() { return e1; }
612 public E e2() { return e1.next; }
613 public E e3() { return e1.prev; }
614 public Vert v1() { return e1.p1; }
615 public Vert v2() { return e1.p2; }
616 public Vert v3() { return e1.next.p2; }
617 public Point p1() { return e1.p1.p; }
618 public Point p2() { return e1.p2.p; }
619 public Point p3() { return e1.next.p2.p; }
620 public boolean hasE(E e) { return e1==e || e1.next==e || e1.prev==e; }
621 public boolean has(Vert v) { return v1()==v || v2()==v || v3()==v; }