• Implementation of R-Tree data structure in C.
• Quadratic-Cost algorithm used for deciding node splitting.
• Well commented code.
• Visual examples present for easier understanding.

1. Make sure you are in the R-Tree folder
2. Run make command
3. If 'make' command gives a warning then run make clean and run make command again.
4. Run ./runTree command

1. 2020A7PS0037P Abhay Narendran
2. 2020B3A70779P Archisha Metha
3. 2020A7PS1214P Darshan Abhaykumar
4. 2020B1A71602P Saloni Bhandari
5. 2020B3A70817P Shrestha Sharma

Antonin Guttman. 1984. R-trees: a dynamic index structure for spatial searching. SIGMOD Rec. 14, 2 (June 1984), 47–57. https://doi.org/10.1145/971697.602266

Antonin Guttman. 1984. R-trees: a dynamic index structure for spatial searching. In Proceedings of the 1984 ACM SIGMOD international conference on Management of data (SIGMOD '84). Association for Computing Machinery, New York, NY, USA, 47–57. https://doi.org/10.1145/602259.602266