use linear<16,4> splitting algorithm (faster running tests)

2014-11-05 18:41:07 +00:00
parent dfd9e9ce36
commit 44570c1d30
1 changed files with 1 additions and 1 deletions
--- a/include/mbgl/text/collision.hpp
+++ b/include/mbgl/text/collision.hpp
@@ -27,7 +27,7 @@ namespace bgi = bg::index;
 typedef bgm::point<float, 2, bg::cs::cartesian> Point;
 typedef bgm::box<Point> Box;
 typedef std::pair<Box, PlacementBox> PlacementValue;
-typedef bgi::rtree<PlacementValue, bgi::rstar<16>> Tree;
+typedef bgi::rtree<PlacementValue, bgi::linear<16,4>> Tree;

 class Collision {