jovo
commented
8 years ago Cool! Let's break it?!
On Wednesday, September 14, 2016, guisf notifications@github.com wrote:
This was fixed. We assume that the shape has ordered points, thus we don't need to consider all possible permutations, only cyclic permutations. In this way we rotate P into Q several times, by cycling the points in P everytime. We then pick the answer with minimum distance. This solve the issue of relabeling the points. @jovo https://github.com/jovo
— You are receiving this because you were mentioned. Reply to this email directly, view it on GitHub https://github.com/neurodata/non-parametric-clustering/issues/10, or mute the thread https://github.com/notifications/unsubscribe-auth/AACjcvUYI2U2xpyEzxyriI8rO2iYR4YYks5qqGPDgaJpZM4J9QEy .
the glass is all full: half water, half air. neurodata.io, jovo calendar https://calendar.google.com/calendar/embed?src=joshuav%40gmail.com&ctz=America/New_York
guisf
This was fixed. We assume that the shape has ordered points, thus we don't need to consider all possible permutations, only cyclic permutations. In this way we rotate P into Q several times, by cycling the points in P everytime. We then pick the answer with minimum distance. This solves the issue of relabeling the points. @jovo