{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T17:25:51Z","timestamp":1725643551246},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642258770"},{"type":"electronic","value":"9783642258787"}],"license":[{"start":{"date-parts":[[2012,1,1]],"date-time":"2012-01-01T00:00:00Z","timestamp":1325376000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-25878-7_17","type":"book-chapter","created":{"date-parts":[[2011,12,14]],"date-time":"2011-12-14T21:23:04Z","timestamp":1323897784000},"page":"166-178","source":"Crossref","is-referenced-by-count":4,"title":["Approximate Proximity Drawings"],"prefix":"10.1007","author":[{"given":"William","family":"Evans","sequence":"first","affiliation":[]},{"given":"Emden R.","family":"Gansner","sequence":"additional","affiliation":[]},{"given":"Michael","family":"Kaufmann","sequence":"additional","affiliation":[]},{"given":"Giuseppe","family":"Liotta","sequence":"additional","affiliation":[]},{"given":"Henk","family":"Meijer","sequence":"additional","affiliation":[]},{"given":"Andreas","family":"Spillner","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"17_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1007\/978-3-642-22300-6_3","volume-title":"Algorithms and Data Structures","author":"P. Angelini","year":"2011","unstructured":"Angelini, P., Bruckdorfer, T., Chiesa, M., Frati, F., Kaufmann, M., Squarcella, C.: On the Area Requirements of Euclidean Minimum Spanning Trees. In: Dehne, F., Iacono, J., Sack, J.-R. (eds.) WADS 2011. LNCS, vol.\u00a06844, pp. 25\u201336. Springer, Heidelberg (2011)"},{"issue":"6-7","key":"17_CR2","doi-asserted-by":"publisher","first-page":"329","DOI":"10.1016\/j.comgeo.2011.01.001","volume":"44","author":"B. Aronov","year":"2011","unstructured":"Aronov, B., Dulieu, M., Hurtado, F.: Witness (Delaunay) graphs. Comput. Geom.\u00a044(6-7), 329\u2013344 (2011)","journal-title":"Comput. Geom."},{"key":"17_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1007\/978-3-642-22300-6_7","volume-title":"Algorithms and Data Structures","author":"B. Aronov","year":"2011","unstructured":"Aronov, B., Dulieu, M., Hurtado, F.: Witness Rectangle Graphs. In: Dehne, F., Iacono, J., Sack, J.-R. (eds.) WADS 2011. LNCS, vol.\u00a06844, pp. 73\u201385. Springer, Heidelberg (2011)"},{"issue":"1","key":"17_CR4","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1007\/BF02086609","volume":"16","author":"P. Bose","year":"1996","unstructured":"Bose, P., Lenhart, W., Liotta, G.: Characterizing proximity trees. Algorithmica\u00a016(1), 83\u2013110 (1996)","journal-title":"Algorithmica"},{"issue":"1","key":"17_CR5","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1007\/BF02122694","volume":"10","author":"H. Fraysseix de","year":"1990","unstructured":"de Fraysseix, H., Pach, J., Pollack, R.: How to draw a planar graph on a grid. Combinatorica\u00a010(1), 41\u201351 (1990)","journal-title":"Combinatorica"},{"key":"17_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"328","DOI":"10.1007\/3-540-58950-3_388","volume-title":"Graph Drawing","author":"G. Battista Di","year":"1995","unstructured":"Di Battista, G., Lenhart, W., Liotta, G.: Proximity Drawability: a Survey. In: Tamassia, R., Tollis, I.G. (eds.) GD 1994. LNCS, vol.\u00a0894, pp. 328\u2013339. Springer, Heidelberg (1995)"},{"issue":"3","key":"17_CR7","doi-asserted-by":"publisher","first-page":"384","DOI":"10.1016\/j.jda.2005.12.004","volume":"4","author":"G. Battista Di","year":"2006","unstructured":"Di Battista, G., Liotta, G., Whitesides, S.: The strength of weak proximity. J. Discrete Algorithms\u00a04(3), 384\u2013400 (2006)","journal-title":"J. Discrete Algorithms"},{"issue":"6","key":"17_CR8","doi-asserted-by":"publisher","first-page":"283","DOI":"10.1016\/0020-0190(90)90210-O","volume":"33","author":"M.B. Dillencourt","year":"1990","unstructured":"Dillencourt, M.B.: Realizability of Delaunay triangulations. Inf. Process. Lett.\u00a033(6), 283\u2013287 (1990)","journal-title":"Inf. Process. Lett."},{"key":"17_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1007\/3-540-56939-1_71","volume-title":"Automata, Languages and Programming","author":"M.B. Dillencourt","year":"1993","unstructured":"Dillencourt, M.B., Smith, W.D.: A Simple Method for Resolving Degeneracies in Delaunay Triangulations. In: Lingas, A., Carlsson, S., Karlsson, R. (eds.) ICALP 1993. LNCS, vol.\u00a0700, pp. 177\u2013188. Springer, Heidelberg (1993)"},{"key":"17_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1007\/978-3-642-17514-5_6","volume-title":"Algorithms and Computation","author":"E. Giacomo Di","year":"2010","unstructured":"Di Giacomo, E., Didimo, W., Liotta, G., Meijer, H.: Drawing a Tree as a Minimum Spanning Tree Approximation. In: Cheong, O., Chwa, K.-Y., Park, K. (eds.) ISAAC 2010, Part II. LNCS, vol.\u00a06507, pp. 61\u201372. Springer, Heidelberg (2010)"},{"issue":"9","key":"17_CR11","doi-asserted-by":"publisher","first-page":"1502","DOI":"10.1109\/5.163414","volume":"80","author":"J.W. Jaromczyk","year":"1992","unstructured":"Jaromczyk, J.W., Toussaint, G.T.: Relative neighborhood graphs and their relatives. Proc. IEEE\u00a080(9), 1502\u20131517 (1992)","journal-title":"Proc. IEEE"},{"key":"17_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"286","DOI":"10.1007\/3-540-62495-3_55","volume-title":"Graph Drawing","author":"W. Lenhart","year":"1997","unstructured":"Lenhart, W., Liotta, G.: Proximity Drawings of Outerplanar Graphs. In: North, S.C. (ed.) GD 1996. LNCS, vol.\u00a01190, pp. 286\u2013302. Springer, Heidelberg (1997)"},{"key":"17_CR13","doi-asserted-by":"crossref","unstructured":"Li, X.: Applications of computational geometry in wireless networks. In: Cheng, X., Huang, X., Du, D.-Z. (eds.) Ad Hoc Wireless Networking, pp. 197\u2013264. Kluwer Academic Publishers (2004)","DOI":"10.1007\/978-1-4613-0223-0_7"},{"key":"17_CR14","unstructured":"Liotta, G.: Proximity drawings. In: Tamassia, R. (ed.) Handbook of Graph Drawing and Visualization. CRC Press (to appear)"}],"container-title":["Lecture Notes in Computer Science","Graph Drawing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-25878-7_17","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,21]],"date-time":"2019-04-21T20:51:25Z","timestamp":1555879885000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-25878-7_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642258770","9783642258787"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-25878-7_17","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}