You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
Performance and memory-footprint can be significantly reduced by filtering out all point-grid distances above a certain threshold. I think this threshold can not be easily determined automatically, but it could be a user-provided input to the core algorithm (with a default of NULL).
However filtering the distance table may produce a state that the algorithm can not solve any more. I don't know if it would fail then with an error or even end up in an endless loop. Adding this feature involves figuring out when to abort gracefully in case of failure.
The text was updated successfully, but these errors were encountered:
Performance and memory-footprint can be significantly reduced by filtering out all point-grid distances above a certain threshold. I think this threshold can not be easily determined automatically, but it could be a user-provided input to the core algorithm (with a default of NULL).
However filtering the distance table may produce a state that the algorithm can not solve any more. I don't know if it would fail then with an error or even end up in an endless loop. Adding this feature involves figuring out when to abort gracefully in case of failure.
The text was updated successfully, but these errors were encountered: