+ public T newT(Vert p1, Vert p2, Vert p3, Vec norm) {
+ if (norm != null) {
+ Vec norm2 = p3.p.minus(p1.p).cross(p2.p.minus(p1.p));
+ float dot = norm.dot(norm2);
+ //if (Math.abs(dot) < EPointSILON) throw new Error("dot products within evertsilon of each other: "+norm+" "+norm2);
+ if (dot < 0) { Vert p = p1; p1=p2; p2 = p; }
+ }
+ E e12 = p1.makeE(p2);
+ E e23 = p2.makeE(p3);
+ E e31 = p3.makeE(p1);
+ while(e12.next != e23 || e23.next != e31 || e31.next != e12) {
+ e12.makeAdjacent(e23);
+ e23.makeAdjacent(e31);
+ e31.makeAdjacent(e12);
+ }
+ T ret = e12.makeT();
+ if (e12.t == null) throw new Error();
+ if (e23.t == null) throw new Error();
+ if (e31.t == null) throw new Error();
+ 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;
+ }
+ }
+