From 295f6488beb573341bb02c97d6849af7e40ffd4e Mon Sep 17 00:00:00 2001 From: Sven Oesau Date: Mon, 10 Feb 2025 17:15:56 +0100 Subject: [PATCH] documenting that Median_of_rectangle splitter is robust bugfix --- .../doc/Spatial_searching/Spatial_searching.txt | 6 +++++- 1 file changed, 5 insertions(+), 1 deletion(-) diff --git a/Spatial_searching/doc/Spatial_searching/Spatial_searching.txt b/Spatial_searching/doc/Spatial_searching/Spatial_searching.txt index f4e3d7832a5..9ccd82722ed 100644 --- a/Spatial_searching/doc/Spatial_searching/Spatial_searching.txt +++ b/Spatial_searching/doc/Spatial_searching/Spatial_searching.txt @@ -175,9 +175,13 @@ because in general the query time will be less than using the default value. Instead of using the default splitting rule `Sliding_midpoint` described below, a user may, depending upon the data, select one from the following splitting rules, -which determine how a separating hyperplane is computed. Every splitter has +which determine how a separating hyperplane is computed. Some splitter have degenerated worst cases, which may lead to a linear tree and a stack overflow. Switching the splitting rule to one of a different kind will solve the problem. +The `Median_of_rectangle` and `Median_of_max_spread` are robust sliders that will +neither lead to a linear tree nor to a stack overflow. The `Median_of_rectangle` +splitter will detect if the data in a node is degenerated and applies the +`Median_of_max_spread` rule for that node to avoid a linear tree.