// circle_grid.java      compile    javac -cp . circle_grid.java
//                       execute    java  -cp . circle_grid circle_grid1.dat
// cover circle with grid
// Output a Utah graphics .dat file 
import java.io.*;
import java.*;
import java.util.*;
import java.text.*;

public class circle_grid
{
  String fileout = "circle_grid.dat";
  int num_points = 0;
  int num_polys = 0;
  double data_points[][] = new double[5000][3]; // x,y,z=0.0
  int data_polys[] = new int[10000]; // 3 pt1 pt2 pt3 
  int k;                             // data_polys next index
  static int cirpts = 16; // or multiple of 4
  double ang = 0.0;
  double Pi = Math.PI;
  double dang = 2.0*Pi/(double)cirpts;
  double x, y, z;
  double r = 1.0;
                               // indexes, add one in polys
  int ixg[][] = new int[7][10]; // [cirpts/2-1], [cirpts/2+2] first is count 
  int iyg[][] = new int[7][10]; // [cirpts/2-1], [cirpts/2+2] first is count
  int nixg = 0;
  int niyg = 0;

  public circle_grid()
  {
    System.out.println("circle_grid.java running");
    System.out.println("circle_grid.java writing "+fileout);

    ang = 0.0;
    for(int i=0; i<cirpts; i++) // outer circle
    {
      x = (r)*Math.cos(ang);
      y = (r)*Math.sin(ang);
      data_points[i][0] = x; // x
      data_points[i][1] = y; // y
      data_points[i][2] = 0.0; // z unused
      ang = ang + dang;
    }
    num_points = cirpts; // will increase

    k = 0; // poly_points counter
    // x lines
    ixg[nixg][0] = 3; // pts
    ixg[nixg][1] = 12;
    ixg[nixg][2] = 17; // new x from 13
    ixg[nixg][3] = 14;
    x = data_points[ixg[nixg][2]-1][0];
    y = data_points[ixg[nixg][1]-1][1];
    data_points[num_points][0] = x; // x
    data_points[num_points][1] = y; // y
    data_points[num_points][2] = 0.0; // z unused
    num_points++; // 17
    for(int i=0; i<=ixg[nixg][0]; i++)
      data_polys[k++] = ixg[nixg][i];
    num_polys++;
    nixg++;

    ixg[nixg][0] = 5; // pts
    ixg[nixg][1] = 11;
    ixg[nixg][2] = 18; // new x from 12
    ixg[nixg][3] = 19; // new x from 13
    ixg[nixg][4] = 20; // new x from 14
    ixg[nixg][5] = 15; 
    x = data_points[12-1][0];
    y = data_points[ixg[nixg][1]-1][1];
    data_points[num_points][0] = x; // x
    data_points[num_points][1] = y; // y
    data_points[num_points][2] = 0.0; // z unused
    num_points++; // 18
    x = data_points[13-1][0];
    y = data_points[ixg[nixg][1]-1][1];
    data_points[num_points][0] = x; // x
    data_points[num_points][1] = y; // y
    data_points[num_points][2] = 0.0; // z unused
    num_points++; // 19
    x = data_points[14-1][0];
    y = data_points[ixg[nixg][1]-1][1];
    data_points[num_points][0] = x; // x
    data_points[num_points][1] = y; // y
    data_points[num_points][2] = 0.0; // z unused
    num_points++; // 20
    for(int i=0; i<=ixg[nixg][0]; i++)
      data_polys[k++] = ixg[nixg][i];
    num_polys++;
    nixg++;

    ixg[nixg][0] = 7; // pts
    ixg[nixg][1] = 10;
    ixg[nixg][2] = 21; // new x from 11
    ixg[nixg][3] = 22; // new x from 12
    ixg[nixg][4] = 23; // new x from 13
    ixg[nixg][5] = 24; // new x from 14
    ixg[nixg][6] = 25; // new x from 15
    ixg[nixg][7] = 16; 
    x = data_points[11-1][0];
    y = data_points[ixg[nixg][1]-1][1];
    data_points[num_points][0] = x; // x
    data_points[num_points][1] = y; // y
    data_points[num_points][2] = 0.0; // z unused
    num_points++; // 21
    x = data_points[12-1][0];
    y = data_points[ixg[nixg][1]-1][1];
    data_points[num_points][0] = x; // x
    data_points[num_points][1] = y; // y
    data_points[num_points][2] = 0.0; // z unused
    num_points++; // 22
    x = data_points[13-1][0];
    y = data_points[ixg[nixg][1]-1][1];
    data_points[num_points][0] = x; // x
    data_points[num_points][1] = y; // y
    data_points[num_points][2] = 0.0; // z unused
    num_points++; // 23
    x = data_points[14-1][0];
    y = data_points[ixg[nixg][1]-1][1];
    data_points[num_points][0] = x; // x
    data_points[num_points][1] = y; // y
    data_points[num_points][2] = 0.0; // z unused
    num_points++; // 24
    x = data_points[15-1][0];
    y = data_points[ixg[nixg][1]-1][1];
    data_points[num_points][0] = x; // x
    data_points[num_points][1] = y; // y
    data_points[num_points][2] = 0.0; // z unused
    num_points++; // 25
    for(int i=0; i<=ixg[nixg][0]; i++)
      data_polys[k++] = ixg[nixg][i];
    num_polys++;
    nixg++;

    ixg[nixg][0] = 9; // pts
    ixg[nixg][1] = 9;
    ixg[nixg][2] = 26; // new x from 10
    ixg[nixg][3] = 27; // new x from 11
    ixg[nixg][4] = 28; // new x from 12
    ixg[nixg][5] = 29; // new x from 13
    ixg[nixg][6] = 30; // new x from 14
    ixg[nixg][7] = 31; // new x from 15
    ixg[nixg][8] = 32; // new x from 16
    ixg[nixg][9] = 1; 
    x = data_points[10-1][0];
    y = data_points[ixg[nixg][1]-1][1];
    data_points[num_points][0] = x; // x
    data_points[num_points][1] = y; // y
    data_points[num_points][2] = 0.0; // z unused
    num_points++; // 26
    x = data_points[11-1][0];
    y = data_points[ixg[nixg][1]-1][1];
    data_points[num_points][0] = x; // x
    data_points[num_points][1] = y; // y
    data_points[num_points][2] = 0.0; // z unused
    num_points++; // 27
    x = data_points[12-1][0];
    y = data_points[ixg[nixg][1]-1][1];
    data_points[num_points][0] = x; // x
    data_points[num_points][1] = y; // y
    data_points[num_points][2] = 0.0; // z unused
    num_points++; // 28
    x = data_points[13-1][0];
    y = data_points[ixg[nixg][1]-1][1];
    data_points[num_points][0] = x; // x
    data_points[num_points][1] = y; // y
    data_points[num_points][2] = 0.0; // z unused
    num_points++; // 29
    x = data_points[14-1][0];
    y = data_points[ixg[nixg][1]-1][1];
    data_points[num_points][0] = x; // x
    data_points[num_points][1] = y; // y
    data_points[num_points][2] = 0.0; // z unused
    num_points++; // 30
    x = data_points[15-1][0];
    y = data_points[ixg[nixg][1]-1][1];
    data_points[num_points][0] = x; // x
    data_points[num_points][1] = y; // y
    data_points[num_points][2] = 0.0; // z unused
    num_points++; // 31
    x = data_points[16-1][0];
    y = data_points[ixg[nixg][1]-1][1];
    data_points[num_points][0] = x; // x
    data_points[num_points][1] = y; // y
    data_points[num_points][2] = 0.0; // z unused
    num_points++; // 32
    for(int i=0; i<=ixg[nixg][0]; i++)
      data_polys[k++] = ixg[nixg][i];
    num_polys++;
    nixg++;

    ixg[nixg][0] = 7; // pts
    ixg[nixg][1] = 8;
    ixg[nixg][2] = 33; // new x from 11
    ixg[nixg][3] = 34; // new x from 12
    ixg[nixg][4] = 35; // new x from 13
    ixg[nixg][5] = 36; // new x from 14
    ixg[nixg][6] = 37; // new x from 15
    ixg[nixg][7] = 2; 
    x = data_points[11-1][0];
    y = data_points[ixg[nixg][1]-1][1];
    data_points[num_points][0] = x; // x
    data_points[num_points][1] = y; // y
    data_points[num_points][2] = 0.0; // z unused
    num_points++; // 33
    x = data_points[12-1][0];
    y = data_points[ixg[nixg][1]-1][1];
    data_points[num_points][0] = x; // x
    data_points[num_points][1] = y; // y
    data_points[num_points][2] = 0.0; // z unused
    num_points++; // 34
    x = data_points[13-1][0];
    y = data_points[ixg[nixg][1]-1][1];
    data_points[num_points][0] = x; // x
    data_points[num_points][1] = y; // y
    data_points[num_points][2] = 0.0; // z unused
    num_points++; // 35
    x = data_points[14-1][0];
    y = data_points[ixg[nixg][1]-1][1];
    data_points[num_points][0] = x; // x
    data_points[num_points][1] = y; // y
    data_points[num_points][2] = 0.0; // z unused
    num_points++; // 36
    x = data_points[15-1][0];
    y = data_points[ixg[nixg][1]-1][1];
    data_points[num_points][0] = x; // x
    data_points[num_points][1] = y; // y
    data_points[num_points][2] = 0.0; // z unused
    num_points++; // 37
    for(int i=0; i<=ixg[nixg][0]; i++)
      data_polys[k++] = ixg[nixg][i];
    num_polys++;
    nixg++;

    ixg[nixg][0] = 5; // pts
    ixg[nixg][1] = 7;
    ixg[nixg][2] = 38; // new x from 12
    ixg[nixg][3] = 39; // new x from 13
    ixg[nixg][4] = 40; // new x from 14
    ixg[nixg][5] = 3; 
    x = data_points[12-1][0];
    y = data_points[ixg[nixg][1]-1][1];
    data_points[num_points][0] = x; // x
    data_points[num_points][1] = y; // y
    data_points[num_points][2] = 0.0; // z unused
    num_points++; // 38
    x = data_points[13-1][0];
    y = data_points[ixg[nixg][1]-1][1];
    data_points[num_points][0] = x; // x
    data_points[num_points][1] = y; // y
    data_points[num_points][2] = 0.0; // z unused
    num_points++; // 39
    x = data_points[14-1][0];
    y = data_points[ixg[nixg][1]-1][1];
    data_points[num_points][0] = x; // x
    data_points[num_points][1] = y; // y
    data_points[num_points][2] = 0.0; // z unused
    num_points++; // 40
    for(int i=0; i<=ixg[nixg][0]; i++)
      data_polys[k++] = ixg[nixg][i];
    num_polys++;
    nixg++;

    ixg[nixg][0] = 3; // pts
    ixg[nixg][1] = 6;
    ixg[nixg][2] = 41; // new x from 13
    ixg[nixg][3] = 4;
    x = data_points[ixg[nixg][2]-1][0];
    y = data_points[ixg[nixg][1]-1][1];
    data_points[num_points][0] = x; // x
    data_points[num_points][1] = y; // y
    data_points[num_points][2] = 0.0; // z unused
    num_points++; // 41
    for(int i=0; i<=ixg[nixg][0]; i++)
      data_polys[k++] = ixg[nixg][i];
    num_polys++;
    nixg++;


    // y lines
    iyg[niyg][0] = 3; // pts
    iyg[niyg][1] = 10;
    iyg[niyg][2] = 26;
    iyg[niyg][3] = 8;
    for(int i=0; i<=iyg[niyg][0]; i++)
      data_polys[k++] = iyg[niyg][i];
    num_polys++;
    nixg++;

    iyg[niyg][0] = 5; // pts
    iyg[niyg][1] = 11;
    iyg[niyg][2] = 21;
    iyg[niyg][3] = 27;
    iyg[niyg][4] = 33;
    iyg[niyg][5] = 7; 
    for(int i=0; i<=iyg[niyg][0]; i++)
      data_polys[k++] = iyg[niyg][i];
    num_polys++;
    nixg++;

    iyg[niyg][0] = 7; // pts
    iyg[niyg][1] = 12;
    iyg[niyg][2] = 18;
    iyg[niyg][3] = 22;
    iyg[niyg][4] = 28;
    iyg[niyg][5] = 34;
    iyg[niyg][6] = 38;
    iyg[niyg][7] = 6; 
    for(int i=0; i<=iyg[niyg][0]; i++)
      data_polys[k++] = iyg[niyg][i];
    num_polys++;
    nixg++;

    iyg[niyg][0] = 9; // pts
    iyg[niyg][1] = 13;
    iyg[niyg][2] = 17;
    iyg[niyg][3] = 19;
    iyg[niyg][4] = 23;
    iyg[niyg][5] = 29;
    iyg[niyg][6] = 35;
    iyg[niyg][7] = 39;
    iyg[niyg][8] = 41;
    iyg[niyg][9] = 5; 
    for(int i=0; i<=iyg[niyg][0]; i++)
      data_polys[k++] = iyg[niyg][i];
    num_polys++;
    nixg++;

    iyg[niyg][0] = 7; // pts
    iyg[niyg][1] = 14;
    iyg[niyg][2] = 20;
    iyg[niyg][3] = 24;
    iyg[niyg][4] = 30;
    iyg[niyg][5] = 36;
    iyg[niyg][6] = 40;
    iyg[niyg][7] = 4; 
    for(int i=0; i<=iyg[niyg][0]; i++)
      data_polys[k++] = iyg[niyg][i];
    num_polys++;
    nixg++;

    iyg[niyg][0] = 5; // pts
    iyg[niyg][1] = 15;
    iyg[niyg][2] = 25;
    iyg[niyg][3] = 31;
    iyg[niyg][4] = 37;
    iyg[niyg][5] = 3; 
    for(int i=0; i<=iyg[niyg][0]; i++)
      data_polys[k++] = iyg[niyg][i];
    num_polys++;
    nixg++;

    iyg[niyg][0] = 3; // pts
    iyg[niyg][1] = 16;
    iyg[niyg][2] = 32;
    iyg[niyg][3] = 2;
    for(int i=0; i<=iyg[niyg][0]; i++)
      data_polys[k++] = iyg[niyg][i];
    num_polys++;
    nixg++;

    // num_polys  not data_polys index k
    new datwrite(fileout, data_points, num_points, data_polys, num_polys);

    System.out.println("circle_grid.java wrote "+fileout+
                       "  circle_grid.tri"+"  circle_grid.coord");
  } // end circle_grid

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