73 skel_branch* AddNewBranchToDo(std::list<skel_branch>& branchesToDo);
76 void FindEndpoints(std::deque<Coord3i>& endPoints,
const unsigned char* image,
const int dim[3]);
79 int IsEndpoint(
int x,
int y,
int z,
const unsigned char* image,
const int dim[3]);
83 void GetValidNeighbors(
int* label_image,
Coord3i& act_point, std::deque<Coord3i>& neighbors,
const unsigned char* image,
const int dim[3]);
88 std::deque<skel_branch> m_Graph;
94 std::deque<int> m_MaximalPath;
95 double m_MaximalPathLength;