Opened 15 years ago
Closed 15 years ago
#823 closed task (fixed)
KDTree data structure
Reported by: | Jorge | Owned by: | Jorge |
---|---|---|---|
Priority: | highest | Milestone: | TOL Extensions |
Component: | Math | Version: | 2.0.1 |
Severity: | critical | Keywords: | |
Cc: |
Description
Implement an API for ANN
the kd-tree implemented there is an efficient data structure to perform nearest neighbourhood searches.
Change History (15)
comment:1 Changed 15 years ago by
Status: | new → accepted |
---|
comment:2 Changed 15 years ago by
Resolution: | → fixed |
---|---|
Status: | accepted → closed |
comment:3 Changed 15 years ago by
comment:6 Changed 15 years ago by
comment:7 Changed 15 years ago by
An example of how to use kd-tree data structure:
Real dim = 2; Matrix XY = Rand( 100000, dim, 0, 1 ); Real id = KDTree.New( XY ); Real k = 10; Set KDTree.KSearch( id, Rand( 10000, dim, 0, 1 ), k ); Real KDTree.Delete( id );
comment:8 Changed 15 years ago by
comment:10 Changed 15 years ago by
comment:11 Changed 15 years ago by
comment:12 Changed 15 years ago by
Resolution: | fixed |
---|---|
Status: | closed → reopened |
Indexes of arrays in TOL are 1-based instead of 0-based used in C/C++
comment:13 Changed 15 years ago by
Resolution: | → fixed |
---|---|
Status: | reopened → closed |
comment:14 Changed 15 years ago by
Component: | Various → Math |
---|---|
Resolution: | fixed |
Status: | closed → reopened |
When the number of searched neighbours is great than the number of reference points library ANN crash showing no message.
comment:15 Changed 15 years ago by
Resolution: | → fixed |
---|---|
Status: | reopened → closed |
Note: See
TracTickets for help on using
tickets.
(In [1860]) fix #823