Jump to content
Posted 30 September 2005 - 09:41 AM
Posted 30 September 2005 - 12:00 PM
Posted 30 September 2005 - 06:10 PM
Quote:A frequent approach is to start with the simplex from the previous call to the algorithm (for the given pair of objects). The first time around just use one point.
Original post by Gorwooken
Also what is the best way to init a simplex in R3, should I just start with one point and begin the algorithm?
Quote:Yes, you drop the points in the support set that are not needed to express the point that lies on the feature and is closest to the query point. For example, you have four points in the set, forming a tetrahedron. If the closest point lies on one of the faces of the tetrahedron, you keep the three vertices of that face and discard the fourth. If the closest point lies on one of the tetrahedron edges, you keep the pair of points determining the edge and discard the other two. Et cetera.
say I had a tetrahedron simplex and i wanted to reduce the simplex when i calculate the closest point to the origin on the tetrahedron, say the point lies on a face of the tetrahedron, would the simplex simply be the triangle that the point lies on?
Posted 30 September 2005 - 06:26 PM
The objects i'm working with are convex
Posted 30 September 2005 - 10:47 PM