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;
11 import com.infomatiq.jsi.IntProcedure;
13 public class Mesh implements Iterable<Mesh.T> {
15 public static final float EPSILON = (float)0.0001;
16 public static final Random random = new Random();
18 private RTree<T> triangles = new RTree<T>();
19 private PointSet<Vertex> vertices = new PointSet<Vertex>();
21 public boolean immutableVertices;
22 public Mesh error_against = null;
23 public double error = 0;
25 public Mesh(boolean immutableVertices) { this.immutableVertices = immutableVertices; }
27 public void makeVerticesImmutable() { this.immutableVertices = true; }
28 public float error() { return (float)error; }
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.times(v.p), true);
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 {
78 public Point p, oldp, goodp;
79 E e; // some edge *leaving* this point
81 private boolean illegal = false;
83 public Point getPoint() { return p; }
84 public float error() { return olderror; }
86 private Vertex(Point p) {
89 if (vertices.get(p) != null) throw new Error();
93 public void reinsert() {
94 vertices.remove(this);
96 for(E e = this.e; e!=null; e=e.pair.next==this.e?null:e.pair.next) e.t.reinsert();
99 public float olderror = 0;
100 public void setError(float nerror) {
106 public float averageTriangleArea() {
109 for(E e = this.e; e!=null; e=e.pair.next==this.e?null:e.pair.next) {
115 public float averageEdgeLength() {
118 for(E e = this.e; e!=null; e=e.pair.next==this.e?null:e.pair.next) {
125 public Matrix _recomputeFundamentalQuadric() {
126 Matrix m = Matrix.ZERO;
128 for(E e = this.e; e!=null; e=e.pair.next==this.e?null:e.pair.next) {
129 m = m.plus(e.t.norm().fundamentalQuadric(e.t.centroid()));
132 return m.times(1/(float)count);
135 public HasQuadric nearest() { return error_against==null ? null : error_against.vertices.nearest(p, this); }
136 public void computeError() {
137 if (error_against==null) return;
139 nearest_in_other_mesh != null
140 ? nearest_in_other_mesh.fundamentalQuadric().preAndPostMultiply(p)
141 : nearest().fundamentalQuadric().preAndPostMultiply(p);
142 if (quadric_count != 0)
143 nerror = (nerror + quadric.preAndPostMultiply(p))/(quadric_count+1);
145 for(E e = this.e; e!=null; e=e.pair.next==this.e?null:e.pair.next) {
146 double ang = Math.abs(e.dihedralAngle());
147 if (ang > Math.PI) throw new Error();
148 float minangle = (float)(Math.PI * 0.8);
149 if (ang > minangle) nerror += (ang - minangle);
151 if (e.t.aspect() < 0.2) {
152 nerror += (0.2-e.t.aspect()) * 10;
160 public boolean move(Matrix m, boolean ignoreProblems) {
163 for(Vertex p : (Iterable<Vertex>)getBoundPeers())
164 good &= p.transform(m.times(p.p), ignoreProblems);
166 for(Vertex p : (Iterable<Vertex>)getBoundPeers())
167 if (good || ignoreProblems) p.reComputeErrorAround();
168 else p.transform(p.oldp, true);
173 /** does NOT update bound pairs! */
174 private boolean transform(Point newp, boolean ignoreProblems) {
176 if (immutableVertices) throw new Error();
178 unApplyQuadricToNeighbor();
181 applyQuadricToNeighbor();
183 if (!ignoreProblems) {
187 for(E e = this.e; e!=null; e=e.pair.next==this.e?null:e.pair.next) e.p2.quadricStale = true;
191 public void checkLegality() {
193 for(E e = this.e; e!=null; e=e.pair.next==this.e?null:e.pair.next) {
194 if (Math.abs(e.dihedralAngle()) > (Math.PI * 0.9) ||
195 Math.abs(e.next.dihedralAngle()) > (Math.PI * 0.9)) illegal = true;
196 if (e.t.aspect() < 0.1) illegal = true;
199 if (!illegal) triangles.range(oldp, this.p, (Visitor<T>)this);
202 public void reComputeErrorAround() {
204 if (nearest_in_other_mesh != null)
205 nearest_in_other_mesh.reComputeError();
206 for(E e = this.e; e!=null; e=e.pair.next==this.e?null:e.pair.next)
207 e.p2.reComputeError();
210 public boolean visit(Object o) {
211 if (o instanceof Vertex)
212 return ((Vertex)o).e != null && ((Vertex)o).norm().dot(Vertex.this.norm()) >= 0;
214 if (illegal) return false;
215 for(E e = Vertex.this.e; e!=null; e=e.pair.next==Vertex.this.e?null:e.pair.next) {
216 if (!t.has(e.p1) && !t.has(e.p2) && e.intersects(t)) { illegal = true; }
218 if (!e.t.has(t.e1().p1) && !e.t.has(t.e1().p2) && t.e1().intersects(e.t)) { illegal = true; }
219 if (!e.t.has(t.e2().p1) && !e.t.has(t.e2().p2) && t.e2().intersects(e.t)) { illegal = true; }
220 if (!e.t.has(t.e3().p1) && !e.t.has(t.e3().p2) && t.e3().intersects(e.t)) { illegal = true; }
226 public E getFreeIncident() {
227 E ret = getFreeIncident(e, e);
228 if (ret != null) return ret;
229 for(E e = this.e; e!=null; e=e.pair.next==this.e?null:e.pair.next)
230 System.out.println(e + " " + e.t);
231 throw new Error("unable to find free incident to " + this);
234 public E getFreeIncident(E start, E before) {
235 for(E e = start; e!=null; e=e.pair.next==before?null:e.pair.next)
236 if (e.pair.p2 == this && e.pair.t == null && e.pair.next.t == null)
241 public E getE(Point p2) {
242 Vertex v = vertices.get(p2);
243 if (v==null) return null;
246 public E getE(Vertex p2) {
247 for(E e = this.e; e!=null; e=e.pair.next==this.e?null:e.pair.next)
248 if (e.p1 == this && e.p2 == p2) return e;
252 private void glNormal(GL gl) {
254 gl.glNormal3f(norm.x, norm.y, norm.z);
257 Vec norm = new Vec(0, 0, 0);
258 for(E e = this.e; e!=null; e=e.pair.next==this.e?null:e.pair.next)
260 norm = norm.plus(e.t.norm().times((float)e.prev.angle()));
264 public void bindTo(Vertex p) { bindTo(Matrix.ONE, p); }
267 public class BindingGroup {
268 private HashSet<E> set = new HashSet<E>();
269 public BindingGroup bind_others;
270 public BindingGroup other() { return bind_others; }
271 public BindingGroup(BindingGroup bind_others) { this.bind_others = bind_others; }
272 public BindingGroup() { this.bind_others = new BindingGroup(this); }
273 public BindingGroup(E e) { this(); set.add(e); }
274 public void add(E e) {
275 if (set.contains(e)) return;
277 BindingGroup e_bind_peers = e.bind_peers;
278 BindingGroup e_bind_to = e.bind_to;
280 e.bind_to = bind_others;
281 for (E epeer : e_bind_peers.set) add(epeer);
282 for (E eother : e_bind_to.set) bind_others.add(eother);
284 for(E eother : bind_others.set) {
285 if (e.next.bind_to.set.contains(eother.prev)) {
286 e.next.next.bindEdge(eother.prev.prev);
288 if (e.prev.bind_to.set.contains(eother.next)) {
289 e.prev.prev.bindEdge(eother.next.next);
294 public void dobind(E e) {
295 for(E ebound : set) {
296 e.p1.bindTo(Matrix.ONE, ebound.p2);
297 e.p2.bindTo(Matrix.ONE, ebound.p1);
300 public void shatter(BindingGroup bg1, BindingGroup bg2, boolean triangles) {
302 e.shatter(e.midpoint(), bg1, bg2, triangles);
307 /** [UNIQUE] an edge */
308 public final class E implements Comparable<E> {
310 public final Vertex p1, p2;
311 T t; // triangle to our "left"
312 E prev; // previous half-edge
313 E next; // next half-edge
314 E pair; // partner half-edge
315 public BindingGroup bind_peers = new BindingGroup(this);
316 public BindingGroup bind_to = bind_peers.other();
317 boolean shattered = false;
319 public boolean intersects(T t) { return t.intersects(p1.p, p2.p); }
321 public float stretchRatio() {
322 Vertex nearest = error_against.nearest(midpoint());
323 float nearest_distance = midpoint().distance(nearest.p);
324 float other_distance =
325 (p1.p.distance(error_against.nearest(p1.p).p)+
326 p2.p.distance(error_against.nearest(p2.p).p))/2;
327 return nearest_distance/other_distance;
329 public float comparator() {
333 //return t==null?0:(1/t.aspect());
335 public int compareTo(E e) {
336 return e.comparator() > comparator() ? 1 : -1;
338 public void bindEdge(E e) { bind_to.add(e); }
339 public void dobind() { bind_to.dobind(this); }
341 public Point shatter() { return shatter(true); }
342 public Point shatter(boolean triangles) { return shatter(midpoint(), null, null, triangles); }
343 public Point shatter(Point mid, BindingGroup bg1, BindingGroup bg2, boolean triangles) {
344 return shatter(mid, bg1, bg2, triangles, false);
346 public Point shatter(Point mid, BindingGroup bg1, BindingGroup bg2, boolean triangles, boolean leader) {
347 if (shattered || destroyed) return mid;
354 int old_colorclass = t==null ? 0 : t.colorclass;
355 if (bg1==null) bg1 = new BindingGroup();
356 if (bg2==null) bg2 = new BindingGroup();
357 BindingGroup old_bind_to = bind_to;
358 bind_peers.shatter(bg1, bg2, triangles);
359 old_bind_to.shatter(bg2.other(), bg1.other(), triangles);
368 newT(r.p, p1.p, mid, null, old_colorclass);
369 newT(r.p, mid, p2.p, null, old_colorclass);
370 bg1.add(p1.getE(mid));
371 bg2.add(p2.getE(mid).pair);
372 if (leader) p1.getE(mid).shatter();
377 public boolean destroyed = false;
378 public void destroy() {
379 if (destroyed) return;
381 pair.destroyed = true;
383 if (t != null) t.destroy();
386 if (pair.t != null) pair.t.destroy();
389 if (next.t != null) next.t.destroy();
390 if (prev.t != null) prev.t.destroy();
394 if (pair.next.t != null) pair.next.t.destroy();
395 if (pair.prev.t != null) pair.next.t.destroy();
401 this.bind_peers = null;
402 pair.bind_peers = null;
403 pair.prev.next = next;
404 next.prev = pair.prev;
405 prev.next = pair.next;
407 if (p1.e == this) p1.e = prev.next;
408 if (pair.p1.e == pair) pair.p1.e = pair.prev.next;
411 private void sync() {
412 this.prev.next = this;
413 this.next.prev = this;
414 this.pair.pair = this;
415 bind_peers.add(this);
416 if (this.next.p1 != p2) throw new Error();
417 if (this.prev.p2 != p1) throw new Error();
418 if (this.p1.e == null) this.p1.e = this;
419 if (!added) added = true;
421 private boolean added = false;
423 public T makeT(int colorclass) { return t==null ? (t = new T(this, colorclass)) : t; }
425 public double dihedralAngle() {
426 Vec v1 = t.norm().times(-1);
427 Vec v2 = pair.t.norm().times(-1);
428 return Math.acos(v1.norm().dot(v2.norm()));
431 /** angle between this half-edge and the next */
432 public double angle() {
433 Vec v1 = next.p2.p.minus(p2.p);
434 Vec v2 = this.p1.p.minus(p2.p);
435 return Math.acos(v1.norm().dot(v2.norm()));
438 public void makeAdjacent(E e) {
439 if (this.next == e) return;
440 if (p2 != e.p1) throw new Error("cannot make adjacent -- no shared vertex");
441 if (t != null || e.t != null) throw new Error("cannot make adjacent -- edges not both free");
443 E freeIncident = p2.getFreeIncident(e, this);
445 e.prev.next = freeIncident.next;
446 freeIncident.next.prev = e.prev;
448 freeIncident.next = this.next;
449 this.next.prev = freeIncident;
458 /** creates an isolated edge out in the middle of space */
459 public E(Point p1, Point p2) {
460 if (vertices.get(p1) != null) throw new Error();
461 if (vertices.get(p2) != null) throw new Error();
462 this.p1 = new Vertex(p1);
463 this.p2 = new Vertex(p2);
464 this.prev = this.next = this.pair = new E(this, this, this);
466 this.p2.e = this.pair;
470 /** adds a new half-edge from prev.p2 to p2 */
471 public E(E prev, Point p) {
473 p2 = vertices.get(p);
474 if (p2 == null) p2 = new Vertex(p);
478 if (p2.getE(p1) != null) throw new Error();
480 this.next = this.pair = new E(this, this, prev.next);
482 E q = p2.getFreeIncident();
484 this.next.prev = this;
486 this.prev.next = this;
487 this.pair = new E(q, this, z);
489 if (p2.e==null) p2.e = this.pair;
493 /** adds a new half-edge to the mesh with a given predecessor, successor, and pair */
494 public E(E prev, E pair, E next) {
502 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); }
503 public boolean has(Vertex v) { return v==p1 || v==p2; }
504 public float length() { return p1.p.minus(p2.p).mag(); }
505 public String toString() { return p1+"->"+p2; }
509 public E makeE(Point p1, Point p2) {
510 Vertex v1 = vertices.get(p1);
511 Vertex v2 = vertices.get(p2);
512 if (v1 != null && v2 != null) {
514 if (e != null) return e;
516 if (e != null) return e;
518 if (v1 != null) return new E(v1.getFreeIncident(), p2);
519 if (v2 != null) return new E(v2.getFreeIncident(), p1).pair;
520 return new E(p1, p2);
522 public T newT(Point p1, Point p2, Point p3, Vec norm, int colorclass) {
524 Vec norm2 = p3.minus(p1).cross(p2.minus(p1));
525 float dot = norm.dot(norm2);
526 //if (Math.abs(dot) < EPointSILON) throw new Error("dot products within evertsilon of each other: "+norm+" "+norm2);
527 if (dot < 0) { Point p = p1; p1=p2; p2 = p; }
529 E e12 = makeE(p1, p2);
530 E e23 = makeE(p2, p3);
531 E e31 = makeE(p3, p1);
532 while(e12.next != e23 || e23.next != e31 || e31.next != e12) {
533 e12.makeAdjacent(e23);
534 e23.makeAdjacent(e31);
535 e31.makeAdjacent(e12);
537 T ret = e12.makeT(colorclass);
538 if (e12.t == null) throw new Error();
539 if (e23.t == null) throw new Error();
540 if (e31.t == null) throw new Error();
544 /** [UNIQUE] a triangle (face) */
545 public final class T extends Triangle {
547 public final int color;
548 public final int colorclass;
550 T(E e1, int colorclass) {
554 if (e1==e2 || e1==e3) throw new Error();
555 if (e3.next!=e1) throw new Error();
556 if (e1.t!=null || e2.t!=null || e3.t!=null) throw new Error("non-manifold surface or disagreeing normals");
559 e1.next.next.t = this;
561 // FIXME: check for sealed/watertight surface once construction is complete (and infer normal(s)?)
563 int color = Math.abs(random.nextInt());
566 if (e1().pair.t != null && color == e1().pair.t.color) { color++; continue; }
567 if (e2().pair.t != null && color == e2().pair.t.color) { color++; continue; }
568 if (e3().pair.t != null && color == e3().pair.t.color) { color++; continue; }
572 this.colorclass = colorclass;
575 public E e1() { return e1; }
576 public E e2() { return e1.next; }
577 public E e3() { return e1.prev; }
578 public Vertex v1() { return e1.p1; }
579 public Vertex v2() { return e1.p2; }
580 public Vertex v3() { return e1.next.p2; }
581 public Point p1() { return e1.p1.p; }
582 public Point p2() { return e1.p2.p; }
583 public Point p3() { return e1.next.p2.p; }
584 public boolean hasE(E e) { return e1==e || e1.next==e || e1.prev==e; }
585 public boolean has(Vertex v) { return v1()==v || v2()==v || v3()==v; }
587 public void removeFromRTree() { triangles.remove(this); }
588 public void addToRTree() { triangles.insert(this); }
589 public void destroy() { triangles.remove(this); }
590 public void reinsert() { triangles.remove(this); triangles.add(this); }
592 public boolean shouldBeDrawn() {
593 if (e1().bind_to==null) return false;
594 if (e2().bind_to==null) return false;
595 if (e3().bind_to==null) return false;
596 if (e1().bind_to.set.size() == 0) return false;
597 if (e2().bind_to.set.size() == 0) return false;
598 if (e3().bind_to.set.size() == 0) return false;
602 /** issue gl.glVertex() for each of the triangle's points */
603 public void glVertices(GL gl) {
604 if (!shouldBeDrawn()) return;
606 Point p1 = v1().goodp;
607 Point p2 = v2().goodp;
608 Point p3 = v3().goodp;