I want to calculate a clockwise angle between two line segment A and B. So the resulting angle must be between 0 to 360-1 degrees. I\'ve seen all other answers in SO but they gave me negative angle开发
I have two TINs (triangulated irregular network) of a terrain. First one (TIN1) is the original one, let\'s say with X number of points. And the other (TIN2) is simplified (the number of points were r
I have two bitmaps, and I want to copy pixels from A to B only when the pixels are inside an area defined by four corners (a quadrangle). Bitmap A and B are the same size and the qua开发者_JS百科drang
Given n points on the plane. No 3 are collinear. Given the number k. Find the subset of k points, such that the convex hull of the k points has minimum perimeter out开发者_开发技巧 of any convex hul
I have to be able to set a random location for a waypoint for a flight sim. The maths challenge is straightforward:
I have a collection of points which describe the surface of a shape that should be roughly spherical, and I need a method with which to determine if any other given point lies within this shape. I\'ve
I have polygon chains similar to the following... ...given the chain in the image, how would I go about calculating a chain that defines the same shape but wit开发者_运维百科hout crossing paths?
I two sets of k-dimensional vectors, where k is around 500 and the number of vectors is usually smaller. I want to compute the 开发者_C百科(arbitrarily defined) minimal distance between the two sets.
I am trying so write a bit of code that will search for a given point on a map, but in a given arc of a compass bearing.
List1 contains a high number (~7^10) of N-dimensional points (N <=10), List2 contains the same or fewer number of N-dimensional points (N <=10).