A packing problem with applications to lettering of maps

Proceedings of the Annual Symposium on Computational Geometry

Volumn , Issue , 1991, Pages 281-288

  Formann, Michael ^a   Wagner, Frank ^a  

^a FREIE UNIVERSITÄT BERLIN   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATION ALGORITHMS; GROUNDWATER; POLYNOMIAL APPROXIMATION; SULFUR COMPOUNDS;

AFFINE TRANSFORMATIONS; DECISION PROBLEMS; DISTINCT POINTS; LOWER BOUNDS; NP COMPLETE; PACKING PROBLEMS; RUNNING TIME; SULPHATE CONCENTRATIONS;

COMPUTATIONAL GEOMETRY;

EID: 85034006171     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/109648.109680     Document Type: Conference Paper

References (7)

1. M. Ben-Or, Lower bounds for algebraic computation trees Proc. 15th ACM Ann. Symp. Theory of Computing (1983), 80-86
2. H. Edelsbrunner, Dynamic data structures for orthogonal intersection queries, Rep. F59, Technische Universität Graz, Institute für Informationsverarbeitung (1980)
3. S. Even, A. Itai and A. Shamir, On the complexity of timetable and multicommodity flow problems, SIAM J. Comput. 5(1976), 691-703
4. M. R. Garey and D. S. Johnson, Computers and Intractability, A guide to the theory of NP-completeness, Freeman, 1979
5. H. Imai and T. Asano, Efficient Algorithms for Geometric Graph Search Problems, SIAM J. Comput. 15(1986), 478-494
6. E. Imhof, Positioning Names on Maps, The American Cartographer 2(1975), 128-144
7. P. Yoeli, The Logic of Automated Map Lettering, The Cartographic Journal 9, 1972, 99-108