/** assumes v is an halfplane! - returns another (none halfplane) triangle */ private static Triangle findnext2(Point p, Triangle v) { if (v.getAbTriangle() != null && !v.getAbTriangle().isHalfplane()) return v.getAbTriangle(); if (v.getBcTriangle() != null && !v.getBcTriangle().isHalfplane()) return v.getBcTriangle(); if (v.getCaTriangle() != null && !v.getCaTriangle().isHalfplane()) return v.getCaTriangle(); return null; }
private void initTriangles() { if (modCount == modCount2) return; if (this.size() > 2) { modCount2 = modCount; Vector<Triangle> front = new Vector<Triangle>(); triangles = new Vector<Triangle>(); front.add(this.startTriangle); while (front.size() > 0) { Triangle t = front.remove(0); if (t.isMark() == false) { t.setMark(true); triangles.add(t); if (t.getAbTriangle() != null && !t.getAbTriangle().isMark()) { front.add(t.getAbTriangle()); } if (t.getBcTriangle() != null && !t.getBcTriangle().isMark()) { front.add(t.getBcTriangle()); } if (t.getCaTriangle() != null && !t.getCaTriangle().isMark()) { front.add(t.getCaTriangle()); } } } for (int i = 0; i < triangles.size(); i++) { triangles.elementAt(i).setMark(false); } } }
private void allTriangles(Triangle curr, Vector<Triangle> front, int mc) { if (curr != null && curr.getMc() == mc && !front.contains(curr)) { front.add(curr); allTriangles(curr.getAbTriangle(), front, mc); allTriangles(curr.getBcTriangle(), front, mc); allTriangles(curr.getCaTriangle(), front, mc); } }
/** * insert the point to this Delaunay Triangulation. Note: if p is null or * already exist in this triangulation p is ignored. * * @param p * new vertex to be inserted the triangulation. */ public void insertPoint(Point p) { if (vertices.contains(p)) return; modCount++; updateBoundingBox(p); vertices.add(p); Triangle t = insertPointSimple(p); if (t == null) // return; Triangle tt = t; currT = t; // recall the last point for - fast (last) update iterator. do { flip(tt, modCount); tt = tt.getCaTriangle(); } while (tt != t && !tt.isHalfplane()); // Update index with changed triangles if (gridIndex != null) gridIndex.updateIndex(getLastUpdatedTriangles()); }
private Triangle treatDegeneracyInside(Triangle t, Point p) { if (t.getAbTriangle().isHalfplane() && p.pointLineTest(t.getB(), t.getA()) == Point.ONSEGMENT) return extendOutside(t.getAbTriangle(), p); if (t.getBcTriangle().isHalfplane() && p.pointLineTest(t.getC(), t.getB()) == Point.ONSEGMENT) return extendOutside(t.getBcTriangle(), p); if (t.getCaTriangle().isHalfplane() && p.pointLineTest(t.getA(), t.getC()) == Point.ONSEGMENT) return extendOutside(t.getCaTriangle(), p); return null; }
private static Triangle findnext1(Point p, Triangle v) { if (p.pointLineTest(v.getA(), v.getB()) == Point.RIGHT && !v.getAbTriangle().isHalfplane()) return v.getAbTriangle(); if (p.pointLineTest(v.getB(), v.getC()) == Point.RIGHT && !v.getBcTriangle().isHalfplane()) return v.getBcTriangle(); if (p.pointLineTest(v.getC(), v.getA()) == Point.RIGHT && !v.getCaTriangle().isHalfplane()) return v.getCaTriangle(); if (p.pointLineTest(v.getA(), v.getB()) == Point.RIGHT) return v.getAbTriangle(); if (p.pointLineTest(v.getB(), v.getC()) == Point.RIGHT) return v.getBcTriangle(); if (p.pointLineTest(v.getC(), v.getA()) == Point.RIGHT) return v.getCaTriangle(); return null; }
private Triangle extendcounterclock(Triangle t, Point p) { t.setHalfplane(false); t.setC(p); t.circumcircle(); Triangle tca = t.getCaTriangle(); if (p.pointLineTest(tca.getA(), tca.getB()) >= Point.RIGHT) { Triangle nT = new Triangle(t.getA(), p); nT.setAbTriangle(t); t.setCanext(nT); nT.setCanext(tca); tca.setBcTriangle(nT); return nT; } return extendcounterclock(tca, p); }
deletedTriangle.getCaTriangle().switchneighbors(deletedTriangle, addedTriangle); addedTriangle.setAbTriangle(deletedTriangle.getCaTriangle()); addedTriangle.setCanext(deletedTriangle.getCaTriangle()); addedTriangle.setBcTriangle(deletedTriangle.getCaTriangle());
private Triangle extendInside(Triangle t, Point p) { Triangle h1, h2; h1 = treatDegeneracyInside(t, p); if (h1 != null) return h1; h1 = new Triangle(t.getC(), t.getA(), p); h2 = new Triangle(t.getB(), t.getC(), p); t.setC(p); t.circumcircle(); h1.setAbTriangle(t.getCaTriangle()); h1.setBcTriangle(t); h1.setCanext(h2); h2.setAbTriangle(t.getBcTriangle()); h2.setBcTriangle(h1); h2.setCanext(t); h1.getAbTriangle().switchneighbors(t, h1); h2.getAbTriangle().switchneighbors(t, h2); t.setBcTriangle(h2); t.setCanext(h1); return t; }
u = firstT; while (p.isGreater(u.getA())) u = u.getCaTriangle(); t = new Triangle(p, u.getB()); tp = new Triangle(u.getB(), p); t.setCanext(u); u.setBcTriangle(t); tp.setCanext(u.getAbTriangle().getCaTriangle()); u.getAbTriangle().getCaTriangle().setBcTriangle(tp); tp.setBcTriangle(u.getAbTriangle()); u.getAbTriangle().setCanext(tp);
} else if (t.getA() == u.getB()) { v = new Triangle(u.getC(), t.getB(), t.getC()); v.setAbTriangle(u.getCaTriangle()); t.setAbTriangle(u.getBcTriangle()); } else if (t.getA() == u.getC()) { v = new Triangle(u.getA(), t.getB(), t.getC()); v.setAbTriangle(u.getAbTriangle()); t.setAbTriangle(u.getCaTriangle()); } else { throw new RuntimeException("Error in flip.");
neighbor = halfplane.getBcTriangle(); } else if (!halfplane.getBcTriangle().isHalfplane()) { neighbor = halfplane.getCaTriangle();