Boundary labeling: Models and efficient algorithms for rectangular maps

Lecture Notes in Computer Science

Volumn 3383, Issue , 2004, Pages 49-59

  Bekos, Michael A ^a   Kaufmann, Michael ^b   Symvonis, Antonios ^a   Wolff, Alexander ^c  

^a NATIONAL TECHNICAL UNIVERSITY OF ATHENS   (Greece)

^b UNIVERSITY OF TÜBINGEN   (Germany)

^c UNIVERSITY OF KARLSRUHE   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

BOUNDARY CONDITIONS; COMPUTER SCIENCE; GRAPH THEORY; MAPPING; DRAWING (GRAPHICS);

BOUNDARY LABELING; DISJOINT LABELS; GRAPH-DRAWING PROBLEM; LABELING POINT SETS;

ALGORITHMS;

AXIS PARALLEL RECTANGLES; BOUNDARY LABELING; DISJOINT LABELS; GRAPH-DRAWING PROBLEM; LABEL PLACEMENT; LABELING POINT SETS; NEW APPROACHES; TECHNICAL DRAWING;

EID: 24144461186     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (15)

1. P. K. Agarwal, A. Efrat, and M. Sharir. Vertical decomposition of shallow levels in 3-dimensional arrangements and its applications. In Proc. 11th ACM Symp. Comp. Geom. (SoCG'95), pages 39-50, 1995.
2. M. A. Bekos, M. Kaufmann, A. Symvonis, and A. Wolff. Boundary labeling: Models and efficient algorithms for rectangular maps. Technical Report 2004-15, Fakultät für Informatik, Universität Karlsruhe, 2004. Available at http://www.ubka.uni-karlsruhe.de/cgi-bin/psview?document=/ira/2004/15.
3. B. Chazelle and 36 co-authors. The computational geometry impact task force report. In B. Chazelle, J. E. Goodman, and R. Pollack, editors, Advances in Discrete and Computational Geometry, vol. 223, pp. 407-463. AMS, 1999.
4. J.-D. Fekete and G. Plaisant. Excentric labeling: Dynamic neighborhood labeling for data visualization. In Proc. Conference on Human Factors in Computer Systems (CHI'99), pages 512-519, 1999. ACM New York.
5. M. Formann and F. Wagner. A packing problem with applications to lettering of maps. In Proc. 7th ACM Symp. Comp. Geom. (SoCG'91), pages 281-288, 1991.
6. H. Freeman, S. Marrinan, and H. Chitalia. Automated labeling of soil survey maps. In Proc. ASPRS-ACSM Annual Convention, Baltimore, vol. 1, pp. 51-59, 1996.
7. M. R. Garey and D. S. Johnson. Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman, New York, NY, 1979.
8. J. Hershberger and S. Suri. Applications of a semi-dynamic convex hull algorithm. BIT, 32:249-267, 1992.
9. C. Iturriaga. Map Labeling Problems. PhD thesis, University of Waterloo, 1999.
10. C. Iturriaga and A. Lubiw. Elastic labels around the perimeter of a map. Journal of Algorithms, 47(1):14-39, 2003.
11. G. W. Klau and P. Mutzel. Automatic layout and labelling of state diagrams. In W. Jäger and H.-J. Krebs, editors, Mathematics - Key Technology for the Future, pages 584-608. Springer-Verlag, Berlin, 2003.
12. T. Lengauer. Combinatorial Algorithms for Integrated Circuit Layout. B. G. Teubner, 1990.
13. P. M. Vaidya. Geometry helps in matching. SIAM J. Comput., 18:1201-1225, 1989.
14. A. Wolff and T. Strijk. The Map-Labeling Bibliography. http://illwww.ira.uka.de/map-labeling/bibliography/, 1996.
15. S. Zoraster. Practical results using simulated annealing for point feature label placement. Cartography and GIS, 24(4):228-238, 1997.