|
Geometry :
|
Another strange question, please.
š
Currently, rtree code deals with continious data values. Each value is treated as a spatial coordinate. The question is: would it be painful to treat some coodinates as 32, 64 or 128 bits bitsets? In other words, is it possible to refactor R-Tree to Generalized Index Search Tree?
š
Without messing too much the code, of course,
š
Thanks.
Geometry list run by mateusz at loskot.net