| TerraLib 4.1

- Main Page
- Related Pages
- Modules
- Namespaces
- Classes
- Files
- Examples

- Namespace List
- Namespace Members

Classes | Functions
TeSAM Namespace Reference

This namespace contain the definitions of various Spatial Data Structures, like K-d-Tree and R-Tree, ONLY FOR INTERNAL USE (must NOT be used by anyone). More...

## Classes

class | TeGridIndex
| A class that represents a fixed grid. More...
struct | kd_node_data_single_tag
| Kd-tree node type for nodes with single elements (used by template instantiation). More...
struct | kd_node_data_set_tag
| Kd-Tree node type for nodes with multuple elements (used by template instantiation). More...
class | TeKdTreeNode
| Class that represents a node of a TeKdTree. More...
class | TeBasicKdTree
| A base class for Kd-Tree structures. More...
class | TeKdTree
| A class that represents a two dimensional K-d Tree (2-d Tree) More...
class | TeAdaptativeKdTreeNode
| Class that represents a node of a TeAdaptativeKdTree. More...
class | TeAdaptativeKdTree
| A class that represents a two dimensional K-d Tree (2-d Tree) that store data-elements into the leafs. More...
class | TeRTreeNode
| Class that represents a node of a TeRTree. More...
class | TeRTree
| A class that represents a two dimensional R-Tree. More...

## Functions

TL_DLL void | getAverage (const TeLine2D &l, double &dx, double &dy)
| Get average length os segments in each direction.
TL_DLL bool | TeSafeIntersectionsGrid (const TeLine2D &redLine, const TeLine2D &blueLine, TeINTERSECTOR2::TeVectorBoundaryIP &report, const unsigned int &redObjId=0, const unsigned int &blueObjId=0)
| Computes intersections.
template<class CONTAINER , class COMPFUNCTOR >
void | TeHoareFind (CONTAINER &A, const unsigned int &kthElement, const unsigned int &firstElement, const unsigned int &lastElement, const COMPFUNCTOR &compFunctor)
| This function partition the conteiner in two parts: k-1 elements to the left (elements less than or equals to k-th element) and the right part with all other elements (elements greater than or equal to k-th element)
template<class CONTAINER , class LESSTHANX , class LESSTHANY >
void | kdsort (CONTAINER &dataSet, const unsigned int &first, const unsigned int &last, const char &level, const LESSTHANX &lessThanCompFunctorByX, const LESSTHANY &lessThanCompFunctorByY)
| Partition the conteiner like a bidimensional K-d Tree using Hoare algorithms.

## Detailed Description

This namespace contain the definitions of various Spatial Data Structures, like K-d-Tree and R-Tree, ONLY FOR INTERNAL USE (must NOT be used by anyone).

WARNING: These data structures and algorithms MUST BE USED ONLY BY TerraLib kernel and should NOT be used by anyone because the support and interfaces can be changed in future. THIS IS FOR INTERNAL USE ONLY.

All Classes Namespaces Files Functions Variables Typedefs Enumerations Enumerator Friends Defines