Introduction.

Author: Jaybro

CMakeLists.txt

@@ -5,7 +5,7 @@ cmake_minimum_required(VERSION 3.11)
 project(pico_tree
     LANGUAGES CXX
     VERSION 0.4.0
-    DESCRIPTION "PicoTree is a small C++ header only library that provides several data structures that can be used for range searches and nearest neighbor searches."
+    DESCRIPTION "PicoTree is a small C++ header only library that provides a KdTree that can be used for range searches and nearest neighbor searches."
     HOMEPAGE_URL "https://github.com/Jaybro/pico_tree")
 
 if (NOT CMAKE_BUILD_TYPE)

README.md

@@ -2,7 +2,7 @@
 
 [![build-and-test](https://github.com/Jaybro/pico_tree/workflows/build-and-test/badge.svg)](https://github.com/Jaybro/pico_tree/actions?query=workflow%3Abuild-and-test)
 
-PicoTree is a small C++ header only library that provides several data structures that can be used for range searches and nearest neighbor searches.
+PicoTree is a small C++ header only library that provides a KdTree that can be used for range searches and nearest neighbor searches.
 
 See the comparison [benchmark](./docs/benchmark.md) between PicoTree and [nanoflann](https://github.com/jlblancoc/nanoflann) to get an impression of the performance provided by the [KdTree](https://en.wikipedia.org/wiki/K-d_tree) of this library.
 
@@ -19,7 +19,7 @@ Available under the [MIT](https://en.wikipedia.org/wiki/MIT_License) license.
 The examples show how PicoTree can be used:
 
 * Creating an [adaptor](./examples/pico_common/pico_adaptor.hpp) to interface with input point clouds.
-* Searching using the [Kdtree](./examples/kd_tree/kd_tree.cpp) and creating a custom search visitor (for finding approximate nearest neighbors).
+* Searching using the [KdTree](./examples/kd_tree/kd_tree.cpp) and creating a custom search visitor (for finding approximate nearest neighbors).
 * Using [Eigen](./examples/eigen/) data types.
 
 # Requirements