A benchmark of eight node overlap removal algorithms finds VPSC and R Wordle-L best preserve layout quality, with VPSC the faster of the two.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.CG 1years
2019 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Node Overlap Removal Algorithms: A Comparative Study
A benchmark of eight node overlap removal algorithms finds VPSC and R Wordle-L best preserve layout quality, with VPSC the faster of the two.