partitionX.h File Reference

#include "directedLine.h"

Include dependency graph for partitionX.h:

This graph shows which files directly or indirectly include this file:

Go to the source code of this file.

Functions
Int	isCuspX (directedLine *v)
Int	isReflexX (directedLine *v)
Int	cuspTypeX (directedLine *v)
void	findInteriorCuspsX (directedLine *polygon, Int &ret_n_interior_cusps, directedLine **ret_interior_cusps)
Int	numInteriorCuspsX (directedLine *polygon)
directedLine *	findDiagonal_singleCuspX (directedLine *cusp)

Function Documentation

cuspTypeX()

Int cuspTypeX

(

directedLine *

v

)

Definition at line 89 of file partitionX.cc.

{
  if(! isCuspX(v)) return 0;
  else 
    {
//printf("isCusp,%f,%f\n", v->head()[0], v->head()[1]);
      if(isReflexX(v)) 
    {
//    printf("isReflex\n");
      return 1;
    }
      else
    {
//    printf("not isReflex\n");
      return 2;
    }
    }
}

Referenced by findInteriorCuspsX(), and numInteriorCuspsX().

findDiagonal_singleCuspX()

directedLine * findDiagonal_singleCuspX

(

directedLine *

cusp

)

Definition at line 137 of file partitionX.cc.

{
  directedLine* temp;
  Int is_minimal = ((compV2InX(cusp->head(), cusp->tail()) == -1)? 1:0);
 
  if(is_minimal)
    for(temp = cusp->getNext(); temp != cusp; temp = temp->getNext())
      {
    if(compV2InX(cusp->head(), temp->head()) == 1)
      {    
        return temp;
      }
      }
  else //is maxmal 
    for(temp = cusp->getNext(); temp != cusp; temp = temp->getNext())
      {
    if(compV2InX(cusp->head(), temp->head()) == -1)
      {    
        return temp;
      }
      }
  return NULL;
}

Referenced by monoTriangulationOpt(), monoTriangulationRecGenOpt(), and sampleMonoPoly().

findInteriorCuspsX()

void findInteriorCuspsX	(	directedLine *	polygon,
		Int &	ret_n_interior_cusps,
		directedLine **	ret_interior_cusps
	)

Definition at line 121 of file partitionX.cc.

{
  directedLine *temp;
  ret_n_interior_cusps = 0;
  if(cuspTypeX(polygon) == 1)
    {
      ret_interior_cusps[ret_n_interior_cusps++] = polygon;
    }
  for(temp = polygon->getNext(); temp != polygon; temp = temp->getNext())    
    if(cuspTypeX(temp) == 1)
      {
    ret_interior_cusps[ret_n_interior_cusps++] = temp;    
      }
}

Referenced by monoTriangulationOpt(), monoTriangulationRecGenOpt(), and sampleMonoPoly().

isCuspX()

Int isCuspX

(

directedLine *

v

)

Definition at line 47 of file partitionX.cc.

{
  //if v->prev <= v && v->next <= v
  //|| v->prev >= v && v->next >= v
  Real* T = v->head();
  Real* P = v->getPrev()->head();
  Real* N = v->getNext()->head();
  if(
     (compV2InX(T,P) != -1 && 
      compV2InX(T,N) != -1
      ) ||
     (compV2InX(T,P) != 1 && 
      compV2InX(T,N) != 1
      )
     )
    return 1;
  else
    return 0;
}

Referenced by cuspTypeX().

isReflexX()

Int isReflexX

(

directedLine *

v

)

Definition at line 67 of file partitionX.cc.

{
  Real* A = v->getPrev()->head();
  Real* B = v->head();
  Real* C = v->tail();
  Real Bx,By, Cx, Cy;
  //scale them in case they are too small
  Bx = 10*(B[0] - A[0]);
  By = 10*(B[1] - A[1]);
  Cx = 10*(C[0] - A[0]);
  Cy = 10*(C[1] - A[1]);
 
  if(Bx*Cy - Cx*By < -CONCAVITY_ZERO) return 1;
  else return 0;
}

Referenced by cuspTypeX().

numInteriorCuspsX()

Int numInteriorCuspsX

(

directedLine *

polygon

)

Definition at line 108 of file partitionX.cc.

{
  directedLine *temp;
  int ret = 0;
  if(cuspTypeX(polygon) == 1)
    ret++;
  for(temp = polygon->getNext(); temp != polygon; temp = temp->getNext())
    if(cuspTypeX(temp) == 1)
      ret++;
  return ret;
}