Abstract

Teamed with 3 people to code and deploy a 2-dimensional SS Tree with a minimum of 2 nodes and a maximum of 3 nodes in each non-leaf node. A web application is the main interface for users to interact with the data structure.

About SS-Tree

The SS-Tree was created by White and Jain in 1991. It is a slightly modified version of the R*-Tree. Which use minimum bounding hyperspheres instead of minimum bounding hyperrectangles to group points. The center of each minimum bounding hypersphere is the centroid of their respective data points. The key aspects why the SS-Tree is created using hyperspheres rather than hyperrectangles are:

• Specifying a minimum bounding hypersphere requires approximately 50% less storage than specifying a minimum bounding hyperrectangle.
• The nodes have a property called rotation invariance.

Insert

To insert, just click on any point in the canvas and a leaf node will be created. The node will be a point of color red if it is a leaf node. If it has children, it will be a circle of some random color containing its children.

Delete

To delete, just click on any leaf node (red point) and it will be deleted.