Q: How to divide irregular polygon into equal areas on Google map V2 I am developing an application for sampling Glebe for agriculture purpose. In That a user can select a a Glebe by tapping on map which will create a polygon according to the number of taps. I am able to create that polygon and able to get the area of the polygon. But Now I need to divide it into equal areas.
For example, If the polygon's area is 50m^2 then it'll be divided into 50 areas of 1 m^2. Same functionality has been done in Agri Precision App. Find below image. I need to divide the polygon same as below image and show the points inside it.

For getting Area, I am using Google Map Utilty Lib It has an algo also for Grid Clustering. I want same like above image. In above image, they have divided area per 5 Hectares. Since all area is 85 Hectares, so total points should be shown will be 17. That is what How it works. 
So my question is:
How to find those points according to the area of the polygon on Map  so that I can draw these points  on Map? 

A: No constraint has been given on the shape of the glebes, so here is a solution that will fulfill the problem statement by building a star-shaped decomposition. It assumes that the polygon is convex:


*

*Arbitrarily select a main vertex.

*Triangulate the polygon by joining the main vertex to every edge in turn, giving triangles of areas A1, A2, A3...

*Start a trip around the polygon, from the main vertex. If the first triangle is larger than the desired area (A1 > A), find the point along the edge such that it will subdivide the triangle in a sub-triangle of the desired area. Continue the trip from here with the remaining sub-triangle (having area A1-A). Otherwise, subtract the area of the first triangle from the desired area and continue the trip (A now A-A1).
This is very similar to splitting a sequence of N intervals on the real line into K intervals of equal length.
My guess is that a star-shape decomposition will not suit you.

A: If your polygon is convex, a solution can be obtained by solving the following sub-problem: "Given a convex polygon of area A, find the horizontal line that splits it in two parts of respective areas B and A-B."
This is readily done by scanning the vertices from top to bottom with a moving horizontal and computing the covered area (this forms a decomposition of the polygon into trapezoids). At some point you will exceed the area B. By linear interpolation between the current and previous vertexes, you will determine the exact ordinate of the horizontal.
You will use the sub-problem solution as follows:
1) compute the integer square root, let N, of the number of desired tiles, let M.
2) slice the polygon N times, each time obtaining the area of N tiles. There will be a remainder of M-N^2 tiles.
3) slice every slice using verticals to singulate the final tiles.
The tiles will have a much more acceptable shape (rectangles when they don't meet any edge).
