Hi Michael,
Thanks for the response.
, generate
points on a regular grid within that and then test for point in
polygon, though you might need some elaboration of that if you're
dealing with long, narrow polygons.
Yes, that is an issue. I was coming round to this idea:
1) Get Bounding box for given geometry
2) Generate a grid of evenly sized boxes (e.g. 16x16) that fit into the
bounding box
3) For each box in 2 check to see if it is contained by the original
geometry -if it is, generate a regular grid of points in the box (number
of points is proportionate to box size)
4) If a box in 3) is not contained but overlaps, further subdivide that
box and repeat step 3) with this grid layer
This recursion would repeat until you reach a level of box that meets a
pre-defined level of resolution (otherwise it could repeat subdivisions
forever).
Cheers
Mark
Michael
_______________________________________________
jts-devel mailing list
[email protected]
http://lists.refractions.net/mailman/listinfo/jts-devel
------------------------------------------------------------------------
No virus found in this incoming message.
Checked by AVG - www.avg.com
Version: 8.0.237 / Virus Database: 270.11.5/1978 - Release Date: 03/01/09 07:04:00
_______________________________________________
jts-devel mailing list
[email protected]
http://lists.refractions.net/mailman/listinfo/jts-devel
