Hi everyone, I have a question regarding the quadtree implementation of the spatial module of Lucene. Does the quadtree implementation (QuadPrefixTree) explicitly build a tree structure and store this information? I have gone over the QuadPrefixTree class, but from what I understand it mainly uses the spatial prefix partitioning strategy of the MX-quadtree (but not the internal nodes). Are the internal nodes (e.g. for a 4-level tree prefix ABDA, are the spatial regions of ABD and/or AB) of the quadtree used during query processing?
Any replies are much appreciated. Thanks! Parth -- View this message in context: http://lucene.472066.n3.nabble.com/Lucene-Spatial-Question-Is-a-tree-structure-explicitly-created-in-the-QuadPrefixTree-implementation-tp4162038.html Sent from the Lucene - Java Users mailing list archive at Nabble.com. --------------------------------------------------------------------- To unsubscribe, e-mail: java-user-unsubscr...@lucene.apache.org For additional commands, e-mail: java-user-h...@lucene.apache.org
