Beefy Boxes and Bandwidth Generously Provided by pair Networks
Syntactic Confectionery Delight

Re^2: Finding Nearly Identical Sets

by Limbic~Region (Chancellor)
on Sep 29, 2016 at 11:54 UTC ( [id://1172912] : note . print w/replies, xml ) Need Help??

in reply to Re: Finding Nearly Identical Sets
in thread Finding Nearly Identical Sets



I was actually looking at Hilberts Curve. As far as the 9 subset/hash, I outlined that solution yesterday in a response to BrowserUk. I was hoping for something more elegant which is why I asked here.

Cheers - L~R

Replies are listed 'Best First'.
Re^3: Finding Nearly Identical Sets
by LanX (Saint) on Sep 29, 2016 at 20:53 UTC
    Again, for me it is elegant.

    It's fast, easy to implement and its matching the requirements.

    Well unless you have more in mind than you told us.

    Better solutions (like a more straight away normalization) would require your codepoints to have a guaranteed minimal distance.

    This could certainly be achieved, but well regarding the generality of your question, it'll be far fetched to suppose such a structure.

    Cheers Rolf
    (addicted to the Perl Programming Language and ☆☆☆☆ :)
    Je suis Charlie!