package oktree
sectionYPositions = computeSectionYPositions($el), 10)"
x-init="setTimeout(() => sectionYPositions = computeSectionYPositions($el), 10)"
>
On This Page
OKtree: A simple octree implementation in OCaml
Install
dune-project
Dependency
Authors
Maintainers
Sources
v0.2.4.tar.gz
md5=d924fe6464176f50901fd5850eaa4dc6
sha512=d1291d99105b426cbc68a1f26ea9760a5b17ddc44de2d99325dcf7a57234a7cac1d2a0837f49949604281f625c8ce2b02ae3ce2ae580611c448dbe64367e466f
doc/index.html
OKtree
OKtree is a simple octree implementation in OCaml, intended to efficiently find the nearest match for an arbitrary point among a set of target points in 3D coordinate space.
An octree is a tree data structure in which each internal node has exactly eight children. Octrees are most often used to partition a three-dimensional space by recursively subdividing it into eight octants. Octrees are the three-dimensional analog of quadtrees. — Wikipedia
The original use case for this library was finding nearest match in a palette of RGB colours.
- Aims to be faster than not using an octree, does not claim to be world's fastest octree.
- Fast insertions are not a goal. Use-case is: create a tree once, match points many times.
Basic Usage
A tree is generated from a list of 3D points.
OKtree defines a VEC3 module type for the points. This is deliberately compatible with the Gg library's Gg.V3 module type.
So first we instantiate the Oktree functor, then add points:
open Gg
module Okt = Oktree.Make (V3)
let points = [ V3.zero; V3.v 0. 0.251 0.; V3.v 0. 0.23 0.; V3.v 0.2 0.1 0.2 ]
let okt = Okt.of_list ~leaf_size:8 points
Format.printf "%a" Okt.pp okt;;
(*
{ Oktree.Make.leaf_size = 8;
tree =
(Oktree.Make.Leaf
[(0.000000, 0.000000, 0.000000); (0.000000, 0.251000, 0.000000);
(0.000000, 0.230000, 0.000000); (0.200000, 0.100000, 0.200000)])
}- : unit = ()
*)
(* find closest match from [points] *)
let nearest = Okt.nearest okt (V3.v 0.2 0.1 0.3)
Format.printf "%a" V3.pp nearest;;
(* (0.2 0.1 0.2)- : unit = () *)Interface
Okt.of_listbuilds a tree from list of points;~leaf_sizecontrols max points per leaf before splitting (optional, default:16).Okt.nearestfinds the closest point in the tree to a given query point.Okt.insertreturns a new tree with the point added.Okt.to_listreturns list of points in tree.Okt.ppis a printer of trees, for use withFormat.printfand friends.
Documentation
- Oktree - Main API reference
- User Guide - Comprehensive guide with examples
Project
sectionYPositions = computeSectionYPositions($el), 10)"
x-init="setTimeout(() => sectionYPositions = computeSectionYPositions($el), 10)"
>
On This Page