Path: utzoo!news-server.csri.toronto.edu!cs.utexas.edu!swrinde!zaphod.mps.ohio-state.edu!magnus.acs.ohio-state.edu!tut.cis.ohio-state.edu!ucbvax!unisoft!hoptoad!wet!smiller
From: smiller@wet.UUCP (Gregory Shane Miller)
Newsgroups: comp.databases
Subject: Need: data structure references - PLEASE
Message-ID: <2220@wet.UUCP>
Date: 15 Mar 91 03:35:05 GMT
Organization: Wetware Diversions, San Francisco
Lines: 22


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 ]