从点到多面体或多边形的距离 [英] Distance from a point to a polyhedron or to a polygon

问题描述

我有一个多面体表面，我想找到它与给定点之间的最小距离 P 。由于多面体是由三维空间中的多个多边形定义的，因此发生在我身上的一种方式是将距离与每个多边形进行比较并选择最短距离。我仍然不确定。

I have a surface which is a polyhedron and I want to find the minimal distance between it and a given point P. Since the polyhedron is defined by many polygons in a 3d space, one way that occurs to me is to compare the distance to each polygon and choose the shortest distance. Still I am not sure about it.

推荐答案

Gilbert-Johnson-Keerthi的实现：

http://www.comlab.ox.ac.uk/stephen .cameron /距离/ gjk2.4 /

http：/ /code.google.com/p/gjkd/

Implementations of Gilbert–Johnson–Keerthi:
http://www.comlab.ox.ac.uk/stephen.cameron/distances/gjk2.4/
http://code.google.com/p/gjkd/

这篇关于从点到多面体或多边形的距离的文章就介绍到这了，希望我们推荐的答案对大家有所帮助，也希望大家多多支持IT屋！