  Many algorithms have been designed to remove node overlapping, and many
quality criteria and associated metrics have been proposed to evaluate those
algorithms. Unfortunately, a complete comparison of the algorithms based on
some metrics that evaluate the quality has never been provided and it is thus
difficult for a visualization designer to select the algorithm that best suits
his needs. In this paper, we review 21 metrics available in the literature,
classify them according to the quality criteria they try to capture, and select
a representative one for each class. Based on the selected metrics, we compare
8 node overlap removal algorithms. Our experiment involves 854 synthetic and
real-world graphs.
