smiller@wet.UUCP (Gregory Shane Miller) (03/14/91)
Wed. 13 March 1991 I am looking for references to the following: [a] R-TREEs which are used to store and retrieve polygons. I would like to get an article which gives a definition so I implement the data structure and surrounding access algorithms. [b] A data structure which stores areas covered by simple polygons polygons efficiently (eg. like the segment tree which stores line intervals with logorithmic access). [c] Finally a data structure which could store a simple polygon which also tell me, for example, when one polygon intersects another. Does R-TREE already encompass all these features? Please send any information to smiller@wet.UUCP. I'll post a summary if required. Thanks. -- -- G. Shane Miller [ smiller@wet.UUCP ] out!