Description: The use of C to achieve the R-tree, you can automatically generate a large number of rectangular or modify their own fixed rectangular input. The smallest expansion in accordance with the principles and the classical algorithm Guttman structure. After testing, the results of constructing the smallest MBR are correct.
To Search:
File list (Check if you may need any files):
cygwin1.zip
rtree
.....\allocate.c
.....\assert.h
.....\clock.c
.....\color_feature.query
.....\color_feature.txt
.....\cygwin1.dll
.....\error.c
.....\graphics.c
.....\index.c
.....\index.h
.....\linear.exe
.....\linear.exe.stackdump
.....\macros.h
.....\main.c
.....\Makefile
.....\newtid.c
.....\node.c
.....\options.h
.....\printstats.c
.....\README
.....\rectangle.c
.....\sccs.h
.....\small.ca
.....\split.l.c
.....\split.l.h
.....\split.o.h
.....\y.spec
.....\y.tab.c
Download