SAGA API  v9.5
CSG_KDTree_2D Member List

This is the complete list of members for CSG_KDTree_2D, including all inherited members.

_On_Construction(void)CSG_KDTreeprotected
Create(CSG_Shapes *pPoints, int Field=-1)CSG_KDTree_2D
Create(CSG_PointCloud *pPoints)CSG_KDTree_2D
Create(const CSG_Matrix &Points)CSG_KDTree_2D
Create(const double **Points, size_t nPoints)CSG_KDTree_2D
CSG_KDTree(void)CSG_KDTree
CSG_KDTree_2D(void)CSG_KDTree_2D
CSG_KDTree_2D(CSG_Shapes *pPoints, int Field=-1)CSG_KDTree_2D
CSG_KDTree_2D(CSG_PointCloud *pPoints)CSG_KDTree_2D
CSG_KDTree_2D(const CSG_Matrix &Points)CSG_KDTree_2D
CSG_KDTree_2D(const double **Points, size_t nPoints)CSG_KDTree_2D
Destroy(void)CSG_KDTree_2Dvirtual
Get_Duplicates(double Coordinate[2], CSG_Array_sLong &Indices, CSG_Vector &Distances)CSG_KDTree_2Dvirtual
Get_Duplicates(double Coordinate[2])CSG_KDTree_2Dvirtual
Get_Duplicates(double x, double y, CSG_Array_sLong &Indices, CSG_Vector &Distances)CSG_KDTree_2Dvirtual
Get_Duplicates(double x, double y)CSG_KDTree_2Dvirtual
Get_Match_Count(void) constCSG_KDTreeinline
Get_Match_Distance(size_t i) constCSG_KDTreeinline
Get_Match_Index(size_t i) constCSG_KDTreeinline
Get_Match_Shape(size_t i) constCSG_KDTree
Get_Nearest_Point(double Coordinate[2], size_t &Index, double &Distance)CSG_KDTree_2Dvirtual
Get_Nearest_Point(double Coordinate[2], size_t &Index)CSG_KDTree_2Dvirtual
Get_Nearest_Point(double x, double y, size_t &Index, double &Distance)CSG_KDTree_2Dvirtual
Get_Nearest_Point(double x, double y, size_t &Index)CSG_KDTree_2Dvirtual
Get_Nearest_Points(double Coordinate[2], size_t Count, double Radius)CSG_KDTree_2Dvirtual
Get_Nearest_Points(double Coordinate[2], size_t Count, double Radius, CSG_Array_sLong &Indices, CSG_Vector &Distances)CSG_KDTree_2Dvirtual
Get_Nearest_Points(double Coordinate[2], size_t Count, size_t *Indices, double *Distances)CSG_KDTree_2Dvirtual
Get_Nearest_Points(double x, double y, size_t Count, double Radius)CSG_KDTree_2Dvirtual
Get_Nearest_Points(double x, double y, size_t Count, double Radius, CSG_Array_sLong &Indices, CSG_Vector &Distances)CSG_KDTree_2Dvirtual
Get_Nearest_Points(double x, double y, size_t Count, size_t *Indices, double *Distances)CSG_KDTree_2Dvirtual
Get_Nearest_Shape(double Coordinate[2])CSG_KDTree_2Dvirtual
Get_Nearest_Shape(double x, double y)CSG_KDTree_2Dvirtual
Get_Nearest_Value(double Coordinate[2], double &Value)CSG_KDTree_2Dvirtual
Get_Nearest_Value(double x, double y, double &Value)CSG_KDTree_2Dvirtual
Get_Point(int i) constCSG_KDTreeinline
Get_Point(size_t i) constCSG_KDTreeinline
Get_Point_Count(void) constCSG_KDTreeinline
Get_Point_Value(size_t i) constCSG_KDTree_2Dinlinevirtual
CSG_KDTree::Get_Point_Value(int i) constCSG_KDTreeinlinevirtual
Get_Version(void)CSG_KDTreestatic
is_Okay(void) constCSG_KDTreeinline
m_DistancesCSG_KDTreeprotected
m_IndicesCSG_KDTreeprotected
m_pAdaptorCSG_KDTreeprotected
m_pKDTreeCSG_KDTreeprotected
m_PointsCSG_KDTreeprotected
operator[](int i) constCSG_KDTreeinline
operator[](size_t i) constCSG_KDTreeinline
~CSG_KDTree(void)CSG_KDTreevirtual
~CSG_KDTree_2D(void)CSG_KDTree_2Dvirtual