Home | Trees | Indices | Help |
|
---|
|
object --+ | distance_to_pointset
First and second maximum and/or minimum distances of a point q to a set of points, returning a dictionary keyed by 'min' and 'max' to dictionaries keyed by integers 1 and 2 (respectively). The values of this dictionary are dictionaries of 'd' -> distance 'pos' -> index into pts To restrict the search to a lower-dimensional subspace, specify a sub-set of the variables in q. Defaults to Euclidean distance (normord=2),otherwise specify metric-defining norm order. To speed up the search, use n > 1 to create n segments of the pointset, from which representative points will first be assessed, before the search narrows to a particular segment. Be sure to use a large enough n given the variation in each segment (which will otherwise cause spurious results for certain test points). Default n=30. [NB This option currently only returns the first max/min distances] The radius option provides an opportunity to use information from a previous call. This works for minimum distances only, and forces the same segment to be searched, provided that the new point is within the radius of the previous point (using 2-norm unless a 2D Point is specified). CURRENTLY, THIS DOES NOT WORK WELL. KEEP IT SWITCHED OFF USING (default) radius=0. If gen is not None, it should contain a generator for use with isochron-related events, for more accurate computations. The remaining arguments are associated with this usage.
|
|||
|
|||
|
|||
|
|||
|
|||
|
|||
|
|||
|
|||
Inherited from |
|
|||
_keys =
|
|
|||
Inherited from |
|
x.__init__(...) initializes x; see x.__class__.__doc__ for signature
|
Home | Trees | Indices | Help |
|
---|
Generated by Epydoc 3.0.1 on Sun Dec 2 23:44:23 2012 | http://epydoc.sourceforge.net |