A unified approach to labeling graphical features

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

A unified approach to labeling graphical features

Full text

Pdf (975 KB)

Source

Annual Symposium on Computational Geometry archive
Proceedings of the fourteenth annual symposium on Computational geometry table of contents

Minneapolis, Minnesota, United States

Pages: 347 - 356

Year of Publication: 1998

ISBN:0-89791-973-4

Authors

Konstantinos G. Kakoulis	Department of Computer Science, The University of Texas at Dallas, Richardson, TX
Ioannis G. Tollis	Department of Computer Science, The University of Texas at Dallas, Richardson, TX

Sponsors

SIGACT: ACM Special Interest Group on Algorithms and Computation Theory
SIGGRAPH: ACM Special Interest Group on Computer Graphics and Interactive Techniques

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 4, Downloads (12 Months): 22, Citation Count: 4

Additional Information:

references cited by index terms collaborative colleagues

Tools and Actions:	Request Permissions Review this Article Save this Article to a Binder Display Formats: BibTeX EndNote ACM Ref

DOI Bookmark:	Use this link to bookmark this Article: http://doi.acm.org/10.1145/276884.276923 What is a DOI?

REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

	1	D. Beus and D. Crockett. Automated production of 1:24,000 scale quadrangle maps. In Proc. 199J ASPRS/ACSM Ann. Convention and Exposition, volume 1, pages 94--99, 1994.
	2	B. Chazelle et al. Application challenges to computational geometry: CG impact task force report. Technical Report TR-521-96, Princeton Univ., April 1096.
	3	Jon Christensen , Joe Marks , Stuart Shieber, An empirical study of algorithms for point-feature label placement, ACM Transactions on Graphics (TOG), v.14 n.3, p.203-232, July 1995 [doi>10.1145/212332.212334]
	4	Giuseppe Di Battista , Peter Eades , Roberto Tamassia , Ioannis G. Tollis, Algorithms for drawing graphs: an annotated bibliography, Computational Geometry: Theory and Applications, v.4 n.5, p.235-282, Oct. 1994 [doi>10.1016/0925-7721(94)00014-X]
	5	Giuseppe Di Battista , Ashim Garg , Giuseppe Liotta , Roberto Tamassia , Emanuele Tassinari , Francesco Vargiu, An experimental comparison of four graph drawing algorithms, Computational Geometry: Theory and Applications, v.7 n.5-6, p.303-325, April 1997 [doi>10.1016/S0925-7721(96)00005-3]
	6	Srinivas Doddi , Madhav V. Marathe , Andy Mirzaian , Bernard M. E. Moret , Binhai Zhu, Map labeling and its generalizations, Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms, p.148-157, January 05-07, 1997, New Orleans, Louisiana, United States
	7	Jeffrey S. Doerschler , Herbert Freeman, A rule-based system for dense-map name placement, Communications of the ACM, v.35 n.1, p.68-79, Jan. 1992 [doi>10.1145/129617.129620]
	8	L. R. Ebinger and A. M. Goulete. Noninteractive automated names placement for the 1990 decennial census. Cartography and Geographic Informaton Systems, 17(1):69-78, January 1990.
	9	H. Edelsbrunner. A new approach to rectangle intersections, Paxt I. Internat. J. Comput. Math., 13:209-219# 1983.
	10	H. Edelsbrunner. A new approach to rectangle interc.ections, Part II. Internat. J. Comput. Math., 13:221-229, 1983.
	11	Michael Formann , Frank Wagner, A packing problem with applications to lettering of maps, Proceedings of the seventh annual symposium on Computational geometry, p.281-288, June 10-12, 1991, North Conway, New Hampshire, United States [doi>10.1145/109648.109680]
	12	H. Freeman. Computer naane placement, in D. J. Maguixe, M. F. Goodchild, and D. W. Rhind, editors, Geographical Information Systems: Principles and Applications, pages 445-456. Longman, London# 1991.
	13	Herbert Freeman , John Ahn, On the problem of placing names in a geographic map, International Journal of Pattern Recognition and Artificial Intelligence, v.1 n.1, p.121-140, April 1987 [doi>10.1142/S0218001487000096]
	14	Andrew V. Goldberg , Robert Kennedy, An efficient cost scaling algorithm for the assignment problem, Mathematical Programming: Series A and B, v.71 n.2, p.153-177, Dec. 20, 1995 [doi>10.1007/BF01585996]
	15	Prosenjit Gupta , Ravi Janardan , Michiel H. M. Smid, Efficient Algorithms for Counting and Reporting Pairwise Intersections Between Convex Polygons, Proceedings of the 8th Canadian Conference on Computational Geometry, p.8-13, August 12-15, 1996
	16	S, A, Itlrsch. An algorithm for automatic name placement around point data. The American Cartographer, 0(1):5-17, 1982.
	17	E. Imhof. Positioning names on maps. The American Cartographer# 2(2);128-144, 1975.
	18	Konstantinos G. Kakoulis , Ioannis G. Tollis, On the Edge Label Placement Problem, Proceedings of the Symposium on Graph Drawing, p.241-256, September 18-20, 1996
	19	Konstantinos G. Kakoulis , Ioannis G. Tollis, An Algorithm for Labeling Edges of Hierarchical Drawings, Proceedings of the 5th International Symposium on Graph Drawing, p.169-180, September 18-20, 1997
	20	T, Kato and It. Imal. The NP-completeness of the character placement problem of 2 or 3 degrees of freedom. In Record of Joint Conference of Electrical and Electronic Engineers in Kyushu, pages 11-18, 1988. In Japanese.
	21	Donald E. Knuth , Arvind Raghunathan, The problem of compatible representatives, SIAM Journal on Discrete Mathematics, v.5 n.3, p.422-427, Aug. 1992 [doi>10.1137/0405033]
	22	J. Marks and S. Shieber. The computational complexity of cartographic label placement. Technical Report 05- 91, Harvard University, 1991.
	23	Kurt Mehlhorn , Stefan Näher, LEDA: a platform for combinatorial and geometric computing, Communications of the ACM, v.38 n.1, p.96-102, Jan. 1995 [doi>10.1145/204865.204889]
	24	A. H. Robinson, J. L. Morrison, P. C. Muehrcke, A. J. Kimerling, and S. C. Guptill. Elements o.f Cartography. John Willey & Sons, Inc., (pages 420-421), 6th edition, 1995.
	25	Robert Endre Tarjan, Data structures and network algorithms, Society for Industrial and Applied Mathematics, Philadelphia, PA, 1983
	26	J. W. van Russel. An algorithm for locating candidate labeling boxes within a polygon. The American Car. tographer, 16(3):201-209, 1989.
	27	Frank Wagner , Alexander Wolff, Map labeling heuristics: provably good and practically useful, Proceedings of the eleventh annual symposium on Computational geometry, p.109-118, June 05-07, 1995, Vancouver, British Columbia, Canada [doi>10.1145/220279.220291]
	28	P. Yoeli. The logic of automated map lettering. The Cartographic Journal, 9(2):99-108, 12 1972.
	29	Steven Zoraster, The solution of large 0–1 integer programming problems encountered in automated cartography, Operations Research, v.38 n.5, p.752-759, Sep./Oct. 1990 [doi>10.1287/opre.38.5.752]

CITED BY 4

	Rob Duncan , Jianbo Qian , Antoine Vigneron , Binhai Zhu, Polynomial time algorithms for three-label point labeling, Theoretical Computer Science, v.296 n.1, p.75-87, 4 March 2003
	Ronald Azuma , Chris Furmanski, Evaluating Label Placement for Augmented Reality View Management, Proceedings of the 2nd IEEE/ACM International Symposium on Mixed and Augmented Reality, p.66, October 07-10, 2003
	Konstantinos G. Kakoulis , Ioannis G. Tollis, Algorithms for the multiple label placement problem, Computational Geometry: Theory and Applications, v.35 n.3, p.143-161, October 2006
	Ian Vollick , Daniel Vogel , Maneesh Agrawala , Aaron Hertzmann, Specifying label layout style by example, Proceedings of the 20th annual ACM symposium on User interface software and technology, October 07-10, 2007, Newport, Rhode Island, USA