I am new to this forum and not a native english speaker, so please be nice! :) Here is the challenge I face at the moment:
I\'m looking for any algorithm or source code which can find whole or partial simple 3-D shapes (sphere, cylinder, cone, etc) in a 3-D triangulation mesh.
I would like to get the 开发者_高级运维center point(x,y) of a figure created by a set of points.
I have a system with a number of base station beacons, each broadcasting an infinitely fast signal describing their position on a 2D Cartesian plane. The signal strength begins with a [unitless] power
I have implemented location identification using GPS in android in my application but now if G开发者_如何转开发PS is not available or disabed then how to identify location when internet is enabled in
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
I was looking at this question Here in regards to this library. However it is still unclear to me if this library can do like glu tesselator does and return a series of triangles which I can then rend
I\'m looking for a packing algorithm which will reduce a regular polygon into re开发者_StackOverflow社区ctangles and right triangles. The algorithm should attempt to use as few such shapes as possible
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
加载中,请稍侯......