Trees | Indices | Help |
|
---|
|
object --+ | DataPointLocator
The DataPointLocator class is a simple utility class that allows data-points that are 'close' to a given position in space to be located easily. This class uses spatial partitioning (k-d tree) to ensure that the search for data-points is carried out in a computationally efficient manner.
The class is designed to be used in the following manner:
1) Instantiate a new DataPointLocator object. This sets up the instance ready to carry out the search. At this point the results list is empty. 2) Execute the various SearchForDataPointsWithinX methods to fill the internal results list with array-coordinates that are within the specified world-distance of the various search origins. 3) Optionally 'uniquify' the results list. 4) Examine the results list to find those points that were within the specified distances of the search origins.
|
|||
|
|||
|
|||
|
|||
|
|||
|
|||
iterable< iterable< int, 3 > >
|
|
||
Inherited from |
|
|||
iterable< iterable< int, 3 > >
|
Results This property allows access to the result list. |
||
Inherited from |
|
This function creates a new DataPointLocator instance.
|
This function searches for valid array-coordinates whose corresponding world-coordinate lies within distance of the specified world-coordinate. The array-coordinates are appended to the internal results list.
|
This function is similar to SearchForDataPointsWith, however this function accepts a list of world-coordinate search origins and a corresponding list of distances.
|
This function and the synonymous property Results allows access to the result list.
|
|
ResultsThis property allows access to the result list.
|
Trees | Indices | Help |
|
---|
Generated by Epydoc 3.0.1 on Mon May 19 23:04:59 2014 | http://epydoc.sourceforge.net |