C# 클래스 Algorithms.KdTree

파일 보기 프로젝트 열기: beginor/practice

공개 메소드들

메소드	설명
Contains ( Point2D p ) : bool
Insert ( Point2D point ) : void
KdTree ( ) : System
Nearest ( Point2D p ) : Point2D
Range ( RectHV rect ) : IEnumerable

비공개 메소드들

메소드	설명
Contains ( KdNode node, double x, double y ) : bool
Insert ( KdNode node, Point2D p, bool vertical ) : KdNode
LeftRect ( RectHV rect, KdNode node ) : RectHV
Nearest ( KdNode node, RectHV rect, double x, double y, Point2D candidate ) : Point2D
Range ( KdNode node, RectHV nrect, RectHV rect, Queue queue ) : void
RightRect ( RectHV rect, KdNode node ) : RectHV

메소드 상세

Contains() 공개 메소드

public Contains ( Point2D p ) : bool
p	Point2D
리턴	bool

Insert() 공개 메소드

public Insert ( Point2D point ) : void
point	Point2D
리턴	void

KdTree() 공개 메소드

public KdTree ( ) : System
리턴	System

Nearest() 공개 메소드

public Nearest ( Point2D p ) : Point2D
p	Point2D
리턴	Point2D

Range() 공개 메소드

public Range ( RectHV rect ) : IEnumerable
rect	RectHV
리턴	IEnumerable