In this paper, we consider the problem of removing overlaps of labels in a given layout by changing locations of some of the overlapping labels, and present a new method for the problem based on a packing approach, called multi-sphere scheme. More specifically, we study two new variations of the label overlap problem, inspired by real world applications, and provide a solution to each problem. Our new approach is very flexible to support various operations such as translation, translation with direction constraints, and rotation. Further, our method can support labels with arbitrary shapes in both 2D and 3D layout settings. Our extensive experimental results show that our new approach is very effective for removing label overlaps. © 2009 Springer Berlin Heidelberg.
CITATION STYLE
Imamichi, T., Arahori, Y., Gim, J., Hong, S. H., & Nagamochi, H. (2009). Removing node overlaps using multi-sphere scheme. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5417 LNCS, pp. 296–301). Springer Verlag. https://doi.org/10.1007/978-3-642-00219-9_28
Mendeley helps you to discover research relevant for your work.