liht@amtfocus.amt.gss.mot.com (Lih-Shyng Tzeng) (03/04/91)
I need to implement an indexing mechanism to store non-overlapping 2-D spatial objects for efficient retrieval. Right now, I have identified *R-Tree* as a possible candidate for implementation. But, before I implement it I would like to know if there are better methods than R-tree for what I intend to do. If you have implemented the R-tree or any other methods in the past, can you share your code with me to save me some time? Your help is highly appreciated. Please respond by e-mail. Thanks. -- Lih-Shyng Tzeng, Motorola Inc. 1501 W. Shure Drive, M/S S144, Arlington Heights, IL 60004 (voice) 708-632-6504 | (fax) 708-632-6545 | (e-mail) liht@mot.com