Online Version - Last Updated - 20 Jan 2012 |
 |
| Home |
| |
| Procedures and Resources for Authors |
|
| Information and Resources for Volume Editors |
| |
| Orders and Subscriptions |
| |
| Published Articles |
|
| Upcoming Volumes |
| |
| Contact Us |
| |
| Useful External Links |
| |
| CRPIT Site Search |
Polygons Labelling of Minimum Leader Length
Bekos, M.A., Kaufmann, M., Potika, K. and Symvonis, A.
We study a variation of the boundary labelling problem, with floating sites (represented as polygons), labels of uniform size placed in fixed positions on the boundary of a rectangle (that encloses all sites) and special type of leaders connecting labels to sites. We seek to obtain a labelling of all sites with leaders that are non-overlapping and have minimum total length. We present an O(n2 log3 n) time algorithm for the labelling of polygons.
Cite as: Bekos, M.A., Kaufmann, M., Potika, K. and Symvonis, A. (2006). Polygons Labelling of Minimum Leader Length. In Proc. Asia Pacific Symposium on Information Visualisation (APVIS2006), Tokyo, Japan. CRPIT, 60. Misue, K., Sugiyama, K. and Tanaka, J., Eds. ACS. 15-21.
(from crpit.com)
(local if available)
