[gdal-dev] weeding out x,y,z points
jgomezdans at gmail.com
Thu Feb 26 05:23:36 EST 2009
2009/2/26 Ari Jolma <ari.jolma at tkk.fi>
> nicholas.g.lawrence at mainroads.qld.gov.au wrote:
>>> <nicholas.g.lawrence at mainroads.qld.gov.au>
>>>> Can GDAL or OGR weed out 3D points based on proximity to each other?
>>> I would use plain Perl (or Python or high level language X) to read in
> the points sequentially and discard new ones that are "too close" to
> existing ones. It may take a while & require a bit of memory it is probably
> doable that way (millions of points but not 100s of millions in the end
> set). The program shouldn't need to be more than 20 lines I guess.
scipy (python's numeric/scientific workhorse) now has a Kdtrees
capabilities, which are an efficient way of working out distances between
-------------- next part --------------
An HTML attachment was scrubbed...
More information about the gdal-dev