使用CGAL AABBTree计算点到obj模型的距离

最新推荐文章于 2024-12-03 01:14:37 发布

Annora-W

最新推荐文章于 2024-12-03 01:14:37 发布

阅读量3.2k

点赞数 5

分类专栏： CGAL 文章标签： visual studio CGAL AABBTree

本文链接：https://blog.youkuaiyun.com/wwanrong/article/details/78831580

版权

本文档介绍了如何利用CGAL库中的AABBTree计算点到OBJ模型的最短距离。首先，需要读取OBJ模型并构建AABB树，然后通过调用`accelerate_distance_queries()`加速查询。距离查询有两种方式：`closest_point`和`closest_point_and_primitive`，后者还能提供投影面的信息。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

文档：https://doc.cgal.org/latest/AABB_tree/index.html

文档中关于距离计算的实现：

Distance. An AABB tree computes the closest point from a given point query to the input primitives through the function AABB_tree::closest_point(). In addition, it can compute the id of the closest primitive from a given point query through the function AABB_tree::closest_point_and_primitive(), i.e., the id of the primitive which realizes the minimum distance from the point query. The AABB tree uses a secondary search structure to speed up the distance queries. The construction of this secondary structure should be requested by the user by a call to AABB_tree::accelerate_distance_queries() before the first the distance computation. This data structure is not generated by default because it is used only for distance computations.

操作方式如下：