public Boolean Ifggb(Delaunay3 de) { Boolean cz = false; for (k = 0; k < 3; k++) { if (cz == true) { break; } for (n = 0; n < 3; n++) { if (this.sjb[k].StartNode == de.sjb[n].StartNode && this.sjb[k].EndNode == de.sjb[n].EndNode) { cz = true; break; } } } return(cz); }
public Boolean equals(Delaunay3 sj) { m = 0; for (k = 0; k < 3; k++) { for (n = 0; n < 3; n++) { if (this.pt[k] == sj.pt[n]) { m++; } } } if (m == 3) { return(true);//代表两个三角形一样 } else { return(false); } }
public Line Findggb(Delaunay3 de) { Boolean cz = false; Line l = new Line(); for (k = 0; k < 3; k++) { if (cz == true) { break; } for (n = 0; n < 3; n++) { if (this.sjb[k].StartNode == de.sjb[n].StartNode && this.sjb[k].EndNode == de.sjb[n].EndNode) { cz = true; l = this.sjb[k]; break; } } } return(l); }