Xmipp
v3.23.11-Nereus
|
#include "dcel.h"
#include "defines.h"
#include "delaunay.h"
#include <float.h>
#include "graph.h"
#include "point.h"
#include "polygon.h"
#include "sorting.h"
#include <stdio.h>
#include <time.h>
#include <stdlib.h>
#include <string.h>
Go to the source code of this file.
Macros | |
#define | MAX_NEIGHBORS 50 |
#define | EXTERNAL_FACE 0 |
Functions | |
void | insert_First_Node (struct Delaunay_T *delaunay) |
void | get_Vertex_Of_Node (struct Graph_T *graph, int node_Index, int *index1, int *index2, int *index3) |
int | is_Interior_To_Node (struct DCEL_T *dcel, struct Graph_T *graph, struct Point_T *p, int node_Index) |
int | is_Strictly_Interior_To_Node (struct DCEL_T *dcel, struct Graph_T *graph, struct Point_T *p, int node_Index) |
bool | analyze_Face (struct Delaunay_T *delaunay, int point_Index) |
void | split_Triangle (struct DCEL_T *dcel, struct Graph_T *graph, int point_Index, int node_Index, int nTriangles) |
double | modified_Signed_Area (struct DCEL_T *dcel, struct Node_T *node) |
int | select_Colinear_Edge (struct DCEL_T *dcel, int point_Index, int edge_ID) |
void | check_Edge (struct DCEL_T *dcel, struct Graph_T *graph, int edge_ID) |
void | flip_Edges_Dcel (struct DCEL_T *dcel, struct Graph_T *graph, int edge_ID) |
int | init_Delaunay (struct Delaunay_T *delaunay, int nPoints) |
void | delete_Delaunay (struct Delaunay_T *delaunay) |
int | insert_Point (struct Delaunay_T *delaunay, double x, double y) |
int | create_Delaunay_Triangulation (struct Delaunay_T *delaunay, int createVoronoi) |
int | initialize_Delaunay (struct Delaunay_T *delaunay, struct DCEL_T *dcel) |
void | finalize_Delaunay (struct Delaunay_T *delaunay) |
void | incremental_Delaunay (struct Delaunay_T *delaunay) |
void | build_Delaunay_From_Triangulation (struct DCEL_T *dcel) |
void | purge_Delaunay (struct Delaunay_T *delaunay) |
int | select_Closest (struct Delaunay_T *delaunay, int index) |
int | get_Face_Points (struct Delaunay_T *delaunay, int face_ID, struct Point_T *p, struct Point_T *q, struct Point_T *r) |
bool | next_Face_Iterator (struct Delaunay_T *delaunay, struct Point_T *p1, struct Point_T *p2, struct Point_T *p3) |
void | select_Two_Closest (struct Delaunay_T *delaunay, int *first, int *second) |
bool | select_Closest_Point (struct Delaunay_T *delaunay, struct Point_T *p, struct Point_T *q, double *lowest_Distance) |
bool | select_Closest_Point_DCEL (struct DCEL_T *dcel, int nAnchors, struct Point_T *p, struct Point_T *q, double *lowest_Distance) |
Variables | |
struct Node_T | root_Node |
struct Graph_T | graph |
#define EXTERNAL_FACE 0 |
Definition at line 31 of file delaunay.cpp.
#define MAX_NEIGHBORS 50 |
Definition at line 30 of file delaunay.cpp.
bool analyze_Face | ( | struct Delaunay_T * | delaunay, |
int | point_Index | ||
) |
Definition at line 1466 of file delaunay.cpp.
void build_Delaunay_From_Triangulation | ( | struct DCEL_T * | dcel | ) |
Definition at line 345 of file delaunay.cpp.
Definition at line 2061 of file delaunay.cpp.
int create_Delaunay_Triangulation | ( | struct Delaunay_T * | delaunay, |
int | createVoronoi | ||
) |
Definition at line 188 of file delaunay.cpp.
void delete_Delaunay | ( | struct Delaunay_T * | delaunay | ) |
Definition at line 123 of file delaunay.cpp.
void finalize_Delaunay | ( | struct Delaunay_T * | delaunay | ) |
Definition at line 267 of file delaunay.cpp.
Definition at line 1954 of file delaunay.cpp.
int get_Face_Points | ( | struct Delaunay_T * | delaunay, |
int | face_ID, | ||
struct Point_T * | p, | ||
struct Point_T * | q, | ||
struct Point_T * | r | ||
) |
Definition at line 638 of file delaunay.cpp.
void get_Vertex_Of_Node | ( | struct Graph_T * | graph, |
int | node_Index, | ||
int * | index1, | ||
int * | index2, | ||
int * | index3 | ||
) |
void incremental_Delaunay | ( | struct Delaunay_T * | delaunay | ) |
Definition at line 293 of file delaunay.cpp.
int init_Delaunay | ( | struct Delaunay_T * | delaunay, |
int | nPoints | ||
) |
Definition at line 67 of file delaunay.cpp.
int initialize_Delaunay | ( | struct Delaunay_T * | delaunay, |
struct DCEL_T * | dcel | ||
) |
Definition at line 236 of file delaunay.cpp.
void insert_First_Node | ( | struct Delaunay_T * | delaunay | ) |
Definition at line 1393 of file delaunay.cpp.
int insert_Point | ( | struct Delaunay_T * | delaunay, |
double | x, | ||
double | y | ||
) |
Definition at line 142 of file delaunay.cpp.
int is_Interior_To_Node | ( | struct DCEL_T * | dcel, |
struct Graph_T * | graph, | ||
struct Point_T * | p, | ||
int | node_Index | ||
) |
Definition at line 1419 of file delaunay.cpp.
int is_Strictly_Interior_To_Node | ( | struct DCEL_T * | dcel, |
struct Graph_T * | graph, | ||
struct Point_T * | p, | ||
int | node_Index | ||
) |
Definition at line 1443 of file delaunay.cpp.
Definition at line 1865 of file delaunay.cpp.
bool next_Face_Iterator | ( | struct Delaunay_T * | delaunay, |
struct Point_T * | p1, | ||
struct Point_T * | p2, | ||
struct Point_T * | p3 | ||
) |
Definition at line 726 of file delaunay.cpp.
void purge_Delaunay | ( | struct Delaunay_T * | delaunay | ) |
Definition at line 504 of file delaunay.cpp.
int select_Closest | ( | struct Delaunay_T * | delaunay, |
int | index | ||
) |
Definition at line 545 of file delaunay.cpp.
bool select_Closest_Point | ( | struct Delaunay_T * | delaunay, |
struct Point_T * | p, | ||
struct Point_T * | q, | ||
double * | lowest_Distance | ||
) |
Definition at line 873 of file delaunay.cpp.
bool select_Closest_Point_DCEL | ( | struct DCEL_T * | dcel, |
int | nAnchors, | ||
struct Point_T * | p, | ||
struct Point_T * | q, | ||
double * | lowest_Distance | ||
) |
Definition at line 1195 of file delaunay.cpp.
int select_Colinear_Edge | ( | struct DCEL_T * | dcel, |
int | point_Index, | ||
int | edge_ID | ||
) |
Definition at line 1889 of file delaunay.cpp.
void select_Two_Closest | ( | struct Delaunay_T * | delaunay, |
int * | first, | ||
int * | second | ||
) |
Definition at line 818 of file delaunay.cpp.
void split_Triangle | ( | struct DCEL_T * | dcel, |
struct Graph_T * | graph, | ||
int | point_Index, | ||
int | node_Index, | ||
int | nTriangles | ||
) |
Definition at line 1577 of file delaunay.cpp.
struct Graph_T graph |
Definition at line 37 of file delaunay.cpp.
struct Node_T root_Node |
Definition at line 36 of file delaunay.cpp.