My question is regarding finding the vector corresponding to minimum distance between sphere and a polyhedron, or a point and a polyhedron. Is there a way to find the relevant vector corresponding to minimum distance between two 3D objects using DJK algorithm, or any other algorithm without using numerical methods?
Asked
Active
Viewed 44 times
0
-
How are your faces represented? The simplest solution is to check all faces for their minimum distance to the sphere/point. From those, choose the minimum. How exactly you do that depends on the face type. – Nico Schertler Oct 19 '22 at 04:57
-
@D.L, so far, I am researching for an idea to begin with and I haven't made any code yet. I am trying to mathematically device an algorithm to write the code. – Thinesh Oct 19 '22 at 06:37
-
@NicoSchertler, I am planning to define the polyhedron by defining the vertices. I think in the case of calculation from each face, first I have to calculate the distance from each edge and, then the face bounded by the edges right? Could you give me an example of calculation from each face? – Thinesh Oct 19 '22 at 06:37