If I know the n:m relations ("related yes/no and if related, how strong" ) of x objects, and then want to arrange the x objects on a 1- or 2-dimensional grid in such a way that related objects are close together, or at least as close as possible, how do I do that?
What's this optimization problem called in English? Is there a precise algorithm for large problems (1000 items with up to 1 billion relations)? A good heuristic? Usable (pseudo-) code?
I know I heard about this some time and it has to be one of the staples of relational analysis, but Google can't seem to help me, nor the textbooks I have here....
Thanks for any help
What's this optimization problem called in English? Is there a precise algorithm for large problems (1000 items with up to 1 billion relations)? A good heuristic? Usable (pseudo-) code?
I know I heard about this some time and it has to be one of the staples of relational analysis, but Google can't seem to help me, nor the textbooks I have here....
Thanks for any help
