VURD to the third power...

[triadruid]

I would like to graph several pairs of RGB triplets (#FFBB99,#000020 for example), but cannot figure out how to do it properly without folding space and time in unfortunate ways.

Any ideas that don't involve six dimensions?

Comments

[triadruid.livejournal.com]

Drawing the colors might work, but I'm looking for insufficient contrast between pairs, and my eyes don't always do a very good job of color matching. Also, there's more pairs than I can put side-by-side here.

I think the line segments are going to end up being the way to go here.

[auraseer.livejournal.com]

If all you want to know is the contrast, you don't need to generate a graph. Just use the distance formula to calculate the separation of each pair of points. That gives you a single number for each pair, and a larger number indicates greater contrast.

Given points A (Xa, Ya, Za) and B (Xb, Yb, Zb), plug the values into this:

sqrt( (Xa-Xb)2 + (Ya-Yb)2 + (Za-Zb)2 )

[triadruid.livejournal.com]

Mmmm, problem is, I need to compare all of them pairwise, not just discreet pairs. (see my response to [Unknown site tag] above).

It'd still only be 27k pairs or so, but... ;)

[auraseer.livejournal.com]

You want to compare each value to every other? I don't see how you'll do that with the line segment graph. It will generate a big impenetrable ball of tangles.

One line segment represents one ordered pair, so if there are 27k possible pairings, you'll wind up with 27k line segments crammed into the graph. With all those overlapping and obscuring each other, I have no idea how you'd read it.

[triadruid.livejournal.com]

Nah, I should only end up with √27,000 line segments - which might still be impenetrable. :)