| | |
| | | * Add the neigbour to the list of neighbouring triangles. The |
| | | * neighbouring triangles are those, who share two vertices. Function resizes |
| | | * the list and adds the pointer to neighbour. It receives two arguments of |
| | | * ts_triangle type. It then adds eachother to eachother's list. Upon |
| | | * ts_triangle type. It then adds second triangle to the list of first |
| | | * triangle, but not the opposite. Upon |
| | | * success it returns TS_SUCCESS, upon detecting NULL pointers |
| | | * returns TS_FAIL and it FATALY ends when the data structure |
| | | * cannot be resized. |
| | |
| | | if(tria->data->neigh == NULL) |
| | | fatal("Reallocation of memory failed during insertion of triangle neighbour in triangle_add_neighbour",3); |
| | | tria->data->neigh[tria->data->neigh_no-1]=ntria; |
| | | |
| | | |
| | | |
| | | /* we repeat the procedure for the neighbour */ |
| | | ntria->data->neigh_no++; |
| | | /* ntria->data->neigh_no++; |
| | | ntria->data->neigh=realloc(ntria->data->neigh,ntria->data->neigh_no*sizeof(ts_triangle *)); |
| | | if(ntria->data->neigh == NULL) |
| | | fatal("Reallocation of memory failed during insertion of triangle neighbour in triangle_add_neighbour",3); |
| | | ntria->data->neigh[ntria->data->neigh_no-1]=tria; |
| | | */ |
| | | return TS_SUCCESS; |
| | | } |
| | | |