Yes, I already noticed that. But a run with thousand gcp's is still
quite fast. I am looking for a smart way to segment these large maps.
You cannot rubbersheet them in many parts, because then the borders
won't fit any more. The only thing I can come up with at the moment is
creating common points on the borders of adjacent parts, and adding them
to the control points. If you have any ideas, let me know.
Jan
On 8/9/2019 8:19 PM, Even Rouault wrote:
On vendredi 9 août 2019 20:08:31 CEST Jan Hartmann wrote:
Thanks Even. GDAL was built with Armadillo, so I'm going to test the
GCP's. Just wanted to be sure there was no possibility of a buffer
overflow, or something like that. The program should be able to handle
an unlimited number of control points, right?
I'd rather say there's no hard-coded limit ;-) But the processing time will
increase with the number of GCPs: linearly when applying the result of the GCP
adjustment for each point transformed, and with an initial computation cost of
the adjustment coefficients that has a complexiy a bit below O(n^3).
Even
_______________________________________________
gdal-dev mailing list
[email protected]
https://lists.osgeo.org/mailman/listinfo/gdal-dev
