public HashSet<E> es = new HashSet<E>();
public ArrayList<T> ts = new ArrayList<T>();
- public Iterator<T> iterator() { return ts.iterator(); }
+ public Iterator<T> iterator() {
+ if (es.size() == 0) return new FaceIterator();
+ return new FaceIterator(es.iterator().next().p1);
+ }
public Point origin() { return new Point(0, 0, 0); }
int num = 0;
double dist = 0;
HashSet<Vert> done = new HashSet<Vert>();
- for(T t : ts)
+ for(T t : this)
for(Vert p : new Vert[] { t.v1(), t.v2(), t.v3() }) {
if (done.contains(p)) continue;
done.add(p);
p.rescore();
}
- for(T t : ts)
+ for(T t : this)
for(Vert p : new Vert[] { t.v1(), t.v2(), t.v3() })
p.kdremove();
kd = new KDTree(3);
- for(T t : ts)
+ for(T t : this)
for(Vert p : new Vert[] { t.v1(), t.v2(), t.v3() })
p.kdinsert();
return (float)(dist/num);
public float volume() {
double total = 0;
- for(T t : ts) {
+ for(T t : this) {
double area = t.area();
Vec origin_to_centroid = new Vec(new Point(0, 0, 0), t.centroid());
boolean facingAway = t.norm().dot(origin_to_centroid) > 0;
return ret;
}
+
+ public class FaceIterator implements Iterator<T> {
+ private HashSet<T> visited = new HashSet<T>();
+ private LinkedList<T> next = new LinkedList<T>();
+ public FaceIterator() { }
+ public FaceIterator(Vert v) { next.addFirst(v.e.t); }
+ public boolean hasNext() { return next.peek()!=null; }
+ public void remove() { throw new Error(); }
+ public T next() {
+ T ret = next.removeFirst();
+ if (ret == null) return null;
+ visited.add(ret);
+ T t1 = ret.e1().pair.t;
+ T t2 = ret.e2().pair.t;
+ T t3 = ret.e3().pair.t;
+ if (t1 != null && !visited.contains(t1)) next.addFirst(t1);
+ if (t2 != null && !visited.contains(t2)) next.addFirst(t2);
+ if (t3 != null && !visited.contains(t3)) next.addFirst(t3);
+ return ret;
+ }
+ }
+
/** [UNIQUE] a triangle (face) */
public final class T extends Triangle {
public final E e1;
this.e1 = e1;
E e2 = e1.next;
E e3 = e2.next;
- if (e1==e2 || e1==e3) throw new Error();
+ if (e1==e2 || e1==e3) throw new Error();
if (e3.next!=e1) throw new Error();
- if (e1.t!=null || e2.t!=null || e3.t!=null)
- throw new Error("non-manifold surface or disagreeing normals");
+ if (e1.t!=null || e2.t!=null || e3.t!=null) throw new Error("non-manifold surface or disagreeing normals");
e1.t = this;
e1.next.t = this;
e1.next.next.t = this;
if (e3().pair.t != null && color == e3().pair.t.color) { color++; continue; }
break;
}
+ this.color = color;
- // FIXME unnecssary
+ // FIXME unnecssary?
ts.add(this);
v1().kdinsert();
v2().kdinsert();
v3().kdinsert();
-
- this.color = color;
}
public E e1() { return e1; }
public E e2() { return e1.next; }