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 Geom implements Iterable<Geom.T> {
14 private KDTree kd = new KDTree(3);
16 public static float EPSILON = (float)0.0001;
17 public static Random random = new Random();
19 private HashMap<Point,Vert> ps = new HashMap<Point,Vert>();
20 public HashSet<E> es = new HashSet<E>();
21 public ArrayList<T> ts = new ArrayList<T>();
23 public Iterator<T> iterator() { return ts.iterator(); }
25 public Point origin() { return new Point(0, 0, 0); }
27 public Geom score_against = null;
28 public double score = 0;
29 public float score() { return (float)score; }
31 public void unbind() {
33 for(Geom.T t : this) {
41 for(Geom.T t : this) {
47 public int numedges = 0;
48 public float avgedge = 0;
50 public float rescore() {
53 HashSet<Vert> done = new HashSet<Vert>();
55 for(Vert p : new Vert[] { t.p1(), t.p2(), t.p3() }) {
56 if (done.contains(p)) continue;
61 for(Vert p : new Vert[] { t.p1(), t.p2(), t.p3() })
65 for(Vert p : new Vert[] { t.p1(), t.p2(), t.p3() })
67 return (float)(dist/num);
70 public void transform(Matrix m) {
71 ArrayList<Vert> set = new ArrayList<Vert>();
72 set.addAll(ps.values());
73 for(Vert v : set) v.transform(m);
76 public Vec diagonal() {
77 float min_x = Float.MAX_VALUE;
78 float min_y = Float.MAX_VALUE;
79 float min_z = Float.MAX_VALUE;
80 float max_x = Float.MIN_VALUE;
81 float max_y = Float.MIN_VALUE;
82 float max_z = Float.MIN_VALUE;
83 for(Point p : ps.keySet()) {
84 if (p.x < min_x) min_x = p.x;
85 if (p.y < min_y) min_y = p.y;
86 if (p.z < min_z) min_z = p.z;
87 if (p.x > max_x) max_x = p.x;
88 if (p.y > max_y) max_y = p.y;
89 if (p.z > max_z) max_z = p.z;
91 return new Vec(max_x - min_x, max_y - min_y, max_z - min_z);
94 public Point centroid() {
95 float min_x = Float.MAX_VALUE;
96 float min_y = Float.MAX_VALUE;
97 float min_z = Float.MAX_VALUE;
98 float max_x = Float.MIN_VALUE;
99 float max_y = Float.MIN_VALUE;
100 float max_z = Float.MIN_VALUE;
101 for(Point p : ps.keySet()) {
102 if (p.x < min_x) min_x = p.x;
103 if (p.y < min_y) min_y = p.y;
104 if (p.z < min_z) min_z = p.z;
105 if (p.x > max_x) max_x = p.x;
106 if (p.y > max_y) max_y = p.y;
107 if (p.z > max_z) max_z = p.z;
109 return new Point((float)(max_x + min_x)/2,
110 (float)(max_y + min_y)/2,
111 (float)(max_z + min_z)/2);
114 public T newT(Vert p12, Vert p23, Vert p31, Vec norm) {
115 Vec norm2 = p31.p.minus(p12.p).cross(p23.p.minus(p12.p));
116 float dot = norm.dot(norm2);
117 //if (Math.abs(dot) < EPointSILON) throw new Error("dot products within epsilon of each other: "+norm+" "+norm2);
118 if (dot < 0) { Vert p = p12; p12=p23; p23 = p; }
119 return newT(p12, p23, p31);
122 public float volume() {
125 double area = t.area();
126 Vec origin_to_centroid = new Vec(new Point(0, 0, 0), t.centroid());
127 boolean facingAway = t.norm().dot(origin_to_centroid) > 0;
128 double height = Math.abs(t.norm().dot(origin_to_centroid));
129 total += ((facingAway ? 1 : -1) * area * height) / 3.0;
134 public Vert nearest(Point p) {
136 try { results = kd.nearest(new double[]{p.x,p.y,p.z},1); } catch (Exception e) { throw new Error(e); }
137 return (Vert)results[0];
140 public T newT(Vert p1, Vert p2, Vert p3) {
141 E e12 = p1.makeE(p2);
142 E e23 = p2.makeE(p3);
143 E e31 = p3.makeE(p1);
144 while(e12.next != e23 || e23.next != e31 || e31.next != e12) {
145 e12.makeAdjacent(e23);
146 e23.makeAdjacent(e31);
147 e31.makeAdjacent(e12);
150 if (e12.t == null) throw new Error();
151 if (e23.t == null) throw new Error();
152 if (e31.t == null) throw new Error();
156 public class BindingGroup {
157 public HashSet<E> es = new HashSet<E>();
158 public BindingGroup() { }
159 public BindingGroup(E e) {
162 public void add(E e) {
163 if (e.bg != null) { merge(e.bg); return; }
167 public void merge(BindingGroup bg) {
175 public final class Vert {
177 public Vert(Point p) {
179 if (ps.get(p) != null) throw new Error();
180 ps.put(this.p, this);
182 public void kdremove() {
183 if (!inserted) return;
185 try { kd.delete(new double[]{p.x,p.y,p.z}); } catch (Exception e) { }
187 public void kdinsert() {
188 if (inserted) return;
190 try { kd.insert(new double[]{p.x,p.y,p.z},this); } catch (Exception e) { throw new Error(e); }
193 public float score() { return oldscore; }
194 public void unscore() {
195 if (watch == null) return;
196 watch.watch_x -= p.x;
197 watch.watch_y -= p.y;
198 watch.watch_z -= p.z;
200 if (watch.watch_count==0) {
207 public Vert partner() { return watch==null ? this : watch; }
208 public Vert watchback() { return watch_count==0 ? partner() :
209 register(new Point(watch_x/watch_count, watch_y/watch_count, watch_z/watch_count)); }
210 public void rescore() {
211 if (score_against == null) return;
216 if (watch != null) unscore();
219 watch = score_against.nearest(po.p);
221 // don't attract to vertices that face the other way
222 if (watch.norm().dot(norm()) < 0) {
225 watch.watch_x += po.p.x;
226 watch.watch_y += po.p.y;
227 watch.watch_z += po.p.z;
233 if (watch_count==0) s1 = 0;
234 else s1 = p.distance(watch_x/watch_count, watch_y/watch_count, watch_z/watch_count);
235 s2 = watch==null ? 0 : po.p.distance(watch.p);
236 oldscore = (float)(s1 + s2);
241 /** does NOT update bound pairs! */
242 public boolean transform(Matrix m) {
243 // FIXME: screws up kdtree
244 // FIXME: screws up hashmap
247 if (ps.get(this.p)==null) throw new Error();
249 float newx = m.a*p.x + m.b*p.y + m.c*p.z + m.d;
250 float newy = m.e*p.x + m.f*p.y + m.g*p.z + m.h;
251 float newz = m.i*p.x + m.j*p.y + m.k*p.z + m.l;
252 this.p = new Point(newx, newy, newz);
253 // FIXME: what if we move onto exactly where another point is?
254 ps.put(this.p,(Vert)this);
255 } catch (Exception e) {
256 throw new RuntimeException(e);
262 for(E e = this.e; ;) {
263 if (e.intersects(t)) { good = false; break; }
265 if (e == this.e) break;
270 if (t==this.t) continue;
271 if (this.intersects(t)) good = false;
276 public boolean move(Vec v) {
277 Matrix m = new Matrix(v);
281 good &= p.transform(m);
282 v = v.times(binding); // bleh wrong
288 public E makeE(Vert p2) {
290 if (e != null) return e;
292 if (this.e == null && p2.e == null) return this.e = new E(this, p2);
293 if (this.e == null && p2.e != null) return p2.makeE(this).pair;
294 return new E(getFreeIncident(), p2);
297 public E getFreeIncident() {
298 E ret = getFreeIncident(e, e);
299 if (ret != null) return ret;
300 ret = getFreeIncident(e.pair.next, e.pair.next);
301 if (ret == null) throw new Error("unable to find free incident to " + this);
305 public E getFreeIncident(E start, E before) {
308 if (e.pair.p2 == this && e.pair.t == null && e.pair.next.t == null) return e.pair;
310 } while(e != before);
314 public E getE(Vert p2) {
317 if (e==null) return null;
318 if (e.p1 == this && e.p2 == p2) return e;
324 public boolean isBoundTo(Vert p) {
327 if (px==this) return true;
333 public void unbind() { bound_to = this; binding = new Matrix(); }
334 public void bind(Vert p) { bind(p, new Matrix()); }
335 public void bind(Vert p, Matrix binding) {
336 if (isBoundTo(p)) return;
337 Vert temp_bound_to = p.bound_to;
338 Matrix temp_binding = p.binding;
339 p.bound_to = this.bound_to;
340 p.binding = binding.times(this.binding); // FIXME: may have order wrong here
341 this.bound_to = temp_bound_to;
342 this.binding = temp_binding.times(temp_binding); // FIXME: may have order wrong here
345 Vec norm = new Vec(0, 0, 0);
348 if (e.t != null) norm = norm.plus(e.t.norm().times((float)e.prev.angle()));
350 } while(e != this.e);
354 Vert bound_to = this;
360 E e; // some edge *leaving* this point
361 Matrix binding = new Matrix();
363 boolean inserted = false;
366 /** [UNIQUE] an edge */
367 public final class E implements Comparable<E> {
369 public boolean intersects(T t) {
370 double A0=t.p1().p.x, A1=t.p1().p.y, A2=t.p1().p.z;
371 double B0=t.p2().p.x, B1=t.p2().p.y, B2=t.p2().p.z;
372 double C0=t.p3().p.x, C1=t.p3().p.y, C2=t.p3().p.z;
373 double j0=p1.p.x, j1=p1.p.y, j2=p1.p.z;
374 double k0=p2.p.x, k1=p2.p.y, k2=p2.p.z;
382 double R00, R01, R02, R03,
396 /* c = a × b */
397 c0 = a1 * b2 - a2 * b1;
398 c1 = a2 * b0 - a0 * b2;
399 c2 = a0 * b1 - a1 * b0;
401 /* M^(-1) = (1/det(M)) * adj(M) */
402 in_det = 1 / (c0 * c0 + c1 * c1 + c2 * c2);
403 R00 = (b1 * c2 - b2 * c1) * in_det;
404 R01 = (b2 * c0 - b0 * c2) * in_det;
405 R02 = (b0 * c1 - b1 * c0) * in_det;
406 R10 = (c1 * a2 - c2 * a1) * in_det;
407 R11 = (c2 * a0 - c0 * a2) * in_det;
408 R12 = (c0 * a1 - c1 * a0) * in_det;
414 R03 = -(R00 * A0 + R01 * A1 + R02 * A2);
415 R13 = -(R10 * A0 + R11 * A1 + R12 * A2);
416 R23 = -(R20 * A0 + R21 * A1 + R22 * A2);
418 /* fill in last row of 4x4 matrix */
422 J2 = R20 * j0 + R21 * j1 + R22 * j2 + R23;
423 K2 = R20 * k0 + R21 * k1 + R22 * k2 + R23;
424 if (J2 * K2 >= 0) return false;
426 J0 = R00 * j0 + R01 * j1 + R02 * j2 + R03;
427 K0 = R00 * k0 + R01 * k1 + R02 * k2 + R03;
428 i0 = J0 + J2 * ((K0 - J0) / (J2 - K2));
429 if (i0 < 0 || i0 > 1) return false;
431 J1 = R10 * j0 + R11 * j1 + R12 * j2 + R13;
432 K1 = R10 * k0 + R11 * k1 + R12 * k2 + R13;
433 i1 = J1 + J2 * ((K1 - J1) / (J2 - K2));
434 if (i1 < 0 || i1 > 1 || i0 + i1 > 1) return false;
439 public int compareTo(E e) {
440 return e.length() > length() ? 1 : -1;
443 public final Vert p1, p2;
444 T t; // triangle to our "left"
445 E prev; // previous half-edge
446 E next; // next half-edge
447 E pair; // partner half-edge
450 public BindingGroup bg = new BindingGroup(this);
452 public void bind(E e) { bind(e, new Matrix()); }
453 public void bind(E e, Matrix m) { e.bg.add(this); }
455 public void dobind() {
456 if (bg==null) return;
458 if (ex==this) continue;
464 boolean shattered = false;
465 public Vert shatter() { return shatter(register(midpoint()), null, null); }
466 public Vert shatter(Vert mid, BindingGroup bg1, BindingGroup bg2) {
467 if (shattered) return mid;
474 if (bg1==null) bg1 = new BindingGroup();
475 if (bg2==null) bg2 = new BindingGroup();
476 for(E e : bg.es) e.shatter(register(e.midpoint()), bg1, bg2);
482 bg1.add(p1.getE(mid));
483 bg2.add(mid.getE(p2));
487 public boolean destroyed = false;
488 public void destroy() {
489 if (destroyed) return;
491 pair.destroyed = true;
492 if (next.t != null) next.t.destroy();
493 if (prev.t != null) prev.t.destroy();
494 if (pair.next.t != null) ts.remove(pair.next.t);
495 if (pair.prev.t != null) ts.remove(pair.prev.t);
502 pair.prev.next = next;
503 next.prev = pair.prev;
504 prev.next = pair.next;
506 if (p1.e == this) p1.e = prev.next;
507 if (pair.p1.e == pair) pair.p1.e = pair.prev.next;
510 avgedge -= this.length();
511 avgedge -= pair.length();
516 private void sync() {
517 this.prev.next = this;
518 this.next.prev = this;
519 this.pair.pair = this;
520 if (this.next.p1 != p2) throw new Error();
521 if (this.prev.p2 != p1) throw new Error();
522 if (this.p1.e == null) this.p1.e = this;
530 private boolean added = false;
532 public T makeT() { return t==null ? (t = new T(this)) : t; }
534 /** angle between this half-edge and the next */
535 public double angle() {
536 Vec v1 = next.p2.p.minus(p2.p);
537 Vec v2 = this.p1.p.minus(p2.p);
538 return Math.acos(v1.norm().dot(v2.norm()));
541 public void makeAdjacent(E e) {
542 if (this.next == e) return;
543 if (p2 != e.p1) throw new Error("cannot make adjacent -- no shared vertex");
544 if (t != null || e.t != null) throw new Error("cannot make adjacent -- edges not both free");
546 E freeIncident = p2.getFreeIncident(e, this);
548 e.prev.next = freeIncident.next;
549 freeIncident.next.prev = e.prev;
551 freeIncident.next = this.next;
552 this.next.prev = freeIncident;
561 /** creates an isolated edge out in the middle of space */
562 public E(Vert p1, Vert p2) {
563 if (p1==p2) throw new Error("attempt to create edge with single vertex: " + p1);
566 this.prev = this.next = this.pair = new E(this, this, this);
570 /** adds a new half-edge from prev.p2 to p2 */
571 public E(E prev, Vert p2) {
575 if (p2.getE(p1) != null) throw new Error();
577 this.next = this.pair = new E(this, this, prev.next);
579 E q = p2.getFreeIncident();
581 this.next.prev = this;
583 this.prev.next = this;
584 this.pair = new E(q, this, z);
589 /** adds a new half-edge to the mesh with a given predecessor, successor, and pair */
590 public E(E prev, E pair, E next) {
598 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); }
599 public boolean has(Vert v) { return v==p1 || v==p2; }
600 public float length() { return p1.p.minus(p2.p).mag(); }
601 public String toString() { return p1+"->"+p2; }
604 /** [UNIQUE] a triangle (face) */
605 public final class T {
607 public final int color;
609 public void destroy() {
613 public Vert nearest(Point p) {
614 float d1 = p1().p.distance(p);
615 float d2 = p2().p.distance(p);
616 float d3 = p3().p.distance(p);
617 if (d1 < d2 && d1 < d3) return p1();
618 if (d2 < d3) return p2();
626 if (e1==e2 || e1==e3) throw new Error();
627 if (e3.next!=e1) throw new Error();
628 if (e1.t!=null || e2.t!=null || e3.t!=null)
629 throw new Error("non-manifold surface or disagreeing normals");
632 e1.next.next.t = this;
634 // FIXME: check for sealed/watertight surface once construction is complete (and infer normal(s)?)
636 int color = Math.abs(random.nextInt());
639 if (e1().pair.t != null && color == e1().pair.t.color) { color++; continue; }
640 if (e2().pair.t != null && color == e2().pair.t.color) { color++; continue; }
641 if (e3().pair.t != null && color == e3().pair.t.color) { color++; continue; }
653 public Vert p1() { return e1.p1; }
654 public Vert p2() { return e1.p2; }
655 public Vert p3() { return e1.next.p2; }
656 public E e1() { return e1; }
657 public E e2() { return e1.next; }
658 public E e3() { return e1.prev; }
659 public Vec norm() { return p2().p.minus(p1().p).cross(p3().p.minus(p1().p)).norm(); }
660 public boolean hasE(E e) { return e1==e || e1.next==e || e1.prev==e; }
661 public boolean has(Vert v) { return p1()==v || p2()==v || p3()==v; }
663 public float area() {
664 return (float)Math.abs(0.5 * e1().length() * new Vec(p1().p, p2().p).norm().dot(new Vec(p2().p, p3().p)));
667 public void glVertices(GL gl) {
673 public Point centroid() { return new Point((p1().p.x+p2().p.x+p3().p.x)/3,
674 (p1().p.y+p2().p.y+p3().p.y)/3,
675 (p1().p.z+p2().p.z+p3().p.z)/3); }
676 public float diameter() {
677 // FIXME: what is this supposed to be?
678 return Math.max(Math.max(e1().length(), e2().length()), e3().length()) / 2;
684 public Vert register(Point p) { Vert v = ps.get(p); return v==null ? new Vert(p) : v; }