// test_tri_split.java  plot splits

import java.io.*;
import java.awt.*;
import java.awt.event.*;

public class test_tri_split extends Frame
{
  // mouse and display variables
  int xm, ym, bm; // mouse position 
  int height = 700;
  int width = 700;
  double xmin;
  double xmax;
  double ymin;
  double ymax;
  double xw, yh, xoff, yoff;
  final int sz = 10000;
  final int sz3 = 20000;
  int    debug=3;                   // debug print level 
  int    ntri;                      // number of triangles  
  int    minvert;                   // minimum vertex number, reduced to zero 
  int    t1[] = new int[sz];        // vertex numbers on triangles 
  int    t2[] = new int[sz];        // vertex numbers on triangles 
  int    t3[] = new int[sz];        // vertex numbers on triangles 
  int    ncoord;                   // number of coordinates, also equals nvert 
  double xc[] = new double[sz];     // coordinates in vertex order 
  double yc[] = new double[sz];     // coordinates in vertex order 
  int    b1[] = new int[sz];        // dirichlet boundary edge vertices 
  int    b2[] = new int[sz];        // dirichlet boundary edge vertices 
  int nvert;                        // number of unique vertices 
  int uniqueb[] = new int[sz3];     // bound vertices 
  int nbound;                       // number of boundary vertices 
  int uniquef[] = new int[sz3];     // free vertices, 0 to nfree-1 
  int nfree;                        // degrees of freedom  ntri-nbound 
  int nuniquev, nuniqueb, nuniquef; // vertices counts
  int rtn[] = new int[6];
  double rtnx[] = new double[5];


  public test_tri_split(String root)
  {
    System.out.println("test_tri_split.java running, root="+root);
    setTitle("test_tri_split");
    setSize(width,height);
    setBackground(Color.white);
    setForeground(Color.black);
    addWindowListener(new WindowAdapter()
    {
      public void windowClosing(WindowEvent e)
      {
        System.exit(0);
      }
    });
    setVisible(true);
    this.addMouseListener (new mousePressHandler());

    do_program(root);
  } // test_tri_split constructor

  void do_program(String root)
  {
    new tri_input(root, t1, t2, t3, // ntri of these
                  b1, b2,           // nbound of these
                  xc, yc,           // ncoord of these
                  uniqueb, rtn, rtnx);
    if(rtn[0]==0) System.exit(0);
    ntri = rtn[0];
    nbound = rtn[1];
    ncoord = rtn[2];
    nvert = rtn[3];
    nfree = rtn[4];
    nuniqueb = rtn[5];
    xmin = rtnx[0];
    xmax = rtnx[1];
    ymin = rtnx[2];
    ymax = rtnx[3];
    System.out.println("ntri="+ntri+", nbound="+nbound+", ncoord="+ncoord);
    System.out.println("nvert="+nvert+", nfree="+nfree+", nuniqueb="+nuniqueb);
    System.out.println("xmin="+xmin+",xmax="+xmax+
                       ", ymin="+ymin+", ymax="+ymax);
    xw = (xmax-xmin)*1.2;
    yh = (ymax-ymin)*1.2;
    xoff = 0.083333*xw;
    yoff = 0.083333*yh;
    // plot
    repaint();

    check_boundary();
    dup_test();
  } // end do_program


  class mousePressHandler extends MouseAdapter
  {
    public void mousePressed (MouseEvent e)
    {
      xm = e.getX();
      ym = e.getY();
      bm = e.getButton();

      if(in_rect(width-40, height-30, 30, 20))
      {
	// split again
        new tri_split(ntri, t1, t2, t3,
                      nbound, b1, b2,
                      ncoord, xc, yc, uniqueb, rtn);
        if(rtn[0]==0) System.exit(0);
        ntri = rtn[0];
        nbound = rtn[1];
        ncoord = rtn[2];
        nvert = rtn[3];
        nfree = rtn[4];
        nuniqueb = rtn[5];
        System.out.println("ntri="+ntri+", nbound="+nbound+", ncoord="+ncoord);
        System.out.println("nvert="+nvert+", nfree="+nfree+", nuniqueb="+nuniqueb);
        System.out.println("xmin="+xmin+",xmax="+xmax+
                           ", ymin="+ymin+", ymax="+ymax);
        // for(int i=0; i<nuniqueb; i++) System.out.println(
        //                                   "uniqueb["+i+"]="+uniqueb[i]);


	requestFocus();
	// System.out.println("down xm="+xm+", ym="+ym+", bm="+bm); // debug
        repaint();
        check_boundary();
        dup_test();
      }
      if(in_rect(width-80, height-30, 30, 20)) System.exit(0);
    } // end mousePressed 
  } // end mousePressHandler

