Closed. This question is seeking recommendations for books, tools, software libraries, and more. It does not meet Stack Overflow guidelines. It is not currently accepting answers.
I\'m trying to make a program that can make animations - by drawing on screen a Stick-figure, and allowing the user to move its arms and legs, et cetera.
I\'m looking to separate two colliding circles, to push them back equally by the minimum amount so that they\'re perfectly separated.
I have a large set of 3D data points to which I want to fit to an ellipsoid. My maths is pretty poor, so I\'m having trouble implementing the least squares method without any math libraries.
I have a large window in which there are n small windows. Task to place small windows so that between them there was no intersection, or say that it\'s impossible to do.
I have a view with a point on its center. I have an angle in degrees (or radian, that\'s not the problem).
开发者_高级运维Is there any way that you can combine two shapes into one, not geometries. I know I can do this with GeometryGroup using line geometries and the two lines will be a composite shape. How
I\'m looking for a free implementation that finds the minimum bounding box (MBB - the box around a cloud of 3D points with the smallest volume). It should be written in either C or C++.
I have two points, x2 and x1.I have their corresponding y\'s, y2 and y1. I always know that x2>.95>x1 and that y2>y1.
I\'m trying to draw circles by using a Vert开发者_如何学Pythonex Buffer Object to draw points with GL_POINT_SMOOTH enabled in OpenGL ES 2.0 on iPhone.
加载中,请稍侯......