{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T08:23:59Z","timestamp":1725524639620},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642002182"},{"type":"electronic","value":"9783642002199"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-3-642-00219-9_27","type":"book-chapter","created":{"date-parts":[[2009,2,4]],"date-time":"2009-02-04T08:03:51Z","timestamp":1233734631000},"page":"284-295","source":"Crossref","is-referenced-by-count":0,"title":["Placing Text Boxes on Graphs"],"prefix":"10.1007","author":[{"given":"Sjoerd","family":"van Hagen","sequence":"first","affiliation":[]},{"given":"Marc","family":"van Kreveld","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"4","key":"27_CR1","doi-asserted-by":"publisher","first-page":"532","DOI":"10.1016\/0196-6774(86)90017-9","volume":"7","author":"B. Baker","year":"1986","unstructured":"Baker, B., Fortune, S., Mahaney, S.: Polygon containment under translation. J. Algorithms\u00a07(4), 532\u2013548 (1986)","journal-title":"J. Algorithms"},{"issue":"5","key":"27_CR2","doi-asserted-by":"publisher","first-page":"613","DOI":"10.1007\/PL00005845","volume":"31","author":"M. Berg de","year":"1998","unstructured":"de Berg, M., Cheong, O., Devillers, O., van Kreveld, M., Teillaud, M.: Computing the maximum overlap of two convex polygons under translations. Theory Comput. Syst.\u00a031(5), 613\u2013628 (1998)","journal-title":"Theory Comput. Syst."},{"key":"27_CR3","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-540-77974-2","volume-title":"Computational Geometry \u2013 Algorithms and Applications","author":"M. Berg de","year":"2008","unstructured":"de Berg, M., Cheong, O., van Kreveld, M., Overmars, M.: Computational Geometry \u2013 Algorithms and Applications, 3rd edn. Springer, Berlin (2008)","edition":"3"},{"issue":"2","key":"27_CR4","doi-asserted-by":"publisher","first-page":"116","DOI":"10.1007\/BF01182771","volume":"11","author":"B. Chazelle","year":"1994","unstructured":"Chazelle, B., Edelsbrunner, H., Guibas, L., Sharir, M.: Algorithms for bichromatic line-segment problems and polyhedral terrains. Algorithmica\u00a011(2), 116\u2013132 (1994)","journal-title":"Algorithmica"},{"key":"27_CR5","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1016\/0925-7721(95)00041-0","volume":"7","author":"K. Daniels","year":"1997","unstructured":"Daniels, K., Milenkovic, V., Roth, D.: Finding the largest area axis-parallel rectangle in a polygon. Comput. Geom. Theory Appl.\u00a07, 125\u2013148 (1997)","journal-title":"Comput. Geom. Theory Appl."},{"issue":"1","key":"27_CR6","doi-asserted-by":"publisher","first-page":"30","DOI":"10.1109\/38.974516","volume":"22","author":"U. Dogrus\u00f6z","year":"2002","unstructured":"Dogrus\u00f6z, U., Feng, Q.W., Madden, B., Doorley, M., Frick, A.: Graph visualization toolkits. IEEE Computer Graphics and Appl.\u00a022(1), 30\u201337 (2002)","journal-title":"IEEE Computer Graphics and Appl."},{"issue":"12","key":"27_CR7","doi-asserted-by":"publisher","first-page":"2459","DOI":"10.1016\/j.ins.2007.01.019","volume":"177","author":"U. Dogrus\u00f6z","year":"2007","unstructured":"Dogrus\u00f6z, U., Kakoulis, K., Madden, B., Tollis, I.: On labeling in graph visualization. Inf. Sci.\u00a0177(12), 2459\u20132472 (2007)","journal-title":"Inf. Sci."},{"issue":"2","key":"27_CR8","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1007\/PL00009494","volume":"23","author":"A. Efrat","year":"2000","unstructured":"Efrat, A., Sharir, M.: On the complexity of the union of fat convex objects in the plane. Discr. & Comput. Geometry\u00a023(2), 171\u2013189 (2000)","journal-title":"Discr. & Comput. Geometry"},{"key":"27_CR9","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1007\/s10707-006-0002-z","volume":"11","author":"J. Gudmundsson","year":"2007","unstructured":"Gudmundsson, J., van Kreveld, M., Speckmann, B.: Efficient detection of patterns in 2D trajectories of moving points. GeoInformatica\u00a011, 195\u2013215 (2007)","journal-title":"GeoInformatica"},{"issue":"3","key":"27_CR10","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1007\/s00453-004-1123-0","volume":"41","author":"S. Har-Peled","year":"2005","unstructured":"Har-Peled, S., Mazumdar, S.: Fast algorithms for computing the smallest k-enclosing circle. Algorithmica\u00a041(3), 147\u2013157 (2005)","journal-title":"Algorithmica"},{"issue":"1\u20133","key":"27_CR11","doi-asserted-by":"publisher","first-page":"170","DOI":"10.1016\/S0019-9958(86)80033-X","volume":"68","author":"K. Hoffman","year":"1986","unstructured":"Hoffman, K., Mehlhorn, K., Rosenstiehl, P., Tarjan, R.: Sorting jordan sequences in linear time using level-linked search trees. Information and Control\u00a068(1\u20133), 170\u2013184 (1986)","journal-title":"Information and Control"},{"key":"27_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1007\/3-540-63938-1_61","volume-title":"Graph Drawing","author":"C. Iturriaga","year":"1997","unstructured":"Iturriaga, C., Lubiw, A.: Elastic labels: the two-axis case. In: DiBattista, G. (ed.) GD 1997. LNCS, vol.\u00a01353, pp. 181\u2013192. Springer, Heidelberg (1997)"},{"issue":"1","key":"27_CR13","doi-asserted-by":"publisher","first-page":"14","DOI":"10.1016\/S0196-6774(03)00004-X","volume":"47","author":"C. Iturriaga","year":"2003","unstructured":"Iturriaga, C., Lubiw, A.: Elastic labels around the perimeter of a map. J. Algorithms\u00a047(1), 14\u201339 (2003)","journal-title":"J. Algorithms"},{"issue":"1","key":"27_CR14","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1142\/S0218195903001062","volume":"13","author":"K. Kakoulis","year":"2003","unstructured":"Kakoulis, K., Tollis, I.: A unified approach to automatic label placement. Int. J. Comput. Geometry Appl.\u00a013(1), 23\u201360 (2003)","journal-title":"Int. J. Comput. Geometry Appl."},{"key":"27_CR15","doi-asserted-by":"publisher","first-page":"197","DOI":"10.1016\/S0925-7721(96)00016-8","volume":"9","author":"M. Kreveld van","year":"1998","unstructured":"van Kreveld, M.: On fat partitioning, fat covering, and the union size of polygons. Comput. Geom. Theory Appl.\u00a09, 197\u2013210 (1998)","journal-title":"Comput. Geom. Theory Appl."},{"key":"27_CR16","first-page":"222","volume-title":"GIS 2004: Proc. 12th annu. ACM Int. Symp. on Advances in Geographic Information Systems","author":"M. Kreveld van","year":"2004","unstructured":"van Kreveld, M., Schramm, E., Wolff, A.: Algorithms for the placement of diagrams on maps. In: GIS 2004: Proc. 12th annu. ACM Int. Symp. on Advances in Geographic Information Systems, pp. 222\u2013231. ACM Press, New York (2004)"},{"issue":"1","key":"27_CR17","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1006\/cviu.1996.0045","volume":"64","author":"D. Mount","year":"1996","unstructured":"Mount, D., Silverman, R., Wu, A.: On the area of overlap of translated polygons. Computer Vision and Image Understanding\u00a064(1), 53\u201361 (1996)","journal-title":"Computer Vision and Image Understanding"},{"key":"27_CR18","doi-asserted-by":"crossref","unstructured":"Paterson, M., Yao, F.: Binary partitions with applications to hidden surface removal and solid modelling. In: Proc. 5th annual ACM Symp. on Computational Geometry, pp. 23\u201332 (1989)","DOI":"10.1145\/73833.73836"},{"key":"27_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"387","DOI":"10.1007\/3-540-62495-3_62","volume-title":"Graph Drawing","author":"K. Ryall","year":"1997","unstructured":"Ryall, K., Marks, J., Shieber, S.: An interactive system for drawing graphs. In: North, S.C. (ed.) GD 1996. LNCS, vol.\u00a01190, pp. 387\u2013394. Springer, Heidelberg (1997)"},{"key":"27_CR20","doi-asserted-by":"crossref","unstructured":"van der Stappen, A.: Motion Planning amidst Fat Obstacles. Ph.D. thesis, Department of Computer Science, Utrecht University (1994)","DOI":"10.1145\/177424.177453"},{"key":"27_CR21","first-page":"87","volume-title":"Principles of Visual Information Retrieval","author":"R. Veltkamp","year":"2000","unstructured":"Veltkamp, R., Hagedoorn, M.: State of the art in shape matching. In: Lew, M. (ed.) Principles of Visual Information Retrieval, pp. 87\u2013119. Springer, Heidelberg (2000)"}],"container-title":["Lecture Notes in Computer Science","Graph Drawing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-00219-9_27","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,9,30]],"date-time":"2021-09-30T22:13:13Z","timestamp":1633039993000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-00219-9_27"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642002182","9783642002199"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-00219-9_27","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}