Path: utzoo!utgpu!news-server.csri.toronto.edu!bonnie.concordia.ca!thunder.mcrcim.mcgill.edu!snorkelwacker.mit.edu!usc!zaphod.mps.ohio-state.edu!uakari.primate.wisc.edu!aplcen!aplcomm!uunet!infonode!fermat!crack
From: crack@fermat.b17a.ingr.com (H. Bret Young)
Newsgroups: comp.graphics
Subject: Need some R-tree info
Keywords: R-tree
Message-ID: <1991Jun19.174945.18380@infonode.ingr.com>
Date: 19 Jun 91 17:49:45 GMT
Sender: usenet@infonode.ingr.com (Usenet Administrator)
Reply-To: crack@fermat.b17a.ingr.com
Organization: Intergraph Mapping Data Management
Lines: 19


I am doing some work with R-tree's and would like to find some references
on them. In particular, I need references to node splitting algorithms, 
especially ones that try to minimize overlap. Any help will be appreciated.
I am familiar with Samet's book(s) on spatial data structures and Guttman's
1984 ACM-SIGMOD paper.

                                Thanks,
-- 
				Bret
-- 
********************************************************************************
*  H. Bret Young                              *   U.S.MAIL -                   *
*  UUCP:   ...!uunet!ingr!b17a!fermat!crack   *   Intergraph Corporation       *
*  INTERNET:   crack@fermat.b17a.ingr.com     *   Mail Stop IW17A2             *
*  Big Brother:  (205) 730-7707               *   Huntsville, AL  35894-0001   *
********************************************************************************
* Humor is the foundation of a democratic society                              *
********************************************************************************