Re: [Algorithms] Quadtree / Octtree neighbors
Brought to you by:
vexxed72
From: Sam K. <sa...@ip...> - 2000-08-04 12:36:11
|
Kelvin, We had a bit of a discussion on exactly this a couple of weeks ago, check the archive and see if you can find anything of use. I *think* we established that other than using a cubic hash table (for the octree case) indexed by position of a node in 3d, and using up tons of memory, that the only way to achieve this is to jump back up the tree and down neighbouring branches to find connectivity. But as Thatcher mentions, this probably isn't as bad as it would seem, like half the time you are jumping up one level, a quater of the time 2 levels, a 8th of the time 3 etc.. Check his post for more on this. If you find anything else, I'd be interested in hearing it. Regards, Sam Kuhn I!Play Ltd. sa...@ip... -----Original Message----- From: Kelvin McDowell <ke...@re...> To: 'gda...@li...' <gda...@li...> Date: 03 August 2000 8:52 PM Subject: [Algorithms] Quadtree / Octtree neighbors >I need to construct a graph which connects all the neighboring nodes of a >quadtree and octree. For each leaf node I need to determine all the other >leaves that border on it. Does anyone know of an elegant way of doing this? > >Kelvin McDowell > >_______________________________________________ >GDAlgorithms-list mailing list >GDA...@li... >http://lists.sourceforge.net/mailman/listinfo/gdalgorithms-list |