Download Projet Informatique
Transcript
}
double det = Z2*(X3*Y4-X4*Y3)-Z3*(X2*Y4-X4*Y2)+Z4*(X2*Y3-X3*Y2);
if (det>0) return 1;
if (det<0) return -1;
return 0;
public boolean dansTriangle (int p) {
// Attention le triangle doir etre orient'e !!!
return estOriente(p,i,j)!=-1 && estOriente(p,j,k)!=-1 &&
estOriente(p,k,i)!=-1 ;
}
public void print() {
System.out.println( i + " ; " +j + " ; "+ k ) ;
}
public boolean toucheGrandTriangle() {
return
(i==0)||(i==1)||(i==2)||(j==0)||(j==1)||(j==2)||(k==0)||(k==1)||(k==2);
}
}
La classe Triangulation
import java.io.* ;
class Triangulation {
Triangle triangleInitial ;
int X_MAX, Y_MAX ;
public Triangulation(int n, int X_MAX , int Y_MAX) {
this.X_MAX = X_MAX ;
this.Y_MAX = Y_MAX ;
Triangle.points = new Point[n+3] ;
Triangle.nb = -1 ;
Triangle.points[0] = new Point(-50*X_MAX,-50*Y_MAX) ; // on choisit un
grand triangle initial pour 'eviter la perte de convexit’e
Triangle.points[1] = new Point(50*X_MAX,0) ;
Triangle.points[2] = new Point(0,50*Y_MAX) ;
triangleInitial = new Triangle(0,1,2,null,null,null) ;
}
public void ajouter (Point pt) {
if (pt.x > X_MAX || pt.y > Y_MAX) {
System.out.println("Point hors du triangle initial !!!") ;
return ;
}
27