Cloudcompare & PCL point cloud AABB bounding box

One 、 brief introduction

Bounding box is an algorithm for solving the optimal bounding space of discrete point sets , The basic idea is to use geometry with slightly larger volume and simple characteristics （ Called bounding box ） To approximately replace complex geometric objects .（ From Baidu ） The commonly used algorithms for solving bounding boxes are AABB and OOB Algorithm , among AABB The algorithm is relatively simple , That is, the bounding box can be formed by finding the maximum and minimum values of the three dimensions of the point cloud .

Two 、 Code implementation

For related configurations, please refer to the article https://blog.csdn.net/dayuhaitang1/article/details/124503487 Non plug-in basic configuration in , The core code is as follows ：

void MainWindow::AABB()