I want to build a simple treemap without hierachies. The treemap must show how many faults a user made in a learning programme. There could be for example five users and they made this faults: 10, 3, 4, 1, 7. So the biggest rectangle is for the user with 10 faults.
Now I found the code of another treemap in the book "Visualizing Data" from Ben Fry. And I asked myself, if I can use this one to solve my problem. The other problem is, I´m a beginner in Processing and I don´t know how to go on.
The code from Ben Fry is like this:
import treemap.*;
Treemap map;
void setup()
{
size (500, 500);
smooth();
strokeWeight(0.25f);
PFont font = createFont("Serif", 13);
textFont(font);