cgma
TDChordal.cpp
Go to the documentation of this file.
00001 //-------------------------------------------------------------------------
00002 // Class:       TDChordal
00003 // Description: Support for Chordal Axis.
00004 // Author:      jitken
00005 // Date:        1/20/2002
00006 //-------------------------------------------------------------------------
00007 
00008 #include "TDChordal.hpp"
00009 #include "DLIList.hpp"
00010 
00011 TDChordal::TDChordal(){
00012   int ii;
00013   for (ii = 0; ii < 3; ii++){
00014     boundaryEdge[ii] = false;
00015   }
00016   triGenre = UNDEFINED;
00017   numOfBoundaryEdges = 0;
00018   visited = FALSE;
00019 
00020 }
00021 
00022 TDChordal::~TDChordal(){
00023 
00024 }
00025 
00026 
00027 CubitStatus TDChordal::determine_tritype(){
00028   
00029   switch(numOfBoundaryEdges){
00030   case 0: 
00031     triGenre = JUNCTION;
00032     break;
00033   case 1:
00034     triGenre = SLEEVE;
00035     break;
00036   case 2:
00037     triGenre = TERMINATED;
00038     break;
00039   case 3:
00040     triGenre = DISCARDED;
00041     break;
00042   default:
00043     return CUBIT_FAILURE;
00044     break;
00045   }
00046   
00047   return CUBIT_SUCCESS;
00048 
00049 }
00050 
00051 void TDChordal::get_non_boundary_edges(DLIList <int> &edge_index){
00052   int ii = 0;
00053   for(ii = 0; ii<3; ii++){
00054     if(!boundaryEdge[ii]){
00055       edge_index.append(ii);
00056     }
00057   }
00058 
00059 }
00060 
00061 // bool TDChordal::computed_midpoint(int index){
00062 //   assert(index >= 0 && index < 3);
00063 //   return computedMidpoint[index];
00064 // }
00065 
00066 // CubitPoint *TDChordal::get_midpoint(int index){
00067 //   assert(index >= 0 && index < 3);
00068 //   return midPoint[index];
00069 // }
 All Classes Namespaces Files Functions Variables Typedefs Enumerations Enumerator Friends Defines