(index ("make-point3d" 0) ("point3d?" 123) ("point3d-x" 217) ("point3d-y" 217) ("point3d-z" 217) ("list->kd-tree" 466) ("kd-tree?" 624) ("kd-tree-empty?" 781) ("kd-tree-is-valid?" 955) ("kd-tree-all-subtrees-are-valid?" 1274) ("kd-tree->list" 1475) ("kd-tree->list*" 1621) ("kd-tree-subtrees" 1868) ("kd-tree-point" 1960) ("kd-tree-map" 2043) ("kd-tree-for-each" 2099) ("kd-tree-for-each*" 2165) ("kd-tree-fold-right" 2233) ("kd-tree-fold-right*" 2303) ("kd-tree-nearest-neighbor" 2375) ("kd-tree-near-neighbors" 2457) ("kd-tree-near-neighbors*" 2535) ("kd-tree-k-nearest-neighbors" 2615) ("kd-tree-slice" 2703) ("kd-tree-slice*" 2763) ("kd-tree-remove" 2825))
(def (sig (procedure "make-point3d:: DOUBLE * DOUBLE * DOUBLE -> POINT3D" (id make-point3d))) (p "3D point constructor."))
(def (sig (procedure "point3d? :: POINT3D -> BOOL" (id point3d?))) (p "3D point predicate."))
(def (sig (procedure "point3d-x :: POINT3D -> DOUBLE" (id point3d-x)) (procedure "point3d-y :: POINT3D -> DOUBLE" (id point3d-y)) (procedure "point3d-z :: POINT3D -> DOUBLE" (id point3d-z))) (p "Accessors for the x,y,z coordinates of a 3D point."))
(def (sig (procedure "list->kd-tree:: POINT3D LIST  -> KD-TREE" (id list->kd-tree))) (p "Given a list of points, constructs and returns a K-D tree object."))
(def (sig (procedure "kd-tree? :: KD-TREE -> BOOL " (id kd-tree?))) (p "Returns " (tt "#t") " if the given object is a K-D tree, " (tt "#f") " otherwise."))
(def (sig (procedure "kd-tree-empty? :: KD-TREE -> BOOL  " (id kd-tree-empty?))) (p "Returns " (tt "#t") " if the given K-D tree object is empty, " (tt "#f") " otherwise."))
(def (sig (procedure "kd-tree-is-valid? :: KD-TREE -> BOOL  " (id kd-tree-is-valid?))) (p "Checks whether the K-D tree property holds for the given tree. Specifically, it tests that all points in the left subtree lie to the left of the plane, p is on the plane, and all points in the right subtree lie to the right."))
(def (sig (procedure "kd-tree-all-subtrees-are-valid? :: KD-TREE -> BOOL " (id kd-tree-all-subtrees-are-valid?))) (p "Checks whether the K-D tree property holds for the given tree and all subtrees."))
(def (sig (procedure "kd-tree->list :: KD-TREE -> POINT3D LIST" (id kd-tree->list))) (p "Returns a list with the points contained in the tree."))
(def (sig (procedure "kd-tree->list* :: KD-TREE -> (INT . POINT3D) LIST " (id kd-tree->list*))) (p "Returns a list where every element has the form " (tt "(i . p)") ", where i is the relative index of this point, and " (tt "p") " is the point."))
(def (sig (procedure "kd-tree-subtrees :: KD-TREE -> KD-TREE LIST" (id kd-tree-subtrees))))
(def (sig (procedure "kd-tree-point :: KD-TREE -> POINT3D  " (id kd-tree-point))))
(def (sig (procedure "kd-tree-map " (id kd-tree-map))))
(def (sig (procedure "kd-tree-for-each " (id kd-tree-for-each))))
(def (sig (procedure "kd-tree-for-each* " (id kd-tree-for-each*))))
(def (sig (procedure "kd-tree-fold-right " (id kd-tree-fold-right))))
(def (sig (procedure "kd-tree-fold-right* " (id kd-tree-fold-right*))))
(def (sig (procedure "kd-tree-nearest-neighbor " (id kd-tree-nearest-neighbor))))
(def (sig (procedure "kd-tree-near-neighbors " (id kd-tree-near-neighbors))))
(def (sig (procedure "kd-tree-near-neighbors* " (id kd-tree-near-neighbors*))))
(def (sig (procedure "kd-tree-k-nearest-neighbors " (id kd-tree-k-nearest-neighbors))))
(def (sig (procedure "kd-tree-slice " (id kd-tree-slice))))
(def (sig (procedure "kd-tree-slice* " (id kd-tree-slice*))))
(def (sig (procedure "kd-tree-remove " (id kd-tree-remove))))
