Subject: [ggl] spacial index construction interface
From: Barend Gehrels (barend)
Date: 2011-03-08 13:09:01
On 8-3-2011 10:57, Bruno Lalande wrote:
> If a tree is three levels deep, I might imagine that only the
> deepest level is a leaf, and there rest are nodes including
> containers to contain deeper levels. No virtual methods then. As a
> sort of compile-time tree. But I'm not sure if this is feasable.
> Didn't work it out.
> Interesting. Indeed if the depth of the tree is known/selectable at
> compile-time, it might be interesting to build the tree statically.
> But isn't the depth of an rtree supposed to be dynamic? (i.e. depend
> on the number of things inserted into the structure at runtime)
Yes, probably static behaviour might be part of another spatial index,
not specific for the rtree with dynamic levels. Pleads for the generic
interface of spatial indexes.
Anyway this is the only interface with complete lack of virtual
functions and dynamic memory (apart from the std::vector or deque) I can
currently think of.
-------------- next part --------------
An HTML attachment was scrubbed...
Geometry list run by mateusz at loskot.net