Boost R-Tree中的最小边界矩形计算
[英]Minimum Bounding Rectangle calculation in Boost R-Tree
问题描述
Minimum Bounding Rectangles is a pre-requisite for R-Tree creation.
最小边界矩形是创建 R 树的先决条件。 What algorithm does Boost C++ library use for MBR creation given a set of points?给定一组点，Boost C++ 库使用什么算法来创建 MBR？
1 个解决方案
解决方案1
0 2019-03-20 18:55:42
Probably the obvious one.可能是显而易见的。
Iterate over the contents and store the minimum bounds.迭代内容并存储最小边界。
That is O(n) and you can't do any better than O(n), at the same time the algorithm is as easy a it gets, so it will come with small constant factors, too.那是 O(n) 并且你不能做得比 O(n) 更好，同时算法很简单，所以它也会带有小的常数因子。
声明:本站的技术帖子网页，遵循CC BY-SA 4.0协议，如果您需要转载，请注明本站网址或者原文地址。任何问题请咨询:yoyou2525@163.com.
相关问题
如何迭代一个提升R树？ - How to iterate over a boost R-tree?
在 boost r-tree 中存储或访问对象 - Storing or accessing objects in boost r-tree
增强几何中点的最小定向边界矩形 - Minimum oriented bounding rectangle of points in boost geometry
将原始指针存储在Boost R树中的问题 - Issue storing raw pointers in boost R-tree
Boost r-tree“正确”访问对象的方式 - Boost r-tree "correct" way to access objects
Boost R-tree：计算满足查询条件的元素 - Boost R-tree : counting elements satisfying a query
为什么此Boost R-tree代码无法编译？ - Why won't this Boost R-tree code compile?
K均值聚类R树提升 - K-mean Clustering R-Tree boost
如何检查boost r-tree中的任何2d点是否在给定的三角形中？ - How to check if any 2d point in boost r-tree is in a given triangle?
Boost r树在内存与映射文件中的性能差异 - Performance difference of Boost r-tree in memory vs. mapped file
相关标签