Hi @pierreroudier - Happy New Year! Some of the projects we've been using clhs for recently have required a minimum distance between sample points, so that transects don't overlap. I've implimented this into the C++ version; if the user inputs a two column table of coordinates and a minimum distance, then the algorithm adds a distance penalty to the objective function, as well as probabilistically swapping a point that is too close. It seems to work well, as long as there is enough space in the sample area. I could imagine this being a common use case - do you think it's worth pulling into the package?
Hi @pierreroudier - Happy New Year! Some of the projects we've been using clhs for recently have required a minimum distance between sample points, so that transects don't overlap. I've implimented this into the C++ version; if the user inputs a two column table of coordinates and a minimum distance, then the algorithm adds a distance penalty to the objective function, as well as probabilistically swapping a point that is too close. It seems to work well, as long as there is enough space in the sample area. I could imagine this being a common use case - do you think it's worth pulling into the package?