Is there any documented free R-Tree implementation for .NET?
I found some open source R-Tree implementations in C#, but none with documentation nor signs of being used by someone else than the developer. ...
r-tree
R-tree implementation in matlab
Hi please, any one tell me how we can implement the R-tree structure in matlab to speed the image retrieval system , I would like to inform you that my database space a feature vector of Color Histogram (Multidimensional ) and also I I have a distance vector for similarity measure... thanks ...
Does iPhone SQLite implement SQLite's R*Tree Module?
Was wondering whether this was the case because R-tree is the best way to search for points in a rectangle as well as events within ranges (according to SQLite Documentation). However given 1.) the iPhones spatially endowed SDK adn 2.) that R-Tree needs to be specifically installed as part of SQLite, it may not be included. ...
How to start with an R-tree index in IBM Informix
I have an assignment in which I need to build R-tree indexes on a table and query them. But I am not getting proper tutorial or guide which specifically deals with R-tree in IBM Informix and querying an R-tree. I tried to Google but without much success. Can anyone can provide me with a good startup? ...
Intersecting boundaries with lucene
I'm using Lucene, and I'm trying to find a way to index and retrieve documents that have a ranged property. For example I have: Document 1: Price:[30 TO 50] Document 2: Price:[45 TO 60] Document 3: Price:[60 TO 70] And I would like to search for all the documents whose ranges intersect a specific interval, in the above example, if I ...
C++ R - tree implementation wanted
Hi, Does anyone know good and simple to use in production code R-tree (actually, any implementations - R*, R+ or PR-tree would be great)? It doesn't matter if it is a template or library implementation, but some implementations that google found look very disappointing... Thanks in advance. ...
R Tree 50,000 foot overview?
I'm working on a school project that involves taking a lat/long point and finding the top five closest points in a known list of places. The list is to be stored in memory, with the caveat that we must choose an "appropriate data structure" -- that is, we cannot simply store all the places in an array and compare distances one-by-one in...
Which applications use R-Trees?
Besides GIS applications, which other applications or libraries use R-trees and its variants? ...
How to use R-Tree for plotting large number of map markers on google maps
After searching SO and multiple articles I haven't found a solution to my problem. What I am trying to achieve is to load 20,000 markers on Google Maps. R-Tree seems like a good approach but it's only helpful when searching for points within the visible part of the map. When the map is zoomed out it will return all of the points and....
An algorithm to space out overlapping rectangles?
This problem actually deals with roll-overs, I'll just generalized below as such: I have a 2D view, and I have a number of rectangles within an area on the screen. How do I spread out those boxes such that they don't overlap each other, but only adjust them with minimal moving? The rectangles' positions are dynamic and dependent on us...
Similarity search between time series in Matlab. Possible ? I cant find R-tree implementation in matlab
Hi there, I would like to implement similarity search in matlab. I wanna to know is it possible ? My plan is to do use 2 popular similarity measurement which are Euclidean Distance and Dynamic Time Warping. Both of these will be applied on time series dataset. My question at this point is how can I evaluate both of these two measurem...
Decent (r-tree, quad-tree or similar) library in ruby for searching spatial data
I have a database of 20k+ cities with latitude and longitude and I need to make lot of nearest point queries (which city is the nearest to certain lat,long point) against this dataset. I guess an R-Tree or QuadTree would be a perfect data structure for this, but I haven't been able to find a working ruby implementation. Do you know any...
Can R-Trees maintain z-order when using 2 dimensions?
I'm writing an implementation of an R-Tree based on Guttman's original paper. I was thinking about using an R-Tree for a program I'm writing that involves a lot of rectangles on the screen that can be moved/re-sized with the mouse. I want to efficiently only select rectangles that are in a particular rectangle and draw them (instead of...