3 import java.awt.event.*;
5 import javax.media.opengl.*;
6 import javax.media.opengl.glu.*;
7 import edu.wlu.cs.levy.CG.KDTree;
9 public class Geom implements Iterable<Geom.T> {
11 private KDTree kd = new KDTree(3);
13 public static float EPSILON = (float)0.0001;
14 public static Random random = new Random();
16 private HashMap<P,V> ps = new HashMap<P,V>();
17 public HashSet<E> es = new HashSet<E>();
18 public ArrayList<T> ts = new ArrayList<T>();
20 public Iterator<T> iterator() { return ts.iterator(); }
22 public P origin() { return newP(0, 0, 0); }
24 public Geom score_against = null;
25 public double score = 0;
26 public float score() {
30 public float rescore() {
33 HashSet<V> done = new HashSet<V>();
35 for(V p : new V[] { t.p1(), t.p2(), t.p3() }) {
36 if (done.contains(p)) continue;
41 for(V p : new V[] { t.p1(), t.p2(), t.p3() })
45 for(V p : new V[] { t.p1(), t.p2(), t.p3() })
47 return (float)(dist/num);
50 public void transform(M m) {
51 ArrayList<V> set = new ArrayList<V>();
52 set.addAll(ps.values());
53 for(V v : set) v.transform(m);
56 public Vec diagonal() {
57 float min_x = Float.MAX_VALUE;
58 float min_y = Float.MAX_VALUE;
59 float min_z = Float.MAX_VALUE;
60 float max_x = Float.MIN_VALUE;
61 float max_y = Float.MIN_VALUE;
62 float max_z = Float.MIN_VALUE;
63 for(P p : ps.keySet()) {
64 if (p.x < min_x) min_x = p.x;
65 if (p.y < min_y) min_y = p.y;
66 if (p.z < min_z) min_z = p.z;
67 if (p.x > max_x) max_x = p.x;
68 if (p.y > max_y) max_y = p.y;
69 if (p.z > max_z) max_z = p.z;
71 return new Vec(max_x - min_x, max_y - min_y, max_z - min_z);
75 float min_x = Float.MAX_VALUE;
76 float min_y = Float.MAX_VALUE;
77 float min_z = Float.MAX_VALUE;
78 float max_x = Float.MIN_VALUE;
79 float max_y = Float.MIN_VALUE;
80 float max_z = Float.MIN_VALUE;
81 for(P p : ps.keySet()) {
82 if (p.x < min_x) min_x = p.x;
83 if (p.y < min_y) min_y = p.y;
84 if (p.z < min_z) min_z = p.z;
85 if (p.x > max_x) max_x = p.x;
86 if (p.y > max_y) max_y = p.y;
87 if (p.z > max_z) max_z = p.z;
89 return new P((float)(max_x + min_x)/2,
90 (float)(max_y + min_y)/2,
91 (float)(max_z + min_z)/2);
94 public P newP(double x, double y, double z) { return newP((float)x, (float)y, (float)z); }
95 public P newP(float x, float y, float z) { return new P(x, y, z); }
97 public T newT(V p12, V p23, V p31, Vec norm) {
98 Vec norm2 = p31.p.minus(p12.p).cross(p23.p.minus(p12.p));
99 float dot = norm.dot(norm2);
100 //if (Math.abs(dot) < EPSILON) throw new Error("dot products within epsilon of each other: "+norm+" "+norm2);
101 if (dot < 0) { V p = p12; p12=p23; p23 = p; }
102 return newT(p12, p23, p31);
106 public float volume() {
109 double area = t.area();
110 Vec origin_to_centroid = new Vec(newP(0, 0, 0), t.centroid());
111 boolean facingAway = t.norm().dot(origin_to_centroid) > 0;
112 double height = Math.abs(t.norm().dot(origin_to_centroid));
113 total += ((facingAway ? 1 : -1) * area * height) / 3.0;
118 public V nearest(P p) {
120 try { results = kd.nearest(new double[]{p.x,p.y,p.z},1); } catch (Exception e) { throw new Error(e); }
121 return (V)results[0];
124 public T newT(V p1, V p2, V p3) {
125 E e12 = p1.makeE(p2);
126 E e23 = p2.makeE(p3);
127 E e31 = p3.makeE(p1);
128 while(e12.next != e23 || e23.next != e31 || e31.next != e12) {
129 e12.makeAdjacent(e23);
130 e23.makeAdjacent(e31);
131 e31.makeAdjacent(e12);
134 if (e12.t == null) throw new Error();
135 if (e23.t == null) throw new Error();
136 if (e31.t == null) throw new Error();
140 public final class V {
144 if (ps.get(p) != null) throw new Error();
145 ps.put(this.p, this);
148 public int hashCode() {
152 public void kdremove() {
153 if (!inserted) return;
155 try { kd.delete(new double[]{p.x,p.y,p.z}); } catch (Exception e) { }
157 public void kdinsert() {
158 if (inserted) return;
160 try { kd.insert(new double[]{p.x,p.y,p.z},this); } catch (Exception e) { throw new Error(e); }
163 public float score() { return oldscore; }
164 public void unscore() {
165 if (watch == null) return;
166 watch.watch_x -= p.x;
167 watch.watch_y -= p.y;
168 watch.watch_z -= p.z;
170 if (watch.watch_count==0) {
177 public V partner() { return watch==null ? this : watch; }
178 public V watchback() { return watch_count==0 ? partner() :
179 newP(watch_x/watch_count, watch_y/watch_count, watch_z/watch_count).register(); }
180 public void rescore() {
181 if (score_against == null) return;
186 if (watch != null) unscore();
189 watch = score_against.nearest(po.p);
191 // don't attract to vertices that face the other way
192 if (watch.norm().dot(norm()) < 0) {
195 watch.watch_x += po.p.x;
196 watch.watch_y += po.p.y;
197 watch.watch_z += po.p.z;
203 if (watch_count==0) s1 = 0;
204 else s1 = p.distance(watch_x/watch_count, watch_y/watch_count, watch_z/watch_count);
205 s2 = watch==null ? 0 : po.p.distance(watch.p);
206 oldscore = (float)(s1 + s2);
211 /** does NOT update bound pairs! */
212 public boolean transform(M m) {
213 // FIXME: screws up kdtree
214 // FIXME: screws up hashmap
217 if (ps.get(this.p)==null) throw new Error();
219 float newx = m.a*p.x + m.b*p.y + m.c*p.z + m.d;
220 float newy = m.e*p.x + m.f*p.y + m.g*p.z + m.h;
221 float newz = m.i*p.x + m.j*p.y + m.k*p.z + m.l;
222 this.p = new P(newx, newy, newz);
223 // FIXME: what if we move onto exactly where another point is?
224 ps.put(this.p,(V)this);
225 } catch (Exception e) {
226 throw new RuntimeException(e);
232 for(E e = this.e; ;) {
233 if (e.intersects(t)) { good = false; break; }
235 if (e == this.e) break;
240 if (t==this.t) continue;
241 if (this.intersects(t)) good = false;
246 public boolean move(Vec v) {
251 good &= p.transform(m);
252 v = v.times(binding); // bleh wrong
258 public E makeE(V p2) {
260 if (e != null) return e;
262 if (this.e == null && p2.e == null) return this.e = new E(this, p2);
263 if (this.e == null && p2.e != null) return p2.makeE(this).pair;
264 return new E(getFreeIncident(), p2);
267 public E getFreeIncident() {
268 E ret = getFreeIncident(e, e);
269 if (ret != null) return ret;
270 ret = getFreeIncident(e.pair.next, e.pair.next);
271 if (ret == null) throw new Error("unable to find free incident to " + this);
275 public E getFreeIncident(E start, E before) {
278 if (e.pair.p2 == this && e.pair.t == null && e.pair.next.t == null) return e.pair;
280 } while(e != before);
284 public E getE(V p2) {
287 if (e==null) return null;
288 if (e.p1 == this && e.p2 == p2) return e;
294 public boolean isBoundTo(V p) {
297 if (px==this) return true;
303 public void unbind() { bound_to = this; binding = new M(); }
304 public void bind(V p) { bind(p, new M()); }
305 public void bind(V p, M binding) {
306 if (isBoundTo(p)) return;
307 V temp_bound_to = p.bound_to;
308 M temp_binding = p.binding;
309 p.bound_to = this.bound_to;
310 p.binding = binding.times(this.binding); // FIXME: may have order wrong here
311 this.bound_to = temp_bound_to;
312 this.binding = temp_binding.times(temp_binding); // FIXME: may have order wrong here
315 Vec norm = new Vec(0, 0, 0);
318 if (e.t != null) norm = norm.plus(e.t.norm().times((float)e.prev.angle()));
320 } while(e != this.e);
330 E e; // some edge *leaving* this point
333 boolean inserted = false;
338 public P(float x, float y, float z) { this.x = x; this.y = y; this.z = z; }
339 public float distance(P p) { return distance(p.x, p.y, p.z); }
340 public float distance(float ox, float oy, float oz) { return (float)Math.sqrt((x-ox)*(x-ox)+(y-oy)*(y-oy)+(z-oz)*(z-oz)); }
341 public V register() { V v = ps.get(this); return v==null ? new V(this) : v; }
342 public P times(M m) { return m.times(this); }
343 public Vec minus(P p) { return new Vec(x-p.x, y-p.y, z-p.z); }
344 public P plus(Vec v) { return newP(x+v.x, y+v.y, z+v.z); }
345 public boolean equals(Object o) { return o!=null && (o instanceof P) && ((P)o).x==x && ((P)o).y==y && ((P)o).z==z; }
346 public void glVertex(GL gl) { _glVertex(gl); }
347 private void _glVertex(GL gl) { gl.glVertex3f(x, y, z); }
348 public String toString() { return "("+x+","+y+","+z+")"; }
349 // FIXME: moving a point alters its hashCode
350 public int hashCode() {
352 Float.floatToIntBits(x) ^
353 Float.floatToIntBits(y) ^
354 Float.floatToIntBits(z);
358 /** vector in 3-space */
359 public final class Vec {
360 public final float x, y, z;
361 public Vec(double x, double y, double z) { this((float)x, (float)y, (float)z); }
362 public Vec(float x, float y, float z) { this.x = x; this.y = y; this.z = z; }
363 public Vec(P p1, P p2) { this(p2.x-p1.x, p2.y-p1.y, p2.z-p1.z); }
364 public Vec cross(Vec v) { return new Vec(y*v.z-z*v.y, z*v.x-x*v.z, x*v.y-y*v.x); }
365 public Vec plus(Vec v) { return new Vec(x+v.x, y+v.y, z+v.z); }
366 public Vec norm() { return mag()==0 ? this : div(mag()); }
367 public Vec times(M m) { return m.apply(this); }
368 public float mag() { return (float)Math.sqrt(x*x+y*y+z*z); }
369 public float dot(Vec v) { return x*v.x + y*v.y + z*v.z; }
370 public Vec times(float mag) { return new Vec(x*mag, y*mag, z*mag); }
371 public Vec div(float mag) { return new Vec(x/mag, y/mag, z/mag); }
372 public String toString() { return "<"+x+","+y+","+z+">"; }
375 public class BindingGroup {
376 public HashSet<E> es = new HashSet<E>();
377 public BindingGroup() { }
378 public BindingGroup(E e) {
381 public void add(E e) {
382 if (e.bg != null) { merge(e.bg); return; }
386 public void merge(BindingGroup bg) {
394 /** [UNIQUE] an edge */
395 public final class E implements Comparable<E> {
397 public boolean intersects(T t) {
398 double A0=t.p1().p.x, A1=t.p1().p.y, A2=t.p1().p.z;
399 double B0=t.p2().p.x, B1=t.p2().p.y, B2=t.p2().p.z;
400 double C0=t.p3().p.x, C1=t.p3().p.y, C2=t.p3().p.z;
401 double j0=p1.p.x, j1=p1.p.y, j2=p1.p.z;
402 double k0=p2.p.x, k1=p2.p.y, k2=p2.p.z;
410 double R00, R01, R02, R03,
424 /* c = a × b */
425 c0 = a1 * b2 - a2 * b1;
426 c1 = a2 * b0 - a0 * b2;
427 c2 = a0 * b1 - a1 * b0;
429 /* M^(-1) = (1/det(M)) * adj(M) */
430 in_det = 1 / (c0 * c0 + c1 * c1 + c2 * c2);
431 R00 = (b1 * c2 - b2 * c1) * in_det;
432 R01 = (b2 * c0 - b0 * c2) * in_det;
433 R02 = (b0 * c1 - b1 * c0) * in_det;
434 R10 = (c1 * a2 - c2 * a1) * in_det;
435 R11 = (c2 * a0 - c0 * a2) * in_det;
436 R12 = (c0 * a1 - c1 * a0) * in_det;
442 R03 = -(R00 * A0 + R01 * A1 + R02 * A2);
443 R13 = -(R10 * A0 + R11 * A1 + R12 * A2);
444 R23 = -(R20 * A0 + R21 * A1 + R22 * A2);
446 /* fill in last row of 4x4 matrix */
450 J2 = R20 * j0 + R21 * j1 + R22 * j2 + R23;
451 K2 = R20 * k0 + R21 * k1 + R22 * k2 + R23;
452 if (J2 * K2 >= 0) return false;
454 J0 = R00 * j0 + R01 * j1 + R02 * j2 + R03;
455 K0 = R00 * k0 + R01 * k1 + R02 * k2 + R03;
456 i0 = J0 + J2 * ((K0 - J0) / (J2 - K2));
457 if (i0 < 0 || i0 > 1) return false;
459 J1 = R10 * j0 + R11 * j1 + R12 * j2 + R13;
460 K1 = R10 * k0 + R11 * k1 + R12 * k2 + R13;
461 i1 = J1 + J2 * ((K1 - J1) / (J2 - K2));
462 if (i1 < 0 || i1 > 1 || i0 + i1 > 1) return false;
467 public int compareTo(E e) {
468 return e.length() > length() ? 1 : -1;
471 public final V p1, p2;
472 T t; // triangle to our "left"
473 E prev; // previous half-edge
474 E next; // next half-edge
475 E pair; // partner half-edge
478 public BindingGroup bg = new BindingGroup(this);
480 public void bind(E e) { bind(e, new M()); }
481 public void bind(E e, M m) { e.bg.add(this); }
483 public void dobind() {
484 if (bg==null) return;
486 if (ex==this) continue;
492 boolean shattered = false;
493 public V shatter() { return shatter(midpoint().register(), null, null); }
494 public V shatter(V mid, BindingGroup bg1, BindingGroup bg2) {
495 if (shattered) return mid;
502 if (bg1==null) bg1 = new BindingGroup();
503 if (bg2==null) bg2 = new BindingGroup();
504 for(E e : bg.es) e.shatter(e.midpoint().register(), bg1, bg2);
510 bg1.add(p1.getE(mid));
511 bg2.add(mid.getE(p2));
515 public boolean destroyed = false;
516 public void destroy() {
517 if (destroyed) return;
519 pair.destroyed = true;
520 if (next.t != null) next.t.destroy();
521 if (prev.t != null) prev.t.destroy();
522 if (pair.next.t != null) ts.remove(pair.next.t);
523 if (pair.prev.t != null) ts.remove(pair.prev.t);
530 pair.prev.next = next;
531 next.prev = pair.prev;
532 prev.next = pair.next;
534 if (p1.e == this) p1.e = prev.next;
535 if (pair.p1.e == pair) pair.p1.e = pair.prev.next;
538 avgedge -= this.length();
539 avgedge -= pair.length();
544 private void sync() {
545 this.prev.next = this;
546 this.next.prev = this;
547 this.pair.pair = this;
548 if (this.next.p1 != p2) throw new Error();
549 if (this.prev.p2 != p1) throw new Error();
550 if (this.p1.e == null) this.p1.e = this;
558 private boolean added = false;
560 public T makeT() { return t==null ? (t = new T(this)) : t; }
562 /** angle between this half-edge and the next */
563 public double angle() {
564 Vec v1 = next.p2.p.minus(p2.p);
565 Vec v2 = this.p1.p.minus(p2.p);
566 return Math.acos(v1.norm().dot(v2.norm()));
569 public void makeAdjacent(E e) {
570 if (this.next == e) return;
571 if (p2 != e.p1) throw new Error("cannot make adjacent -- no shared vertex");
572 if (t != null || e.t != null) throw new Error("cannot make adjacent -- edges not both free");
574 E freeIncident = p2.getFreeIncident(e, this);
576 e.prev.next = freeIncident.next;
577 freeIncident.next.prev = e.prev;
579 freeIncident.next = this.next;
580 this.next.prev = freeIncident;
589 /** creates an isolated edge out in the middle of space */
590 public E(V p1, V p2) {
591 if (p1==p2) throw new Error("attempt to create edge with single vertex: " + p1);
594 this.prev = this.next = this.pair = new E(this, this, this);
598 /** adds a new half-edge from prev.p2 to p2 */
599 public E(E prev, V p2) {
603 if (p2.getE(p1) != null) throw new Error();
605 this.next = this.pair = new E(this, this, prev.next);
607 E q = p2.getFreeIncident();
609 this.next.prev = this;
611 this.prev.next = this;
612 this.pair = new E(q, this, z);
617 /** adds a new half-edge to the mesh with a given predecessor, successor, and pair */
618 public E(E prev, E pair, E next) {
626 public P midpoint() { return newP((p1.p.x+p2.p.x)/2, (p1.p.y+p2.p.y)/2, (p1.p.z+p2.p.z)/2); }
627 public boolean has(V v) { return v==p1 || v==p2; }
628 public float length() { return p1.p.minus(p2.p).mag(); }
629 public String toString() { return p1+"->"+p2; }
632 /** [UNIQUE] a triangle (face) */
633 public final class T {
635 public final int color;
637 public void destroy() {
641 public V nearest(P p) {
642 float d1 = p1().p.distance(p);
643 float d2 = p2().p.distance(p);
644 float d3 = p3().p.distance(p);
645 if (d1 < d2 && d1 < d3) return p1();
646 if (d2 < d3) return p2();
654 if (e1==e2 || e1==e3) throw new Error();
655 if (e3.next!=e1) throw new Error();
656 if (e1.t!=null || e2.t!=null || e3.t!=null)
657 throw new Error("non-manifold surface or disagreeing normals");
660 e1.next.next.t = this;
662 // FIXME: check for sealed/watertight surface once construction is complete (and infer normal(s)?)
664 int color = Math.abs(random.nextInt());
667 if (e1().pair.t != null && color == e1().pair.t.color) { color++; continue; }
668 if (e2().pair.t != null && color == e2().pair.t.color) { color++; continue; }
669 if (e3().pair.t != null && color == e3().pair.t.color) { color++; continue; }
681 public V p1() { return e1.p1; }
682 public V p2() { return e1.p2; }
683 public V p3() { return e1.next.p2; }
684 public E e1() { return e1; }
685 public E e2() { return e1.next; }
686 public E e3() { return e1.prev; }
687 public Vec norm() { return p2().p.minus(p1().p).cross(p3().p.minus(p1().p)).norm(); }
688 public boolean hasE(E e) { return e1==e || e1.next==e || e1.prev==e; }
689 public boolean has(V v) { return p1()==v || p2()==v || p3()==v; }
691 public float area() {
692 return (float)Math.abs(0.5 * e1().length() * new Vec(p1().p, p2().p).norm().dot(new Vec(p2().p, p3().p)));
695 public void glVertices(GL gl) {
701 public P centroid() { return newP((p1().p.x+p2().p.x+p3().p.x)/3,
702 (p1().p.y+p2().p.y+p3().p.y)/3,
703 (p1().p.z+p2().p.z+p3().p.z)/3); }
704 public float diameter() {
705 // FIXME: what is this supposed to be?
706 return Math.max(Math.max(e1().length(), e2().length()), e3().length()) / 2;
721 public final float a, b, c, d, e, f, g, h, i, j, k, l;
722 public M() { this(1); }
723 public M(float scale) {
725 l = h = d = e = b = i = c = j = g = 0;
727 public M(float scalex, float scaley, float scalez) {
731 l = h = d = e = b = i = c = j = g = 0;
733 public M(Vec translate) {
734 d = translate.x; h = translate.y; l = translate.z;
736 b = c = e = g = i = j = 0;
738 public M(float a, float b, float c, float d, float e, float f, float g, float h, float i, float j, float k, float l) {
739 this.a = a; this.b = b; this.c = c; this.d = d; this.e = e; this.f = f; this.g = g; this.h = h; this.i = i;
740 this.j = j; this.k = k; this.l = l;
742 public M times(float x) {
743 return new M(a*x, b*x, c*x, d*x, e*x, f*x, g*x, h*x, i*x, j*x, k*x, l*x);
745 public M(Vec axis, float angle) {
746 double q = Math.cos(angle);
747 double s = Math.sin(angle);
749 a = (float)(q + axis.x*axis.x*t);
750 f = (float)(q + axis.y*axis.y*t);
751 k = (float)(q + axis.z*axis.z*t);
752 double tmp1 = axis.x*axis.y*t;
753 double tmp2 = axis.z*s;
754 e = (float)(tmp1 + tmp2);
755 b = (float)(tmp1 - tmp2);
756 tmp1 = axis.x*axis.z*t;
758 i = (float)(tmp1 - tmp2);
759 c = (float)(tmp1 + tmp2);
760 tmp1 = axis.y*axis.z*t;
762 j = (float)(tmp1 + tmp2);
763 g = (float)(tmp1 - tmp2);
766 public P times(P p) {
767 return newP(a*p.x + b*p.y + c*p.z + d,
768 e*p.x + f*p.y + g*p.z + h,
769 i*p.x + j*p.y + k*p.z + l);
771 public P apply(P p) { return p; }
772 public Vec apply(Vec v) { return v; }
773 public M invert() { return this; }
774 public M times(M m) { return this; }
777 public void unbind() {
779 for(Geom.T t : this) {
787 for(Geom.T t : this) {
793 public int numedges = 0;
794 public float avgedge = 0;