Efficient approximation algorithms for multi-label map labeling

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1741, Issue , 1999, Pages 143-152

  Zhu, Binhai ^a   Poon, C K ^a  

^a CITY UNIVERSITY OF HONG KONG   (Hong Kong)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; POLYNOMIAL APPROXIMATION;

BICRITERIA APPROXIMATION; CONSTANT-FACTOR APPROXIMATION ALGORITHMS; EFFICIENT APPROXIMATION ALGORITHMS; MAP-LABELING; MULTI-LABEL; POLYNOMIAL TIME APPROXIMATION SCHEMES;

APPROXIMATION ALGORITHMS;

EID: 84958062257     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-46632-0_15     Document Type: Conference Paper

References (22)

1. D. Beus and D. Crockett. Automated production of 1:24,000 scale quadrangle maps. In Proc. 1994 ASPRS/ACSM Annual Convention and Exposition, volume 1, pages 94-99, 1994.
2. M. Ben-Or. Lower bounds for algebraic computation trees. In Proc. 15th ACM STOC, pages 80-86, 1983.
3. J. Christensen, J. Marks, and S. Shieber. Algorithms for cartographic label placement. In Proc. 1993 ASPRS/ACSM Annual Convention and Exposition, volume 1, pages 75-89, 1993.
4. J. Christenson, J. Marks, and S. Shieber. An Empirical Study of Algorithms for Point-Feature Label Placement, ACM Transactions on Graphics, 14:203-222, 1995.
5. J. Doerschler and H. Freeman. A rule-based system for cartographic name placement. CACM, 35:68-79, 1992.
6. A. Datta, II.-P. Lenhof, C. Schwarz, and M. Smid. “Static and dynamic algorithms for k-point clustering problems,” In Proc. 3rd worksh. Algorithms and Data Structures, springer-verlag, LNCS 709, pages 265-276, 1993.
7. S. Doddi, M. Marathe, A. Mirzaian, B. Moret and B. Zhu, Map labeling and its generalizations. In Proc. 8th ACM-SIAMSymp on Discrete Algorithms (SODA’97), New Orleans, LA, Pages 148-157, Jan, 1997.
8. D. Eppstein and J. Erickson. “Iterated nearest neighbors and finding minimal polytopes,” Discrete & Comput. Geom., 11:321-350, 1994.
9. M. Formann and F. Wagner. A packing problem with applications to lettering of maps. In Proc. 7th Annu. ACM Sympos. Comput. Geom., pages 281-288, 1991.
10. M. Garey and D. Johnson. Computers and Intractability: A Guide to the Theory of NP-completeness. Freeman, San Francisco, CA, 1979.
11. H.B. Hunt III, M.V. Marathe, V. Radhakrishnan, S.S. Ravi, D.J. Rosenkrantz and R.E. Stearns, A Unified Approach to Approximation Schemes for NP- and PSPACE-Hard Problems for Geometric Graphs. Proc. Second European Symp. on Algorithms (ESA’94), pages 468-477, 1994.
12. C. Iturriaga and A. Lubiw. Elastic labels: the two-axis case. In Proc. Graph Drawing’97, pages 181-192, 1997.
13. D. Imhof. Positioning names on maps. The American Cartographer, 2:128-144, 1975.
14. C. Jones. Cartographic name placement with Prolog. Proc. IEEE Computer Graphics and Applications, 5:36-47, 1989.
15. M. van Kreveld, T. Strijk and A. Wolff. Point set labeling with sliding labels. In Proc. 14th Annu. ACM Sympos. Comput. Geom., pages 337-346, 1998.
16. K. Kakoulis and I. Tollis. An algorithm for labeling edges of hierarchical drawings. In Proc. Graph Drawing’97, pages 169-180, 1997.
17. K. Kakoulis and I. Tollis. A unified approach to labeling graphical features. Proc. 14th Annu. ACM Sympos. Comput. Geom., pages 347-356, 1998.
18. K. Kakoulis and I. Tollis. On the multiple label placement problem. In Proc. 10th Canadian Conf. on Comput. Geom., pages 66-67, 1998.
19. D. Knuth and A. Raghunathan. The problem of compatible representatives. SIAM J. Disc. Math., 5:422-427, 1992.
20. D. P. Preparata and M.I. Shamos. Computational Geometry: An Introduction. Springer-Verlag, 1985.
21. C.K. Poon, B. Zhu and F. Chin, A polynomial time solution for labeling a rectilinear map. Inform. Process. Lett., 65(4):201-207, Feb, 1998.
22. F. Wagner. Approximate map labeling is in Ω(n log n). Inform. Process. Lett., 52:161-165, 1994.