-----BEGIN PGP SIGNED MESSAGE----- Hash: SHA1 On 28/10/2013 12:44, Pierre Haessig wrote: > Hi, > > Le 27/10/2013 19:28, Freddie Witherden a écrit : >> I wish to sort these points into a canonical order in a fashion >> which is robust against small perturbations. In other words >> changing any component of any of the points by an epsilon ~ 1e-12 >> should not affect the resulting sorted order. > Can you give more precision on what you mean by "canonical order". > Since there is no natural order in R^n for n>1, I guess your > problem is more about *defining* what is the order you want rather > than *implementing* it in C/Python or whatever.
The order itself does not need to satisfy any specific properties. Any order which can be defined and implemented in a robust fashion will do. Regards, Freddie. -----BEGIN PGP SIGNATURE----- Version: GnuPG/MacGPG2 v2.0.20 (Darwin) Comment: GPGTools - http://gpgtools.org Comment: Using GnuPG with Thunderbird - http://www.enigmail.net/ iEYEARECAAYFAlJvfgIACgkQ/J9EM/uoqVekVQCgkFxKxBCLUn6InBxyM995FVq3 x88AnjUSopT8YJgXUwIyKalAmLmVznvb =nHMZ -----END PGP SIGNATURE----- _______________________________________________ NumPy-Discussion mailing list [email protected] http://mail.scipy.org/mailman/listinfo/numpy-discussion
