Doxygen Source Code Documentation

Main Page Alphabetical List Data Structures File List Data Fields Globals Search

SUMA_EDGE_LIST Struct Reference

#include <SUMA_define.h>


Data Fields
int	LinkedPtrType
int	N_links
char	owner_id [SUMA_IDCODE_LENGTH]
char *	idcode_str
int **	EL
int **	ELps
int *	ELloc
int	N_EL
int	N_Distinct_Edges
int	max_N_Hosts
int	min_N_Hosts
int **	Tri_limb
float *	Le

Detailed Description

structure containing the edges that make up a triangular faceset list

Definition at line 712 of file SUMA_define.h.

Field Documentation

int** SUMA_EDGE_LIST::EL

pointer to where the Edge List ( N_EL x 2 ) will be placed each row is an edge, i1 i2 where i1 is always <= i2 EL is sorted by row

Definition at line 719 of file SUMA_define.h.

Referenced by SUMA_AssignTriBranch(), SUMA_Build_FirstNeighb(), SUMA_Draw_SO_ROI(), SUMA_FindEdge(), SUMA_FindEdgeInTri(), SUMA_free_Edge_List(), SUMA_FromIntEdgeToIntEdge(), SUMA_Get_Incident(), SUMA_GetContour(), SUMA_IntersectionStrip(), SUMA_isSameEdge(), SUMA_isSelfIntersect(), SUMA_Make_Edge_List_eng(), SUMA_MakeConsistent(), SUMA_Mark_Tri(), SUMA_Show_Edge_List(), SUMA_Show_SPI(), SUMA_Surf_Plane_Intersect(), SUMA_SurfaceObject_Info(), and SumaToGts().

int* SUMA_EDGE_LIST::ELloc

k x 1 vector that stores where each node's listing begins. ELloc is used to quickly find a certain edge in EL to find the edge formed by nodes na-nb find the minimum of na and nb (say it's nb) the first reference of an edge containing nb starts at EL(ELloc(nb),:) NOTE: ELloc contains an entry for each node in FaceSetList, except the largest node index since that's never in the first column of EL

Definition at line 730 of file SUMA_define.h.

Referenced by SUMA_FindEdge(), SUMA_FindEdgeInTri(), SUMA_free_Edge_List(), SUMA_Get_Incident(), SUMA_IntersectionStrip(), and SUMA_Make_Edge_List_eng().

int** SUMA_EDGE_LIST::ELps

pointer to where the Edge List Property matrix ( N_EL x 2 )will be placed 1st column, row i = 1 means edge i: i1,i2 was encountered as i2->i1 in the triangle J (so it was flipped when stored in EL) = -1 means edge i: i1,i2 was encountered as i1->i2 in the triangle J (so no flipping was done to store it in EL) 2nd column, row i = J is the triangle ( FL[J] ) that the segment belongs to. 3rd column, row i = Numer of triangles that contain this edge. This number is positive for the first occurence of the edge in EL, it is -1 afterwards. A decent edge has 2 hosting triangles, an edge edge has 1 hosting triangle. Bad edges come in all other colors

Definition at line 722 of file SUMA_define.h.

Referenced by SUMA_AssignTriBranch(), SUMA_Find_Edge_Nhost(), SUMA_FindEdgeInTri(), SUMA_free_Edge_List(), SUMA_Get_Incident(), SUMA_GetContour(), SUMA_IntersectionStrip(), SUMA_isSelfIntersect(), SUMA_Make_Edge_List_eng(), SUMA_MakeConsistent(), SUMA_Mark_Tri(), SUMA_NodePath_to_TriPath_Inters(), SUMA_Show_Edge_List(), SUMA_Surf_Plane_Intersect(), SUMA_SurfaceObject_Info(), and SumaToGts().