public Point centroid() { return pointset.centroid(); }
public Vert nearest(Point p) { return pointset.nearest(p); }
- public Vert register(Point p) { Vert v = pointset.get(p); return v==null ? new Vert(p) : v; }
public final class Vert extends HasPoint {
public Point p;
+ E e; // some edge *leaving* this point
+
+ Vert bound_to = this;
+ int watch_count;
+ float watch_x;
+ float watch_y;
+ float watch_z;
+ Vert watch;
+ Matrix binding = new Matrix();
+ float oldscore = 0;
+ boolean inserted = false;
+
public Point getPoint() { return p; }
private Vert(Point p) {
this.p = p;
+ //this.e = e;
+ //if (e==null) throw new Error();
if (pointset.get(p) != null) throw new Error();
pointset.add(this);
}
watch = null;
}
public Vert partner() { return watch==null ? this : watch; }
- public Vert watchback() { return watch_count==0 ? partner() :
- register(new Point(watch_x/watch_count, watch_y/watch_count, watch_z/watch_count)); }
+ public Point watchback() { return watch_count==0 ? partner().p :
+ new Point(watch_x/watch_count, watch_y/watch_count, watch_z/watch_count); }
public void rescore() {
if (score_against == null) return;
return good;
}
- public E makeE(Vert p2) {
- E e = getE(p2);
- if (e != null) return e;
- e = p2.getE(this);
- if (this.e == null && p2.e == null) return this.e = new E(this, p2);
- if (this.e == null && p2.e != null) return p2.makeE(this).pair;
- return new E(getFreeIncident(), p2);
- }
-
public E getFreeIncident() {
E ret = getFreeIncident(e, e);
if (ret != null) return ret;
return null;
}
+ public E getE(Point p2) {
+ Vert v = pointset.get(p2);
+ if (v==null) return null;
+ return getE(v);
+ }
public E getE(Vert p2) {
E e = this.e;
do {
} while(e != this.e);
return norm.norm();
}
-
- Vert bound_to = this;
- int watch_count;
- float watch_x;
- float watch_y;
- float watch_z;
- Vert watch;
- E e; // some edge *leaving* this point
- Matrix binding = new Matrix();
- float oldscore = 0;
- boolean inserted = false;
}
/** [UNIQUE] an edge */
}
boolean shattered = false;
- public Vert shatter() { return shatter(register(midpoint()), null, null); }
- public Vert shatter(Vert mid, BindingGroup bg1, BindingGroup bg2) {
+ public Point shatter() { return shatter(midpoint(), null, null); }
+ public Point shatter(Point mid, BindingGroup bg1, BindingGroup bg2) {
if (shattered) return mid;
shattered = true;
if (bg1==null) bg1 = new BindingGroup();
if (bg2==null) bg2 = new BindingGroup();
- for(E e : bg.es) e.shatter(register(e.midpoint()), bg1, bg2);
+ for(E e : bg.es) e.shatter(e.midpoint(), bg1, bg2);
pair.shatter();
destroy();
- newT(r, p1, mid, null);
- newT(r, mid, p2, null);
+ newT(r.p, p1.p, mid, null);
+ newT(r.p, mid, p2.p, null);
bg1.add(p1.getE(mid));
- bg2.add(mid.getE(p2));
+ bg2.add(p2.getE(mid).pair);
return mid;
}
}
/** creates an isolated edge out in the middle of space */
- public E(Vert p1, Vert p2) {
- if (p1==p2) throw new Error("attempt to create edge with single vertex: " + p1);
- this.p1 = p1;
- this.p2 = p2;
+ public E(Point p1, Point p2) {
+ if (pointset.get(p1) != null) throw new Error();
+ if (pointset.get(p2) != null) throw new Error();
+ this.p1 = new Vert(p1);
+ this.p2 = new Vert(p2);
this.prev = this.next = this.pair = new E(this, this, this);
+ this.p1.e = this;
+ this.p2.e = this.pair;
sync();
}
/** adds a new half-edge from prev.p2 to p2 */
- public E(E prev, Vert p2) {
+ public E(E prev, Point p) {
+ Vert p2;
+ p2 = pointset.get(p);
+ if (p2 == null) p2 = new Vert(p);
this.p1 = prev.p2;
this.p2 = p2;
this.prev = prev;
this.prev.next = this;
this.pair = new E(q, this, z);
}
+ if (p2.e==null) p2.e = this.pair;
sync();
}
}
}
- public T newT(Point p1, Point p2, Point p3, Vec norm) { return newT(register(p1), register(p2), register(p3), norm); }
- public T newT(Vert p1, Vert p2, Vert p3, Vec norm) {
+ public E makeE(Point p1, Point p2) {
+ Vert v1 = pointset.get(p1);
+ Vert v2 = pointset.get(p2);
+ if (v1 != null && v2 != null) {
+ E e = v1.getE(v2);
+ if (e != null) return e;
+ e = v2.getE(v1);
+ if (e != null) return e;
+ }
+ if (v1 != null) return new E(v1.getFreeIncident(), p2);
+ if (v2 != null) return new E(v2.getFreeIncident(), p1).pair;
+ return new E(p1, p2);
+ }
+ public T newT(Point p1, Point p2, Point p3, Vec norm) {
if (norm != null) {
- Vec norm2 = p3.p.minus(p1.p).cross(p2.p.minus(p1.p));
+ Vec norm2 = p3.minus(p1).cross(p2.minus(p1));
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; }
+ if (dot < 0) { Point p = p1; p1=p2; p2 = p; }
}
- E e12 = p1.makeE(p2);
- E e23 = p2.makeE(p3);
- E e31 = p3.makeE(p1);
+ E e12 = makeE(p1, p2);
+ E e23 = makeE(p2, p3);
+ E e31 = makeE(p3, p1);
while(e12.next != e23 || e23.next != e31 || e31.next != e12) {
e12.makeAdjacent(e23);
e23.makeAdjacent(e31);
projects / anneal.git / blobdiff