I need a very precise algorithm for fitting a circle to the set of data points (actually I need to determine the center). The data comes after the binarization and segmentation of the image.
I need to project a 3D object onto a sphere\'s surface (uhm.. like casting a shadow). AFAIR this should be possible with a projection matrix.
I am having two Vectors (X,Y,Z), one above Y=0 and one below Y=0. I want to find the Vector (X,Y,Z) where the line between the two original vectors intersects with the Y=0 level.
I have two objects in a CSharp project, which presents rectangles. Now I want to calculate if one object 开发者_C百科intersects another one. The objects cannot rotate.
i am working on an implementation of the Separting Axis Theorem for use in 2D games. It kind of works but just kind of.
Let\'s say we have a rectangular sea. It\'s quite large - 10000x20000. We have islands, as well. For simplicity\'s sake, let\'s assume they are rectangular as well. We know their exact places (coord
If you have an equilateral triangle in 3D space, where all the sides are of length 1, there are two points that you could use to form a tetrahedron. One floating out in front of the triangle, and one
This is a problem which is hard to explain in words, though I have it easily captured in my head.Let me know if my explanation below开发者_JAVA技巧 isn\'t clear.
Background: I\'m build a series of location-based apps that make heavy use of maps. These maps are annotated with locations fetched from a server, to which I pass regions of the map I need data for (d
Background I want to add a model manager function that filters a queryset based on the proximity to coordinates. I found this blog posting with code that is doing precisely what I want.
加载中,请稍侯......