Is there any open source software available? Basically, I just want to triangulate based on signal strength of routers whose location is fixed and known. I realize there can be cases of interference, but let's just stick to listing known source code. Thanks. ...
I am working with directX 9. I have a problem while rendering triangles using drawprimitive. The problem is - When I am rendering the whole object made of several triangles, the triangle having all points on a single line shows gap in a whole closed object. I am showing the image below. The white dashed line is the problem. ...
I have done some computer graphical programming recently, and I have no experience before. I used the library call CGAL(computer geometry algorithm library). Also, I noticed that there is class for triangulation and also class for mesh. Is mesh just a kind of triangle net? Do they have any differences? Thanks! ...
I've recently encountered a need for a library or set of libraries to handle operations on 2D polygons. I need to be able to perform boolean/clipping operations (difference and union) and triangulation. So far the libraries I've found are poly2tri, CGAL, and GPC. Poly2tri looks good for triangulation but I'm still left with boolean ope...
Does anybody know what triangulation algorithm Maya uses? Lacking that, what would be the most probable algoritms to try? I tried a few simple off the top of my head (shortest/longest resulting edges, smallest minimum angle, smallest/biggest area), but they where all wrong. Is Delaunay the most plausible algoritm? Edit: by the way, pseu...
Hi, 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 reduced by some decimation algorithm) one where let's say it was build from Y points, where X>Y. Now, how could I do the following compar...
I'm looking for a packing algorithm which will reduce a regular polygon into rectangles and right triangles. The algorithm should attempt to use as few such shapes as possible and should be relatively easy to implement (given the difficulty of the challenge). If possible, the answer to this question should explain the general heuristics...
I have an array of thousands of quads; 4-sided 3D polygons. All I know are the coordinates of the quad corners. A subset of these quads define the closed outer shell of a 3D shape. The remaining quads are on the inside of this closed solid. How do I figure out which quads are part of the shell and which quads are part of the interior? ...
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 render with OpenGL. If it can do this, how is this done? I'm just not clear on this from reading the docs. So essentially what i'm trying to fi...
I have an array with vertices representing a triangular strip. I need to convert it into polygon. There are many solution to do the reverse, but I failed to find one for the above problem. Or it could be too easy and I just cannot see it. Please help. OpenGL=compatible, see http://en.wikipedia.org/wiki/Triangle_strip Example: for thi...
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 triangles one by one, some graphic renderers shows seams between the triangles (at least if anti-aliasing and/or transparency is involved). So how do I take a se...
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 with the point set. But according to "Numerical recipes: the art of scientific computing": "...if the distance is merely finite (to the boundary points) th...
Hello, I try to understand how a point from a delaunay triangulation can be removed. I read some scientific papers but i didn't get it totally. As I am not a native speaker I think I would benefit from a more simple and direct explanation. I already implemented a dynamic delaunay triangulation based on a english description, so I know t...
Hi Guys: I am new to android. I am developing an application in android 2.2 to identify location of user by means of any available resources (GPS , Networks etc). I have done finding location through GPS and using SIM network along with internet. Now problem is want to locate device when no GPS and no internet is available. In this case ...
Hey Guys! I have implemented location identification using GPS in android in my application but now if GPS is not available or disabed then how to identify location when internet is enabled in device. Whether using google API or triangulation or some thing else. Thank You. ...