Movatterモバイル変換

[0]ホーム
URL:

Skip to content

Navigation Menu

Search code, repositories, users, issues, pull requests...

Provide feedback

We read every piece of feedback, and take your input very seriously.

Saved searches

Use saved searches to filter your results more quickly

 Sign up

Bisector tree implementation in OCaml

License

NotificationsYou must be signed in to change notification settings

UnixJunkie/bisec-tree

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 

Repository files navigation

Bisector tree implementation in OCaml.

A bisector tree allows to do fast and exact nearest neighbor searchesin any space provided that you have a metric (function) to measure thedistance between any two points in that space.

Cf. this article for details:"A Data Structure and an Algorithm for the Nearest Point Problem";Iraj Kalaranti and Gerard McDonald.ieeexplore.ieee.org/iel5/32/35936/01703102.pdf

Bunny

Figure: the Stanford bunny, consisting of 35947 3D points, guillotinedby the first layer of a bisector tree.

[8]ページ先頭
©2009-2025 Movatter.jp