I want to find the minimum distance between two polygons with million number of vertices(not the minimum distance between their vertices). I have to find the 开发者_JS百科minimum of shortest distance
Given a convex polygon, I am trying to grow its shape (as in \"maximal area\") while preserving its diameter. The diameter is defined as the length of the longest segment that can be placed within the
Currently, I am working on a project that is trying to group 3d points 开发者_开发技巧from a dataset by specifying connectivity as a minimum euclidean distance. My algorithm right now is simply a 3d a
I have a 3D polygon mesh and a corresponding 2D polygon mesh 开发者_运维知识库(actually from a UV map) which I\'m using to map the geometry onto a 2D plane. Given a point on the plane, how can I effic
I\'m developing an application where entities are located at positions on Earth.I want to have a set of data from which I can determine what region(s) a point is contained within.
Most iterative algorithms require an initial empty triangle to get the ball rolling. 开发者_如何学编程It seems like a commonly used trick is just to make the super triangle very large in comparison wi
After I\'ve done a 2D triangulation, some triangles have the same color and I want to recombine them开发者_如何学运维 for drawing into like-colored graphics paths. I find that if I just draw the trian
Given a quaternion q, and three 3D vectors (vx, vy, vz) which form coordinate axes, which can be oriented in arbitrary direction, but are all perpendicular to each other, thus forming a 3d space.
I have a set of 3D boxes with arbitrary dimensions, translations and rotations. I need to force the boxes not to intersect by scaling them by a single constant over their 3 dimension components.
Given a 3D line开发者_如何学Python in CGAL, how do I compute a point on that line that is some known distance from an endpoint?If you have two points P0 and P1, you can make a vector V = P1 - P0.
加载中,请稍侯......