It's difficult to tell what is being asked here. Thi开发者_如何学JAVAs question is ambiguous, vague, incomplete, overly broad, or rhetorical andcannot be reasonably answered in its current for
Given sets of 2D points which are the boundaries of an irregular shape, a shape which may not be convex and may have internal holes, is there an algorithm to find the开发者_开发百科 largest circle tha
Closed. This question is off-topic. It is not currently accepting answers. Want to improve this question? Update the question so it's on-topic for Stack Overflow.
I have a list of edges and a list of vertices. Each edge references two vertices, each vertex maintains a list of edges.
I have a set of 2 curves (each with a few hundreds to a couple thousands datapoints) that I want to compare and get some similarity \"score\". Actually, I have >100 of those sets to compare... I am fa
Given the lengths of the sides of 2 triangles. Determine if the second triangle can fit inside the first triangle?
I just need a method to tell me whether an axis aligned bounding box in 3D intersects a line segment (not a ray) or not. I do not need the points of intersection.
I want to sort a vector of points in clockwise order to form a polygon but I need the proper center to do so. I have tried the averages method, but开发者_如何学编程 a few of the points did not sort co
Can someone suggest an algorithm to find out the shortest distance pair of unsorted, colinear points?
I want to make an app that shows where is a location on screen. I\'m going to show over camera image a text indicating if user is looking to it. For example, if user is looking for a town that is in
加载中,请稍侯......