Rewording the README

Author: BurningWitness

README.md

@@ -1,18 +1,18 @@
 # r-tree [![Hackage](http://img.shields.io/hackage/v/r-tree.svg)](https://hackage.haskell.org/package/r-tree)
 
-A Haskell library for [R-](https://en.wikipedia.org/wiki/R-tree) and [R\*-trees](https://en.wikipedia.org/wiki/R\*-tree).
+A Haskell library for [R-trees](https://en.wikipedia.org/wiki/R-tree) and [R\*-trees](https://en.wikipedia.org/wiki/R\*-tree).
 
 > [!NOTE]
 >
 > R-trees are self-balancing and as such can only be spine-strict.
 
 Featuring:
 
-- `Data.R2Tree.*`: two-dimensional R-tree.
+- `Data.R2Tree.*`: two-dimensional R-tree with the R\*-tree insertion algorithm.
 
   `Double`-based implementation is considered the default one;
   a `Float`-based variant is provided for cases where reduced precision is preferred,
   for example rendering.
 
-Three-dimensional R-trees are not currently available,
+Higher-dimensional R-trees are not currently provided,
 but should be trivial to add if needed.

r-tree.cabal

@@ -2,8 +2,8 @@ cabal-version: 2.2
 
 name:                   r-tree
 version:                1.0.0.0
-synopsis:               R-trees.
-description:            R/R*-trees.
+synopsis:               R-/R*-trees.
+description:            R-trees and R*-trees.
 
                         See the <https://github.com/sebastian-philipp/r-tree/blob/master/README.md README>
                         for a brief overview of the data structures included in this package.