Class KdTreeNodeFinder
Uses a KdTree<T> as internal structure for finding nodes by position.
Inheritance
System.Object
KdTreeNodeFinder
Implements
Inherited Members
System.Object.Equals(System.Object)
System.Object.Equals(System.Object, System.Object)
System.Object.GetHashCode()
System.Object.GetType()
System.Object.MemberwiseClone()
System.Object.ReferenceEquals(System.Object, System.Object)
System.Object.ToString()
Namespace: Mars.Common.Collections.Graph.Helper
Assembly: Mars.Common.dll
Syntax
public class KdTreeNodeFinder : INodeFinder
Constructors
| Improve this Doc View SourceKdTreeNodeFinder(Double)
Uses a KdTree<T> as internal structure for finding nodes by position.
Declaration
public KdTreeNodeFinder(double nodeTolerance)
Parameters
Type | Name | Description |
---|---|---|
System.Double | nodeTolerance |
Methods
| Improve this Doc View SourceAdd(Int32, Double, Double)
Uses a KdTree<T> as internal structure for finding nodes by position.
Declaration
public void Add(int key, double x, double y)
Parameters
Type | Name | Description |
---|---|---|
System.Int32 | key | |
System.Double | x | |
System.Double | y |
Get(Double, Double)
Uses a KdTree<T> as internal structure for finding nodes by position.
Declaration
public int? Get(double x, double y)
Parameters
Type | Name | Description |
---|---|---|
System.Double | x | |
System.Double | y |
Returns
Type | Description |
---|---|
System.Nullable<System.Int32> |
Nearest(Double, Double)
Uses a KdTree<T> as internal structure for finding nodes by position.
Declaration
public int? Nearest(double x, double y)
Parameters
Type | Name | Description |
---|---|---|
System.Double | x | |
System.Double | y |
Returns
Type | Description |
---|---|
System.Nullable<System.Int32> |