import java.applet.Applet;
import java.awt.*;
import java.awt.event.*;
import java.applet.*;
import java.awt.geom.*;
import java.math.*;

public class Subdivision {

    public static int[] initial(int choice) {
	//	int[] A={20,36,28};
	int[] B={9,25,39};
	return(SubdivisionData.scheme(0));
    }

    /**This does the combinatorial substitution**/

    public static int[] iterate(int[] ch1) {
	int n=ch1.length;
	int[] ch2=new int[3*n];
	for(int i=0;i<n;++i) {
	    int[] B=SubdivisionData.scheme(ch1[i]);
	    ch2[3*i+0]=B[0];
	    ch2[3*i+1]=B[1];
	    ch2[3*i+2]=B[2];
	}
	return(ch2);
    }

    public static int[] stage(int choice,int k) {
	int[] A=initial(choice);
	for(int i=0;i<k;++i) A=iterate(A);
	return(A);
    }

    public static double getScaling(int which,int k) {
	double t=Math.pow(3,-.5*k);
	if(which==3) t=Math.pow(Math.sqrt(2)-1,k);
	return(t);
    }


    /**These are the drawing routines**/

    public static GeneralPath main(int which,int mode,int choice,int k) {
	Complex[] Z=mainList(which,mode,choice,k);  
	GeneralPath gp=new GeneralPath();
	for(int i=0;i<Z.length-1;++i) {
	    gp.moveTo((float)(Z[i].x),(float)(Z[i].y));
	    gp.lineTo((float)(Z[i+1].x),(float)(Z[i+1].y));
	}
	return(gp);
    }


    public static GeneralPath main(int which,int mode,int choice,int k,int edge) {
	int[] A=stage(choice,k);
	GeneralPath gp=new GeneralPath();
	double[] path=new double[2];	
                  double t=getScaling(which,k);
	GeneralPath gp2=new GeneralPath();
	for(int i=0;i<A.length;++i) {
	    gp.reset();
	    Complex z=SubdivisionData.plainVector(which,A[i]);     
                         gp.moveTo((float)(path[0]),(float)(path[1]));
	       if(mode==0) z=SubdivisionData.eigenVector(which,A[i]);
	       path[0]=path[0]+t*z.x;
	       path[1]=path[1]+t*z.y;  
	       gp.lineTo((float)(path[0]),(float)(path[1]));
	       if(A[i]==edge) gp2.append(gp,false);
	}
	return(gp2);
    }

    public static Complex[] mainList(int which,int mode,int choice,int k) {
	int[] A=stage(choice,k);
	Complex[] Z=new Complex[A.length+1];
	double[] path=new double[2];
                  double t=getScaling(which,k);
	    Z[0]=new Complex(0,0);
	for(int i=0;i<A.length;++i) {
	    Complex z=SubdivisionData.plainVector(which,A[i]);  
	    if(mode==0) z=SubdivisionData.eigenVector(which,A[i]);
	    path[0]=path[0]+t*z.x;
	    path[1]=path[1]+t*z.y;  
	    Z[i+1]=new Complex(path[0],path[1]);
	    Z[i+1].TYPE=A[i];
	}
	return(Z);
    }



}