| Home | Trees | Indices | Help |
|
|---|
|
|
Find neighboring points in descretized space
If input space is descretized and all points fill in N-dimensional cube, this finder returns list of neighboring points for a given distance.
As input points it operates on discretized values, not absolute coordinates (which are e.g. in mm)
|
|||
|
|||
|
|||
|
|||
|
|||
|
|||
|
Inherited from Inherited from |
|||
|
|||
filter_coord = property(fget= _getFilter, fset= _setFilter)
|
|||
elementsize = property(fget= lambda self: self.__elementsize)
|
|||
|
|||
|
Inherited from |
|||
|
|||
|
Returns coordinates of the neighbors which are within distance from coord XXX radius might need to be not a scalar but a vector of scalars to specify search distance in different dimensions differently... but then may be it has to be a tensor to specify orientation etc? :-) so it might not be necessary for now
|
| Home | Trees | Indices | Help |
|
|---|
| Generated by Epydoc 3.0beta1 on Mon Feb 23 10:49:52 2009 | http://epydoc.sourceforge.net |