  boolean in_rect(int x, int y, int w, int h)
  {
    return xm>x && xm<x+w && ym>y && ym<y+h;
  }
 
  public void paint(Graphics g)
  {
    double x, y;
    int x1i, y1i, x2i, y2i, x3i, y3i;
    g.setColor(Color.yellow);
    g.fillRect(width-40,height-30,30,20);
    g.setColor(Color.black);
    g.drawString("next", width-35, height-15);
    g.setColor(Color.red);
    g.fillRect(width-80,height-30,30,20);
    g.setColor(Color.black);
    g.drawString("quit", width-75, height-15);

    // g.fillRect(500,50,50,50);

 
    for(int i=0; i<ntri; i++)
    {
      x = xc[t1[i]];
      x1i = (int)((double)width*((xoff+x-xmin)/xw));
      y = yc[t1[i]];
      y1i = (int)((double)height*((yoff+ymax-y)/yh));
      if(not_in(t1[i], uniqueb, nuniqueb)) g.setColor(Color.blue);
      else                                 g.setColor(Color.red);
      g.fillOval(x1i-4, y1i-4, 8, 8);
      x = xc[t2[i]];
      x2i = (int)((double)width*((xoff+x-xmin)/xw));
      y = yc[t2[i]];
      y2i = (int)((double)height*((yoff+ymax-y)/yh));
      if(not_in(t2[i], uniqueb, nuniqueb)) g.setColor(Color.blue);
      else                                 g.setColor(Color.red);
      g.fillOval(x2i-4, y2i-4, 8, 8);
      x = xc[t3[i]];
      x3i = (int)((double)width*((xoff+x-xmin)/xw));
      y = yc[t3[i]];
      y3i = (int)((double)height*((yoff+ymax-y)/yh));
      if(not_in(t3[i], uniqueb, nuniqueb)) g.setColor(Color.blue);
      else                                 g.setColor(Color.red);
      g.fillOval(x3i-4, y3i-4, 8, 8);
      
      if(bedge(t1[i],t2[i])) g.setColor(Color.red);
      else                   g.setColor(Color.black);
      g.drawLine(x1i, y1i, x2i, y2i);
      if(bedge(t2[i],t3[i])) g.setColor(Color.red);
      else                   g.setColor(Color.black);
      g.drawLine(x2i, y2i, x3i, y3i);
      if(bedge(t3[i],t1[i])) g.setColor(Color.red);
      else                   g.setColor(Color.black);
      g.drawLine(x3i, y3i, x1i, y1i);
    }
  } // end paint

  boolean not_in(int i, int a[], int n)
  {
    boolean found = false;
    int j;

    for(j=0; j<n; j++)
    {
      if(i==a[j]) { found=true; break; }
    }
    return !found;
  } // end not_in

boolean bedge(int i1, int i2) // test for boundary edge
  {
    boolean found = false;

    for(int j=0; j<nbound; j++)
    {
      if((b1[j]==i1 && b2[j]==i2) || (b1[j]==i2 && b2[j]==i1))
      {
        found=true;
        break;
      }
    }
    return found;
  } // end bedge

  void check_boundary() // every boundary vertex exactly twice
  {
    int checkb[] = new int[nvert];

    for(int i=0; i<nuniqueb; i++) checkb[i] = 0;
    for(int i=0; i<nbound; i++) checkb[b1[i]] += 1;
    for(int i=0; i<nbound; i++) checkb[b2[i]] += 1;
    for(int i=0; i<nuniqueb; i++)
    {
      if(checkb[i]==0) break; // not a boundary
      if(checkb[i]!=2)
      {
	System.out.println("ERROR boundary node "+i+" appears "+checkb[i]);
      }
    }
  } // end check_boundary

  void  dup_test()  // check that no node is duplicated
  {
    for(int j=0; j<nvert-1; j++)   // do not duplicate
    {
      for(int k=j+1; k<nvert; k++) // do not duplicate
      {
	if(Math.abs(xc[j]-xc[k])+Math.abs(yc[j]-yc[k])<0.0001)
	{
	  System.out.println("ERROR duplicate nodes "+j+" and "+k+" at "
			     +xc[j]+","+yc[k]);
	}
      }
    }
  } // end dup_test 

  public static void main(String[] args)
  {
    new test_tri_split(args[0]);
  }
} // end class  test_tri_split.java