Hi @lukasalexanderweber ,
I would like to clarify on algorithmic complexity of 'lir'. To be honest I've read both blog and original article, and could not find any detailed on what is O(...) for the algorithm we execute.
My goal is to execute 'lir' on a large grid - let it be 15000 x 18000.
The reason why I have such a large grid - first thing I translate original float number like '149.75' to be '14975'. Hopefully this will get more precise results. And the nature of this translation - an algorithm executes over integers.
Will appreciate any comments on this.
Thanks
Hi @lukasalexanderweber ,
I would like to clarify on algorithmic complexity of 'lir'. To be honest I've read both blog and original article, and could not find any detailed on what is O(...) for the algorithm we execute.
My goal is to execute 'lir' on a large grid - let it be 15000 x 18000.
The reason why I have such a large grid - first thing I translate original float number like '149.75' to be '14975'. Hopefully this will get more precise results. And the nature of this translation - an algorithm executes over integers.
Will appreciate any comments on this.
Thanks