-1

Minimum Bounding Rectangles is a pre-requisite for R-Tree creation. What algorithm does Boost C++ library use for MBR creation given a set of points?

user11233302
  • 1
  • 1
  • Your question is rather broad. The title of your question in google has many answers. [How to as a good question](https://stackoverflow.com/help/how-to-ask) – lakeweb Mar 20 '19 at 18:20

1 Answers1

0

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.

Has QUIT--Anony-Mousse
  • 76,138
  • 12
  • 138
  • 194