Re: [Algorithms] Octree leaf neighbours

[Martin G. <bz...@wi...>]

Sorry, it's my fault. I was addressing regular octrees and my point was that
implicit representation lets you avoid the parent links. Of course this does
not apply yo your case. Apologies :)

-----Original Message-----
From: Sam Kuhn <sa...@ip...>
To: gda...@li...
<gda...@li...>
Date: 16 Þëè 2000 ã. 22:40
Subject: Re: [Algorithms] Octree leaf neighbours


>>Martin Gladnishki wrote:
>>And in addition you can save much time if you hold the tree in an array.
>This
>>saves the parent links, too :)
>
>Erm, I mentioned this in my origional post... dont you have to store a 3d
>(i.e. *big*) hash table so you can hash to the neighbours in the array using
>the coordinates of the node you are in?
>How does it save the parent links then?
>
>sam
>
>
>
>_______________________________________________
>GDAlgorithms-list mailing list
>GDA...@li...
>http://lists.sourceforge.net/mailman/listinfo/gdalgorithms-list
>