Breakthrough In Drawing Complex Venn Diagrams: Goes to 11
00_NOP writes "Venn diagrams are all the rage in this election year, but drawing comprehensible diagrams for anything more than 3 sets has proved to be very difficult. Until the breakthrough just announced by Khalegh Mamakani and Frank Ruskey of the University of Victoria in Canada, nobody had managed to draw a simple (no more than two lines crossing), symmetric Venn diagram for more than 7 sets (only primes will work). Now they have pushed that on to 11. And it's pretty too."
Visually, you don't really get fast useful information out of it, it's too hard to map a certain part of it to exactly which 11 regions it contains...
But useless
jsut athnoer menagiensls ltitle psrhae for you to dcoede. Why do we wtsae our tmie dnoig tihs?
The entire point of a venn diagram is a quick overview to easily be able to get an understanding about how things overlap, in what amounts and what areas. The diagrams on the linked page might be pretty, but they are in no way useful, and I doubt anyone would get more information out of it than reading the datalist it was compiled from.
At that level its just a shiny object with no substance.
But then again, with what goes on in the political world these days perhaps it's appropriate.
---- Booth was a patriot ----
I agree that the 11-Venn is fairly useless as a PowerPoint slide, but Slash Dotters of all people should understand that pure mathematics often leads to applied mathematics. For example, suppose this new finding leads to improved approaches to signal multiplexing, so that you can have billions more 8G cell phones and thousands more channels of nothing-to-watch on cable and satellite TV. Or perhaps it will lead to more advanced neural networks, so that we can get Cyberdyne Systems and SkyNet up and running. Or maybe it will even lead to advances in political science that give rise to governments that are actually capable of serving the people they govern. One just never knows...
Many seemingly pointless exercises in math lead to surprising breakthroughs. Graph partitioning is a very active area of research. Imagine creating an index on a ultra large database with pairwise "and" condition on many pairs of fields. Then finding multiple "and" or "or" condition based records within minimal traversing and merging of the index files. Who knows it might actually lead to dramatic speed ups of queries in large data bases.
sed -e 's/Chuck Norris/Rajnikant/g' joke > fact