Interval Multi B Tree
Mostrando 1-1 de 1 artigos, teses e dissertações.
-
1. Uma proposta para a triangulação de Delaunay 2D e localização planar de pontos em OCaml
In this thesis, it is presented a planar point location algorithm. The algorithm was developed on top of two elements: - the method of slabs to divide the planar subdivision, is represented by a graph, allowing the fast identification of the region where the point being recalled is; - the Interval Multi-B-tree, a data structure derived from the B-tree, prepa
Publicado em: 2006