Re: [Meshlab-devel] octree

[fabio g. <fab...@gm...>]

The files in /vcglib/vcg/space/index implement a few spatial indexing 
data structures
and algorithms (regular grid, octree, spatial hashing..) with a common 
interface.
This means that you have function to get the closest k elements in the 
spatial index
without caring if it is a grid or an octree. See  
vcg/complex/trimesh/closest.h to get the picture of how it is done. Even 
better, look at the project metro in vcglib/apps/metro which computes 
"point to mesh" distance with (optionally) all the spatial indexing data 
structures.

At the present the spatial indexing ds include vicinity tests and 
(ordered) ray intersection test, but no z sorting and no generic BSP.

cheers,
Fabio


> I'm looking to create a binary space partitioning (BSP) tree in 
> meshlab, to use when rendering on another platform for correct 
> z-sorting.  I noticed two files already present: octree.h in 
> /vcglib/vcg/space/index, and aabb_binary_tree.h in 
> /vcglib/vcg/space/index (written by m_di_benedetto 
> <http://sourceforge.net/users/m_di_benedetto/>)?  Does anyone know 
> what these files do, and if they could be of any use for what i'm 
> trying to do?
>
> thanks
> imran
> ------------------------------------------------------------------------
>
> -------------------------------------------------------------------------
> This SF.Net email is sponsored by the Moblin Your Move Developer's challenge
> Build the coolest Linux based applications with Moblin SDK & win great prizes
> Grand prize is a trip for two to an Open Source event anywhere in the world
> http://moblin-contest.org/redirect.php?banner_id=100&url=/
> ------------------------------------------------------------------------
>
> _______________________________________________
> Meshlab-devel mailing list
> Mes...@li...
> https://lists.sourceforge.net/lists/listinfo/meshlab-devel
>