wzchart.cxx

Delaunay三角形的网格剖分程序

#include "wzchart.hxx"

wzChart::wzChart()
{
  int i,j;
  for(i=0;i<wzPointDim;i++){
    min[i] = -wzInfty;
    max[i] = wzInfty;
    for(j=0;j<wzPointDim;j++)	X[i][j] = Y[i][j] = 0;
    X[i][i] 		= Y[i][i]	   = 1;
    X[i][wzPointDim] 	= Y[i][wzPointDim] = 0;
  }
  unshifted = 1;
}

void wzChart::y(wzFloat *y, const wzPoint& x) const
{
  int i,j;
  //  wzFloat XX[wzPointDim];
  if(unshifted){
      for(j=0;j<wzPointDim;j++)	y[j] = x[j];
  }else{
    for(i=0;i<wzPointDim;i++){
      y[i] = Y[i][wzPointDim];
      for(j=0;j<wzPointDim;j++)	y[i] += Y[i][j]*x[j];
    }
  }
}

void wzChart::x(wzPoint& x, const wzFloat *y) const
{
  int i,j;
  //  wzFloat XX[wzPointDim],*xx;
  if(unshifted){
    for(j=0;j<wzPointDim;j++)	x[j] = y[j];
  }else{
    for(i=0;i<wzPointDim;i++){
      x[i] = X[i][wzPointDim];
      for(j=0;j<wzPointDim;j++)	x[i] += X[i][j]*y[j];
    }
  }
}

wzFloat wzChart::chi(const wzPoint& x) const
{
  //  wzFloat YY[wzPointDim];
  try{
    return 1;
  }catch(...){
    return -1;
  }
}