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 transform(Matrix m) {
50 ArrayList<Vertex> set = new ArrayList<Vertex>();
51 for(Vertex v : vertices) set.add(v);
52 for(Vertex v : set) v.transform(m);
55 public void rebuild() { /*vertices.rebuild();*/ }
56 public Vec diagonal() { return vertices.diagonal(); }
57 public Point centroid() { return vertices.centroid(); }
58 public Vertex nearest(Point p) { return vertices.nearest(p); }
60 /** compute the volume of the mesh */
61 public float volume() {
64 double area = t.area();
65 Vec origin_to_centroid = new Vec(new Point(0, 0, 0), t.centroid());
66 boolean facingAway = t.norm().dot(origin_to_centroid) > 0;
67 double height = Math.abs(t.norm().dot(origin_to_centroid));
68 total += ((facingAway ? 1 : -1) * area * height) / 3.0;
74 // Vertexices //////////////////////////////////////////////////////////////////////////////
76 /** a vertex in the mesh */
77 public final class Vertex extends HasQuadric implements Visitor<T> {
78 public String toString() { return p.toString(); }
80 E e; // some edge *leaving* this point
82 Matrix binding = Matrix.ONE;
83 Vertex bound_to = this;
85 public Point getPoint() { return p; }
86 public float score() { return oldscore; }
88 private Vertex(Point p) {
90 if (vertices.get(p) != null) throw new Error();
94 private void glNormal(GL gl) {
96 gl.glNormal3f(norm.x, norm.y, norm.z);
99 public void _recomputeFundamentalQuadric() {
100 Matrix m = Matrix.ZERO;
102 for(E e = this.e; e!=null; e=e.pair.next==this.e?null:e.pair.next) {
104 m = m.plus(t.norm().fundamentalQuadric(t.centroid()));
107 quadricStale = false;
108 fundamentalQuadric = m.times(1/(float)count);
111 public void applyQuadricToNeighbor() {
112 if (score_against == null) return;
114 Vertex new_nearest = score_against.nearest(p);
115 if (nearest_in_other_mesh != null && new_nearest == nearest_in_other_mesh) return;
117 if (nearest_in_other_mesh != null) unApplyQuadricToNeighbor();
118 if (nearest_in_other_mesh != null) throw new Error();
120 nearest_in_other_mesh = new_nearest;
122 // don't attract to vertices that face the other way
124 if (((Vertex)nearest_in_other_mesh).e == null || ((Vertex)nearest_in_other_mesh).norm().dot(norm()) < 0) {
125 nearest_in_other_mesh = null;
128 nearest_in_other_mesh.unComputeError();
129 nearest_in_other_mesh.quadric = nearest_in_other_mesh.quadric.plus(fundamentalQuadric());
130 nearest_in_other_mesh.quadric_count++;
131 nearest_in_other_mesh.computeError();
138 public void reComputeErrorAround() {
140 if (nearest_in_other_mesh != null) nearest_in_other_mesh.reComputeError();
141 for(E e = this.e; e!=null; e=e.pair.next==this.e?null:e.pair.next)
142 e.p2.reComputeError();
144 public void reComputeError() {
148 public void unComputeError() {
152 public HasQuadric nearest() { return score_against.nearest(p); }
153 public void computeError() {
156 ? (quadric.preAndPostMultiply(p) * 100) / quadric_count
159 : nearest_in_other_mesh != null
160 ? nearest_in_other_mesh.fundamentalQuadric().preAndPostMultiply(p) * 100 * 10
161 : score_against != null
162 ? score_against.nearest(p).fundamentalQuadric().preAndPostMultiply(p) * 100 * 10
164 for(E e = this.e; e!=null; e=e.pair.next==this.e?null:e.pair.next) {
165 double ang = Math.abs(e.crossAngle());
166 if (ang > Math.PI) throw new Error();
167 float minangle = (float)(Math.PI * 0.8);
169 oldscore += (ang - minangle);
174 private void removeTrianglesFromRTree() {
175 for(E e = this.e; e!=null; e=e.pair.next==this.e?null:e.pair.next)
176 if (e.t != null) e.t.removeFromRTree();
178 private void addTrianglesToRTree() {
179 for(E e = this.e; e!=null; e=e.pair.next==this.e?null:e.pair.next)
180 if (e.t != null) e.t.addToRTree();
183 /** does NOT update bound pairs! */
184 public boolean transform(Matrix m) {
185 if (immutableVertices) throw new Error();
187 unApplyQuadricToNeighbor();
190 if (vertices.get(this.p)==null) throw new Error();
191 vertices.remove(this);
192 removeTrianglesFromRTree();
193 float newx = m.a*p.x + m.b*p.y + m.c*p.z + m.d;
194 float newy = m.e*p.x + m.f*p.y + m.g*p.z + m.h;
195 float newz = m.i*p.x + m.j*p.y + m.k*p.z + m.l;
196 this.p = new Point(newx, newy, newz);
197 addTrianglesToRTree();
200 applyQuadricToNeighbor();
204 for(E e = this.e; e!=null; e=e.pair.next==this.e?null:e.pair.next) {
205 if (Math.abs(e.crossAngle()) > (Math.PI * 0.9) || Math.abs(e.next.crossAngle()) > (Math.PI * 0.9)) good = false;
206 if (e.t.aspect() < 0.1) good = false;
207 e.p2.quadricStale = true;
210 if (!ignorecollision && good) triangles.range(oldp, this.p, (Visitor<T>)this);
212 reComputeErrorAround();
216 public void visit(T t) {
218 for(E e = Vertex.this.e; e!=null; e=e.pair.next==Vertex.this.e?null:e.pair.next) {
219 if (!t.has(e.p1) && !t.has(e.p2) && e.intersects(t)) { good = false; }
221 if (!e.t.has(t.e1().p1) && !e.t.has(t.e1().p2) && t.e1().intersects(e.t)) { good = false; }
222 if (!e.t.has(t.e2().p1) && !e.t.has(t.e2().p2) && t.e2().intersects(e.t)) { good = false; }
223 if (!e.t.has(t.e3().p1) && !e.t.has(t.e3().p2) && t.e3().intersects(e.t)) { good = false; }
227 private boolean good;
229 public boolean move(Vec v) {
230 Matrix m = Matrix.translate(v);
234 good &= p.transform(m);
240 public E getFreeIncident() {
241 E ret = getFreeIncident(e, e);
242 if (ret != null) return ret;
243 for(E e = this.e; e!=null; e=e.pair.next==this.e?null:e.pair.next)
244 System.out.println(e + " " + e.t);
245 throw new Error("unable to find free incident to " + this);
248 public E getFreeIncident(E start, E before) {
249 for(E e = start; e!=null; e=e.pair.next==before?null:e.pair.next)
250 if (e.pair.p2 == this && e.pair.t == null && e.pair.next.t == null)
255 public E getE(Point p2) {
256 Vertex v = vertices.get(p2);
257 if (v==null) return null;
260 public E getE(Vertex p2) {
261 for(E e = this.e; e!=null; e=e.pair.next==this.e?null:e.pair.next)
262 if (e.p1 == this && e.p2 == p2) return e;
267 Vec norm = new Vec(0, 0, 0);
268 for(E e = this.e; e!=null; e=e.pair.next==this.e?null:e.pair.next)
270 norm = norm.plus(e.t.norm().times((float)e.prev.angle()));
274 public boolean isBoundTo(Vertex p) {
275 for(Vertex px = p; px!=null; px=(px.bound_to==p?null:px.bound_to))
281 public void unbind() { bound_to = this; binding = Matrix.ONE; }
282 public void bind(Vertex p) { bind(p, Matrix.ONE); }
283 public void bind(Vertex p, Matrix binding) {
284 if (isBoundTo(p)) return;
285 Vertex temp_bound_to = p.bound_to;
286 Matrix temp_binding = p.binding;
287 p.bound_to = this.bound_to;
288 p.binding = binding.times(this.binding); // FIXME: may have order wrong here
289 this.bound_to = temp_bound_to;
290 this.binding = temp_binding.times(temp_binding); // FIXME: may have order wrong here
294 public class BindingGroup {
295 private HashSet<E> set = new HashSet<E>();
296 public BindingGroup bind_others;
297 public BindingGroup other() { return bind_others; }
298 public BindingGroup(BindingGroup bind_others) { this.bind_others = bind_others; }
299 public BindingGroup() { this.bind_others = new BindingGroup(this); }
300 public BindingGroup(E e) { this(); set.add(e); }
301 public void add(E e) {
302 if (set.contains(e)) return;
304 BindingGroup e_bind_peers = e.bind_peers;
305 BindingGroup e_bind_to = e.bind_to;
307 e.bind_to = bind_others;
308 for (E epeer : e_bind_peers.set) add(epeer);
309 for (E eother : e_bind_to.set) bind_others.add(eother);
311 for(E eother : bind_others.set) {
312 if (e.next.bind_to.set.contains(eother.prev)) {
313 e.next.next.bindEdge(eother.prev.prev);
315 if (e.prev.bind_to.set.contains(eother.next)) {
316 e.prev.prev.bindEdge(eother.next.next);
321 public void dobind(E e) {
322 for(E ebound : set) {
323 e.p1.bind(ebound.p2);
324 e.p2.bind(ebound.p1);
327 public void shatter(BindingGroup bg1, BindingGroup bg2) {
329 e.shatter(e.midpoint(), bg1, bg2);
334 /** [UNIQUE] an edge */
335 public final class E implements Comparable<E> {
337 public final Vertex p1, p2;
338 T t; // triangle to our "left"
339 E prev; // previous half-edge
340 E next; // next half-edge
341 E pair; // partner half-edge
342 public BindingGroup bind_peers = new BindingGroup(this);
343 public BindingGroup bind_to = bind_peers.other();
344 boolean shattered = false;
346 public boolean intersects(T t) { return t.intersects(p1.p, p2.p); }
347 public float comparator() {
348 Vertex nearest = score_against.nearest(midpoint());
349 return (float)Math.max(length(), midpoint().distance(nearest.p));
351 public int compareTo(E e) {
352 return e.comparator() > comparator() ? 1 : -1;
354 public void bindEdge(E e) { bind_to.add(e); }
355 public void dobind() { bind_to.dobind(this); }
357 public Point shatter() { return shatter(midpoint(), null, null); }
358 public Point shatter(Point mid, BindingGroup bg1, BindingGroup bg2) {
359 if (shattered || destroyed) return mid;
366 int old_colorclass = t==null ? 0 : t.colorclass;
367 if (bg1==null) bg1 = new BindingGroup();
368 if (bg2==null) bg2 = new BindingGroup();
369 BindingGroup old_bind_to = bind_to;
370 bind_peers.shatter(bg1, bg2);
371 old_bind_to.shatter(bg2.other(), bg1.other());
375 newT(r.p, p1.p, mid, null, old_colorclass);
376 newT(r.p, mid, p2.p, null, old_colorclass);
377 bg1.add(p1.getE(mid));
378 bg2.add(p2.getE(mid).pair);
382 public boolean destroyed = false;
383 public void destroy() {
384 if (destroyed) return;
386 pair.destroyed = true;
388 if (t != null) t.destroy();
391 if (pair.t != null) pair.t.destroy();
394 if (next.t != null) next.t.destroy();
395 if (prev.t != null) prev.t.destroy();
399 if (pair.next.t != null) pair.next.t.destroy();
400 if (pair.prev.t != null) pair.next.t.destroy();
406 this.bind_peers = null;
407 pair.bind_peers = null;
408 pair.prev.next = next;
409 next.prev = pair.prev;
410 prev.next = pair.next;
412 if (p1.e == this) p1.e = prev.next;
413 if (pair.p1.e == pair) pair.p1.e = pair.prev.next;
416 private void sync() {
417 this.prev.next = this;
418 this.next.prev = this;
419 this.pair.pair = this;
420 bind_peers.add(this);
421 if (this.next.p1 != p2) throw new Error();
422 if (this.prev.p2 != p1) throw new Error();
423 if (this.p1.e == null) this.p1.e = this;
424 if (!added) added = true;
426 private boolean added = false;
428 public T makeT(int colorclass) { return t==null ? (t = new T(this, colorclass)) : t; }
430 public double crossAngle() {
431 Vec v1 = t.norm().times(-1);
432 Vec v2 = pair.t.norm().times(-1);
433 return Math.acos(v1.norm().dot(v2.norm()));
436 /** angle between this half-edge and the next */
437 public double angle() {
438 Vec v1 = next.p2.p.minus(p2.p);
439 Vec v2 = this.p1.p.minus(p2.p);
440 return Math.acos(v1.norm().dot(v2.norm()));
443 public void makeAdjacent(E e) {
444 if (this.next == e) return;
445 if (p2 != e.p1) throw new Error("cannot make adjacent -- no shared vertex");
446 if (t != null || e.t != null) throw new Error("cannot make adjacent -- edges not both free");
448 E freeIncident = p2.getFreeIncident(e, this);
450 e.prev.next = freeIncident.next;
451 freeIncident.next.prev = e.prev;
453 freeIncident.next = this.next;
454 this.next.prev = freeIncident;
463 /** creates an isolated edge out in the middle of space */
464 public E(Point p1, Point p2) {
465 if (vertices.get(p1) != null) throw new Error();
466 if (vertices.get(p2) != null) throw new Error();
467 this.p1 = new Vertex(p1);
468 this.p2 = new Vertex(p2);
469 this.prev = this.next = this.pair = new E(this, this, this);
471 this.p2.e = this.pair;
475 /** adds a new half-edge from prev.p2 to p2 */
476 public E(E prev, Point p) {
478 p2 = vertices.get(p);
479 if (p2 == null) p2 = new Vertex(p);
483 if (p2.getE(p1) != null) throw new Error();
485 this.next = this.pair = new E(this, this, prev.next);
487 E q = p2.getFreeIncident();
489 this.next.prev = this;
491 this.prev.next = this;
492 this.pair = new E(q, this, z);
494 if (p2.e==null) p2.e = this.pair;
498 /** adds a new half-edge to the mesh with a given predecessor, successor, and pair */
499 public E(E prev, E pair, E next) {
507 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); }
508 public boolean has(Vertex v) { return v==p1 || v==p2; }
509 public float length() { return p1.p.minus(p2.p).mag(); }
510 public String toString() { return p1+"->"+p2; }
514 public E makeE(Point p1, Point p2) {
515 Vertex v1 = vertices.get(p1);
516 Vertex v2 = vertices.get(p2);
517 if (v1 != null && v2 != null) {
519 if (e != null) return e;
521 if (e != null) return e;
523 if (v1 != null) return new E(v1.getFreeIncident(), p2);
524 if (v2 != null) return new E(v2.getFreeIncident(), p1).pair;
525 return new E(p1, p2);
527 public T newT(Point p1, Point p2, Point p3, Vec norm, int colorclass) {
529 Vec norm2 = p3.minus(p1).cross(p2.minus(p1));
530 float dot = norm.dot(norm2);
531 //if (Math.abs(dot) < EPointSILON) throw new Error("dot products within evertsilon of each other: "+norm+" "+norm2);
532 if (dot < 0) { Point p = p1; p1=p2; p2 = p; }
534 E e12 = makeE(p1, p2);
535 E e23 = makeE(p2, p3);
536 E e31 = makeE(p3, p1);
537 while(e12.next != e23 || e23.next != e31 || e31.next != e12) {
538 e12.makeAdjacent(e23);
539 e23.makeAdjacent(e31);
540 e31.makeAdjacent(e12);
542 T ret = e12.makeT(colorclass);
543 if (e12.t == null) throw new Error();
544 if (e23.t == null) throw new Error();
545 if (e31.t == null) throw new Error();
550 /** [UNIQUE] a triangle (face) */
551 public final class T extends Triangle {
553 public final int color;
554 public final int colorclass;
556 public void removeFromRTree() { triangles.remove(this); }
557 public void addToRTree() { triangles.insert(this); }
559 public void destroy() { triangles.remove(this); }
561 T(E e1, int colorclass) {
565 if (e1==e2 || e1==e3) throw new Error();
566 if (e3.next!=e1) throw new Error();
567 if (e1.t!=null || e2.t!=null || e3.t!=null) throw new Error("non-manifold surface or disagreeing normals");
570 e1.next.next.t = this;
572 // FIXME: check for sealed/watertight surface once construction is complete (and infer normal(s)?)
574 int color = Math.abs(random.nextInt());
577 if (e1().pair.t != null && color == e1().pair.t.color) { color++; continue; }
578 if (e2().pair.t != null && color == e2().pair.t.color) { color++; continue; }
579 if (e3().pair.t != null && color == e3().pair.t.color) { color++; continue; }
583 this.colorclass = colorclass;
586 public E e1() { return e1; }
587 public E e2() { return e1.next; }
588 public E e3() { return e1.prev; }
589 public Vertex v1() { return e1.p1; }
590 public Vertex v2() { return e1.p2; }
591 public Vertex v3() { return e1.next.p2; }
592 public Point p1() { return e1.p1.p; }
593 public Point p2() { return e1.p2.p; }
594 public Point p3() { return e1.next.p2.p; }
595 public boolean hasE(E e) { return e1==e || e1.next==e || e1.prev==e; }
596 public boolean has(Vertex v) { return v1()==v || v2()==v || v3()==v; }
598 public boolean shouldBeDrawn() {
599 if (e1().bind_to.set.size() == 0) return false;
600 if (e2().bind_to.set.size() == 0) return false;
601 if (e3().bind_to.set.size() == 0) return false;