Elastic labels: The twoaxis case
 Claudia Iturriaga,
 Anna Lubiw
 … show all 2 hide
Purchase on Springer.com
$29.95 / €24.95 / £19.95*
* Final gross prices may vary according to local VAT.
Abstract
One of the most challenging tasks of cartographic map lettering is the optimal placement of region information on a map. We propose as an approach to this task the elastic labeling problem, in which we are given a set of elastic rectangles as labels, each associated with a point in the plane. An elastic rectangle has a specified area but its width and height may vary. The problem then is to choose the height and width of each label, and the corner of the label to place at the associated point, so that no two labels overlap.
This problem is known to be NPhard even when there is no elasticity (just because of the choice of the corners). We show that the problem remains NPhard when we have elasticity but no choice about which corner of the label to use—we call this the onecorner elastic labeling problem. We give a polynomial time algorithm for the special case of the onecorner elastic labeling problem in which the points lie on the positive x and y axes and the labels lie in the first quadrant. We call this the twoaxis labeling problem.
 J. Christensen, J. Marks, and S. Shieber. An empirical study of algorithms for point feature label placement. ACM Transactions on Graphics. (1995) 14 (3), 203–232. CrossRef
 J.S. Doerschler and H. Freeman. A rulebased system for densemap name placement. Communications of the Association of Computing Machinery. (1992) 35(1), 68–79.
 M. Formann and F. Wagner. A packing problem with applications in lettering of maps. Proceedings of the 7th ACM Symposium on Computational Geometry. (1991) 281–288.
 E. Imhof. Positioning names on maps. The American Cartographer. (1975) 2, 128–144.
 C. Iturriaga and A. Lubiw. NPhardness of some map labeling problems. Technical Report CS9718. University of Waterloo (1997).
 C. Iturriaga. Ph.D. Thesis, in progress. University of Waterloo.
 T. Kato and H. Imai. The NPcompleteness of the character placement problem of 2 or 3 degrees of freedom. Record of Joint Conference of Electrical and Electronic engineers in Kyushu. (1988), 1138. In Japanese.
 D. Knuth and A. Raghunathan. The problem of compatible representatives. SIAM Disc. Math. (1992) 5 (3), 422–427. CrossRef
 J. Marks and S. Shieber. The computational complexity of cartographic label placement. Technical Report CRCT0591. Harvard University (1991).
 F. Wagner and A. Wolff. A practical map labeling algorithm. Computational Geometry: Theory and Applications. (1997) 387–404.
 P. Yoeli. The logic of automated map lettering. The Cartographic Journal. (1972) 9, 99–108.
 Title
 Elastic labels: The twoaxis case
 Book Title
 Graph Drawing
 Book Subtitle
 5th International Symposium, GD '97 Rome, Italy, September 18–20, 1997 Proceedings
 Pages
 pp 181192
 Copyright
 1997
 DOI
 10.1007/3540639381_61
 Print ISBN
 9783540639381
 Online ISBN
 9783540696742
 Series Title
 Lecture Notes in Computer Science
 Series Volume
 1353
 Series ISSN
 03029743
 Publisher
 Springer Berlin Heidelberg
 Copyright Holder
 SpringerVerlag
 Additional Links
 Topics
 Industry Sectors
 eBook Packages
 Editors
 Authors

 Claudia Iturriaga ^{(1)}
 Anna Lubiw ^{(1)}
 Author Affiliations

 1. Dept. of Computer Science, University of Waterloo, USA
Continue reading...
To view the rest of this content please follow the download PDF link above.