A heuristic extending the Squarified treemapping algorithm

09/02/2016
by   Antonio Cesarano, et al.
0

A heuristic extending the Squarified Treemap technique for the representation of hierarchical information as treemaps is presented. The original technique gives high quality treemap views, since items are laid out with rectangles that approximate squares, allowing easy comparison and selection operations. New key steps, with a low computational impact, have been introduced to yield treemaps with even better aspect ratios and higher homogeneity among items.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
08/22/2019

The double traveling salesman problem with partial last-in-first-out loading constraints

In this paper, we introduce the Double Traveling Salesman Problem with P...
research
02/18/2016

What is the distribution of the number of unique original items in a bootstrap sample?

Sampling with replacement occurs in many settings in machine learning, n...
research
06/04/2014

Cascading A*: a Parallel Approach to Approximate Heuristic Search

In this paper, we proposed a new approximate heuristic search algorithm:...
research
09/16/2019

Davidson-Luce model for multi-item choice with ties

This paper introduces a natural extension of the pair-comparison-with-ti...
research
08/09/2022

Robotic Untangling of Herbs and Salads with Parallel Grippers

The picking of one or more objects from an unsorted pile continues to be...
research
05/30/2020

Bi-Criteria Multiple Knapsack Problem with Grouped Items

The multiple knapsack problem with grouped items aims to maximize reward...
research
05/15/2020

HeCSON: Heuristic for Configuration Selectionin Optical Network Planning

We present a transceiver configuration selection heuristic combining Enh...

Please sign up or login with your details

Forgot password? Click here to reset