{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,4]],"date-time":"2025-05-04T00:02:29Z","timestamp":1746316949379},"publisher-location":"Berlin, Heidelberg","reference-count":26,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540654735"},{"type":"electronic","value":"9783540376231"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1998]]},"DOI":"10.1007\/3-540-37623-2_9","type":"book-chapter","created":{"date-parts":[[2007,11,19]],"date-time":"2007-11-19T07:45:17Z","timestamp":1195458317000},"page":"111-124","source":"Crossref","is-referenced-by-count":18,"title":["Balanced Aspect Ratio Trees and Their Use for Drawing Very Large Graphs"],"prefix":"10.1007","author":[{"given":"Christian A.","family":"Duncan","sequence":"first","affiliation":[]},{"given":"Michael T.","family":"Goodrich","sequence":"additional","affiliation":[]},{"given":"Stephen G.","family":"Kobourov","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[1999,1,15]]},"reference":[{"key":"9_CR1","unstructured":"S. Arya, D. M. Mount, N. S. Netanyahu, R. Silverman, and A. Wu. An optimal algorithm for approximate nearest neighbor searching. In Proc. 5th ACM-SIAM Sympos. Discrete Algorithms, pages 573\u2013582, 1994."},{"key":"9_CR2","doi-asserted-by":"crossref","unstructured":"Sunil Arya and David M. Mount. Approximate range searching. In Proc. 11th Annu. ACM Sympos. Comput. Geom., pages 172\u2013181, 1995.","DOI":"10.1145\/220279.220298"},{"key":"9_CR3","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1145\/200836.200853","volume":"42","author":"P. B. Callahan","year":"1995","unstructured":"P. B. Callahan and S. R. Kosaraju. A decomposition of multidimensional point sets with applications to k-nearest-neighbors and n-body potential fields. J. ACM, 42:67\u201390, 1995.","journal-title":"J. ACM"},{"key":"9_CR4","doi-asserted-by":"crossref","unstructured":"H. de Fraysseix, J. Pach, and R. Pollack. Small sets supporting Fary embeddings of planar graphs. In Proc. 20th Annu. ACM Sympos. Theory Comput., pages 426\u2013433, 1988.","DOI":"10.1145\/62212.62254"},{"key":"9_CR5","doi-asserted-by":"crossref","first-page":"235","DOI":"10.1016\/0925-7721(94)00014-X","volume":"4","author":"G. Battista Di","year":"1994","unstructured":"G. Di Battista, P. Eades, R. Tamassia, and I. G. Tollis. Algorithms for drawing graphs: an annotated bibliography. Comput. Geom. Theory Appl., 4:235\u2013282, 1994.","journal-title":"Comput. Geom. Theory Appl."},{"key":"9_CR6","doi-asserted-by":"crossref","unstructured":"P. Eades and Q. W. Feng. Multilevel visualization of clustered graphs. Lecture Notes in Computer Science, 1190:101-??, 1997.","DOI":"10.1007\/3-540-62495-3_41"},{"key":"9_CR7","doi-asserted-by":"crossref","unstructured":"P. Eades, Q. W. Feng, and X. Lin. Straight-line drawing algorithms for hierarchical graphs and clustered graphs. Lecture Notes in Computer Science, 1190:113-??, 1997.","DOI":"10.1007\/3-540-62495-3_42"},{"key":"9_CR8","first-page":"229","volume":"11","author":"I. Fary","year":"1948","unstructured":"I. Fary. On straight lines representation of planar graphs. Acta Sci. Math. Szeged., 11:229\u2013233, 1948.","journal-title":"Acta Sci. Math. Szeged."},{"key":"9_CR9","doi-asserted-by":"crossref","unstructured":"Q.-W. Feng, R. F. Cohen, and P. Eades. How to draw a planar clustered graph. Lecture Notes in Computer Science, 959:21-??, 1995.","DOI":"10.1007\/BFb0030816"},{"key":"9_CR10","doi-asserted-by":"crossref","unstructured":"Q.-W. Feng, R. F. Cohen, and P. Eades. Planarity for clustered graphs. Lecture Notes in Computer Science, 979:213-??, 1995.","DOI":"10.1007\/3-540-60313-1_145"},{"key":"9_CR11","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1145\/355744.355745","volume":"3","author":"J. H. Friedman","year":"1977","unstructured":"J. H. Friedman, J. L. Bentley, and R. A. Finkel. An algorithm for finding best matches in logarithmic expected time. ACM Trans. Math. Softw., 3:209\u2013226, 1977.","journal-title":"ACM Trans. Math. Softw."},{"key":"9_CR12","doi-asserted-by":"crossref","unstructured":"George W. Furnas. Generalized fisheye views. In Proceedings of ACM CHI\u201986 Conference on Human Factors in Computing Systems, Visualizing Complex Information Spaces, pages 16\u201323, 1986.","DOI":"10.1145\/22627.22342"},{"key":"9_CR13","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"278","DOI":"10.1007\/3-540-58950-3_382","volume-title":"Graph Drawing (Proc. GD\u2019 94","author":"K. Kaugars","year":"1995","unstructured":"K. Kaugars, J. Reinfelds, and A. Brazma. A simple algorithm for drawing large graphs on small screens. In R. Tamassia and I. G. Tollis, editors, Graph Drawing (Proc. GD\u2019 94, volume 894 of Lecture Notes in Computer Science, pages 278\u2013281. Springer-Verlag, 1995."},{"key":"9_CR14","doi-asserted-by":"crossref","unstructured":"R. J. Lipton, S. C. North, and J. S. Sandberg. A method for drawing graphs. In Proc. 1st Annu. ACM Sympos. Comput. Geom., pages 153\u2013160, 1985.","DOI":"10.1145\/323233.323254"},{"key":"9_CR15","doi-asserted-by":"publisher","first-page":"615","DOI":"10.1137\/0209046","volume":"9","author":"R. J. Lipton","year":"1980","unstructured":"R. J. Lipton and R. E. Tarjan. Applications of a planar separator theorem. SIAM J. Comput., 9:615\u2013627, 1980.","journal-title":"SIAM J. Comput."},{"key":"9_CR16","volume-title":"Report 85-336","author":"G. L. Miller","year":"1985","unstructured":"G. L. Miller. Finding small simple cycle separators for 2-connected planar graphs. Report 85-336, Dept. Comput. Sci., Univ. Southern California, Los Angeles,CA, 1985."},{"key":"9_CR17","doi-asserted-by":"crossref","unstructured":"Frances J. Newbery. Edge concentration: A method for clustering directed graphs. In Proceedings of the 2nd International Workshop on Software Configuration Management, pages 76\u201385, Princeton, New Jersey, October 1989.","DOI":"10.1145\/72910.73350"},{"key":"9_CR18","unstructured":"S. C. North. Drawing ranked digraphs with recursive clusters. In Graph Drawing\u2019 93, ALCOM International Workshop PARIS 1993 on Graph Drawing and Topological Graph Algorithms, September 1993."},{"key":"9_CR19","unstructured":"Sablowski and Frick. Automatic graph clustering. In GDRAWING: Conference on Graph Drawing (GD), 1996."},{"key":"9_CR20","volume-title":"The Design and Analysis of Spatial Data Structures","author":"H. Samet","year":"1990","unstructured":"H. Samet. The Design and Analysis of Spatial Data Structures. Addison-Wesley, Reading,MA, 1990."},{"issue":"12","key":"9_CR21","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1145\/198366.198384","volume":"37","author":"M. Sarkar","year":"1994","unstructured":"M. Sarkar and M. H. Brown. Graphical fisheye views. Commun. ACM, 37(12):73\u201384, 1994.","journal-title":"Commun. ACM"},{"key":"9_CR22","unstructured":"W. Schnyder. Embedding planar graphs on the grid. In Proc. 1st ACM-SIAM Sympos. Discrete Algorithms, pages 138\u2013148, 1990."},{"key":"9_CR23","doi-asserted-by":"publisher","first-page":"464","DOI":"10.2307\/2031777","volume":"2","author":"S. K. Stein","year":"1951","unstructured":"S. K. Stein. Convex maps. Proc. Amer. Math. Soc., 2:464\u2013466, 1951.","journal-title":"Proc. Amer. Math. Soc."},{"issue":"4","key":"9_CR24","first-page":"876","volume":"21","author":"K. Sugiyama","year":"1991","unstructured":"K. Sugiyama and K. Misue. Visualization of structural information: Automatic drawing of compound digraphs. IEEE Trans. Softw. Eng., 21(4):876\u2013892, 1991.","journal-title":"IEEE Trans. Softw. Eng."},{"issue":"3","key":"9_CR25","doi-asserted-by":"publisher","first-page":"743","DOI":"10.1112\/plms\/s3-13.1.743","volume":"13","author":"W. T. Tutte","year":"1963","unstructured":"W. T. Tutte. How to draw a graph. Proceedings London Mathematical Society, 13(3):743\u2013768, 1963.","journal-title":"Proceedings London Mathematical Society"},{"key":"9_CR26","first-page":"26","volume":"46","author":"K. Wagner","year":"1936","unstructured":"K. Wagner. Bemerkungen zum vierfarbenproblem. Jahresbericht der Deutschen Mathematiker-Vereinigung, 46:26\u201332, 1936.","journal-title":"Jahresbericht der Deutschen Mathematiker-Vereinigung"}],"container-title":["Lecture Notes in Computer Science","Graph Drawing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-37623-2_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,14]],"date-time":"2023-05-14T16:48:36Z","timestamp":1684082916000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-37623-2_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998]]},"ISBN":["9783540654735","9783540376231"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/3-540-37623-2_9","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[1998]]}}}