One of the former students in our lab used some applicable techniques for his PhD thesis. I believe one of them is called “alpha shapes” and is referenced in the following paper: http://www.cis.rit.edu/people/faculty/kerekes/pdfs/AIPR_2007_Gurram.pdf That paper gives some further references you can follow.
I understand the original poster was looking for a simple solution, but unfortunately there really is no simple solution. Nevertheless, I’ve recently created an open-source freeware clipping library (written in Delphi, C++ and C#) which clips all kinds of polygons (including self-intersecting ones). This library is pretty simple to use: http://sourceforge.net/projects/polyclipping/ .
The Mercator map projection is a special limiting case of the Lambert Conic Conformal map projection with the equator as the single standard parallel. All other parallels of latitude are straight lines and the meridians are also straight lines at right angles to the equator, equally spaced. It is the basis for the transverse and … Read more
[*] Alright, I came here looking for an answer and didn’t find something simple and straightforward, so I went ahead and did the dumb but effective (and relatively simple) thing: Monte Carlo optimisation. Very simply put, the algorithm is as follows: Randomly perturb your projection matrix until it projects your known 3D coordinates to your … Read more
I would recommend V-Play (v-play.net) – it’s a cross-platform game engine based on Qt for iOS, Android, Symbian, MeeGo, Blackberry10 and also can export for native desktop applications for Windows, Mac and Linux. It’s based on C++ but has a neat scripting support for QML & JavaScript. QML is a no-brainer to learn and can … Read more
I was in a similar situation. The way I started with openGL with start by looking at the very basic GLSurfaceView samples/demos. Start, by setting up your app activity, and set up the basic canvas. Take a loot at the replica island source code file: GameRenderer.java for how to setup your canvas with the proper … Read more
Here is the standard method, AFAIK. Basically sum the cross products around each vertex. Much simpler than triangulation. Python code, given a polygon represented as a list of (x,y) vertex coordinates, implicitly wrapping around from the last vertex to the first: def area(p): return 0.5 * abs(sum(x0*y1 – x1*y0 for ((x0, y0), (x1, y1)) in … Read more
Implementation 1 returns the magnitude of the vector that would result from a regular 3D cross product of the input vectors, taking their Z values implicitly as 0 (i.e. treating the 2D space as a plane in the 3D space). The 3D cross product will be perpendicular to that plane, and thus have 0 X … Read more
You can just declare a regular array like so: var arry = []; Then when you have a pair of values to add to the array, all you need to do is: arry.push([value_1, value2]); And yes, the first time you call arry.push, the pair of values will be placed at index 0. From the nodejs … Read more
You can print in simple way. Use below to print 2D array int[][] array = new int[rows][columns]; System.out.println(Arrays.deepToString(array)); Use below to print 1D array int[] array = new int[size]; System.out.println(Arrays.toString(array));