Hi, 2009/2/26 Ari Jolma <ari.jo...@tkk.fi>
> nicholas.g.lawre...@mainroads.qld.gov.au wrote: > >> >>> <nicholas.g.lawre...@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 points: <http://docs.scipy.org/doc/scipy/reference/spatial.html> Best regards, Jose
_______________________________________________ gdal-dev mailing list gdal-dev@lists.osgeo.org http://lists.osgeo.org/mailman/listinfo/gdal-dev
