Multi-stack boundary labeling problems

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

Volumn 4337 LNCS, Issue , 2006, Pages 81-92

  Bekos, Michael A ^a   Kaufmann, Michael ^b   Potika, Katerina ^a   Symvonis, Antonios ^a  

^a NATIONAL TECHNICAL UNIVERSITY OF ATHENS   (Greece)

^b UNIVERSITY OF TÜBINGEN   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

BOUNDARY LABELING; LABEL PLACEMENT; LABELINGS; MAIN TASKS; NP-HARDNESS RESULTS; POINT SET; SEARCH SPACES;

SOFTWARE ENGINEERING;

EID: 49949103730     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11944836_10     Document Type: Conference Paper

References (12)

1. M. A. Bekos, M. Kaufmann, K. Potika, and A. Symvonis. Boundary labelling of optimal total leader length. In Proc. 10th Panhellenic Conference On Informatics (PCI2005), LNCS 3746, pages 80–89, 2005.
2. M. A. Bekos, M. Kaufmann, K. Potika, and A. Symvonis. Multi-stack boundary labeling problems, 2006. Technical report, Available online http://www.math.ntua.gr/aarg/.
3. M. A. Bekos, M. Kaufmann, K. Potika, and A. Symvonis. Polygon labelling of minimim leader length. In Asia Pacific Symposium on Information Visualisation (APVIS2006), CRPIT 60, pages 15–21, 2006.
4. M. A. Bekos, M. Kaufmann, A. Symvonis, and A. Wolff. Boundary labeling: Models and efficient algorithms for rectangular maps. Computational Geometry: Theory and Applications. Available online http://www.sciencedirect.com/.
5. M. A. Bekos, M. Kaufmann, A. Symvonis, and A. Wolff. Boundary labeling: Models and efficient algorithms for rectangular maps. In Proc. 12th Int. Symposium on Graph Drawing (GD’04), LNCS 3383, pages 49–59, 2004.
6. M. A. Bekos and A. Symvonis. Bler: A boundary labeller for technical drawings. In Proc. 13th Int. Symposium on Graph Drawing (GD’05), LNCS 3843, pages 503–504, 2005.
7. P. Eades, T. Lin, and X. Lin. Minimum size h-v drawings. In Advanced Visual Interfaces (Proceedings of AVI ’92), volume 36 of World Scientific Series in Computer Science, pages 386–394, 1992.
8. M. Formann and F. Wagner. A packing problem with applications to lettering of maps. In Proc. 7th Annuual ACM Symposium on Computational Geometry (SoCG’91), pages 281–288, 1991.
9. 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, 1979.
10. SmartDraw-7. Product web site: http://www.smartdraw.com.
11. L. Stockmeyer. Optimal orientations of cells in slicing floorplan designs. Information and Control, 57(2–3):91–101, 1983.
12. A. Wolff and T. Strijk. The Map-Labeling Bibliography. http://i11www.ira.uka.de/map-labeling/bibliography, 1996.