This research reveals geometric proof of equidistant point existence in curves, suggesting innovative algorithms for grid construction.
We consider a geometrical problem of existence of an equidistant set of N points, under the Euclidean metric, on non-closed and closed curves. For the non-closed curve we give a new version of the geometrical proof of the existence based on the continuous mapping argument. For a closed curve we construct a counterexample if the number of points N is arbitrarily chosen and we give a proof of existence of the set if N is taken sufficiently large. We develop numerical algorithms that build solutions for both types of curves.
No takes yet. Share an insight, caveat, or question.
Ceely et al. (2024) studied this question.
Synapse has enriched 5 closely related papers on similar clinical questions. Consider them for comparative context: