Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Enhancement: add strip algorithm #39

Open
ugroempi opened this issue Nov 18, 2017 · 1 comment
Open

Enhancement: add strip algorithm #39

ugroempi opened this issue Nov 18, 2017 · 1 comment

Comments

@ugroempi
Copy link

ugroempi commented Nov 18, 2017

Hi Martijn,

I have looked at treemap and its references, and I like the very simple strip approach in Bederson, Shneiderman and Wattenberg (2002), because it perfectly preserves order in a very linear way. I have written a function (strip) that does the calculations, resolving the issue of getting very lean last strips by a quick and dirty check whether the last two strips should be merged. I have checked out its performance against pivotSize and squarified (simulated data, informal checks only). strip seems to do quite well in terms of maximum and average aspect ratio.

I attach the function and functions for checking it out (strip_algorithm_for_treemap_GPLge2.zip); I tried to make the function yield the output that you need, but I don't know treemap well enough to be sure that it fits all treemap requirements; at least it seems to handle the plot's aspect ratio a little differently, but that should be a rescaling issue only. Feel free to use and modify as needed for incorporating this nice little algorithm into treemap.

Best, Ulrike

@mtennekes
Copy link
Owner

Thx, I'll take a look at it soon. I'm trying to catch up with the maintenance work:-)

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
None yet
Projects
None yet
Development

No branches or pull requests

2 participants