{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,17]],"date-time":"2024-09-17T10:50:50Z","timestamp":1726570250321},"publisher-location":"Berlin, Heidelberg","reference-count":23,"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_5","type":"book-chapter","created":{"date-parts":[[2007,11,19]],"date-time":"2007-11-19T07:45:17Z","timestamp":1195458317000},"page":"57-71","source":"Crossref","is-referenced-by-count":15,"title":["Difference Metrics for Interactive Orthogonal Graph Drawing Algorithms"],"prefix":"10.1007","author":[{"given":"Stina","family":"Bridgeman","sequence":"first","affiliation":[]},{"given":"Roberto","family":"Tamassia","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[1999,1,15]]},"reference":[{"key":"5_CR1","doi-asserted-by":"crossref","unstructured":"H. Alt, O. Aichholzer, and G. Rote. Matching shapes with a reference point. Internat. J. Comput. Geom. Appl., 1997. to appear.","DOI":"10.1142\/S0218195997000211"},{"key":"5_CR2","doi-asserted-by":"crossref","unstructured":"T. Biedl and M. Kaufmann. Area-efficient static and incremental graph drawings. In R. Burkard and G. Woeginger, editors, Algorithms-ESA\u2019 97, volume 1284 of Lecture Notes Comput. Sci, pages 37\u201352. Springer-Verlag, 1997.","DOI":"10.1007\/3-540-63397-9_4"},{"key":"5_CR3","doi-asserted-by":"crossref","unstructured":"U. Brandes and D. Wagner. A bayesian paradigma for dynamic graph layout. In G. Di Battista, editor, Graph Drawing (Proc. GD\u2019 97, volume 1353 of Lecture Notes Comput. Sci., pages 236\u2013247. Springer-Verlag, 1997.","DOI":"10.1007\/3-540-63938-1_66"},{"key":"5_CR4","doi-asserted-by":"crossref","unstructured":"S. S. Bridgeman, J. Fanto, A. Garg, R. Tamassia, and L. Vismara. Interactive-Giotto: An algorithm for interactive orthogonal graph drawing. In G. Di Battista, editor, Graph Drawing (Proc. GD\u2019 97, volume 1353 of Lecture Notes Comput. Sci., pages 303\u2013308. Springer-Verlag, 1997.","DOI":"10.1007\/3-540-63938-1_73"},{"key":"5_CR5","doi-asserted-by":"crossref","first-page":"113","DOI":"10.1016\/0925-7721(95)00047-X","volume":"7","author":"L. P. Chew","year":"1997","unstructured":"L. P. Chew, M. T. Goodrich, D. P. Huttenlocher, K. Kedem, J. M. Kleinberg, and D. Kravets. Geometric pattern matching under Euclidean motion. Comput. Geom. Theory Appl., 7:113\u2013124, 1997.","journal-title":"Comput. Geom. Theory Appl."},{"issue":"5","key":"5_CR6","doi-asserted-by":"publisher","first-page":"970","DOI":"10.1137\/S0097539792235724","volume":"24","author":"R. F. Cohen","year":"1995","unstructured":"R. F. Cohen, G. Di Battista, R. Tamassia, and I. G. Tollis. Dynamic graph drawings: Trees, series-parallel digraphs, and planar ST-digraphs. SIAM J. Comput., 24(5):970\u20131001, 1995.","journal-title":"SIAM J. Comput."},{"key":"5_CR7","doi-asserted-by":"crossref","first-page":"303","DOI":"10.1016\/S0925-7721(96)00005-3","volume":"7","author":"G. Battista Di","year":"1997","unstructured":"G. Di Battista, A. Garg, G. Liotta, R. Tamassia, E. Tassinari, and F. Vargiu. An experimental comparison of four graph drawing algorithms. Comput. Geom. Theory Appl., 7:303\u2013326, 1997.","journal-title":"Comput. Geom. Theory Appl."},{"key":"5_CR8","unstructured":"P. Eades, W. Lai, K. Misue, and K. Sugiyama. Preserving the mental map of a diagram. In Proceedings of Compugraphics 91, pages 24\u201333, 1991."},{"key":"5_CR9","doi-asserted-by":"crossref","unstructured":"U. F\u00f6\u00dfmeier. Interactive orthogonal graph drawing: Algorithms and bounds. In G. Di Battista, editor, Graph Drawing (Proc. GD\u2019 97, volume 1353 of Lecture Notes Comput. Sci., pages 111\u2013123. Springer-Verlag, 1997.","DOI":"10.1007\/3-540-63938-1_55"},{"key":"5_CR10","doi-asserted-by":"publisher","first-page":"484","DOI":"10.1137\/0212032","volume":"12","author":"J. E. Goodman","year":"1983","unstructured":"J. E. Goodman and R. Pollack. Multidimensional sorting. SIAM J. Comput., 12:484\u2013507, 1983.","journal-title":"SIAM J. Comput."},{"key":"5_CR11","unstructured":"M. T. Goodrich, J. S. B. Mitchell, and M. W. Orletsky. Practical methods for approximate geometric pattern matching un der rigid motion. IEEE Trans. Pattern Anal. Mach. Intell. to appear."},{"key":"5_CR12","doi-asserted-by":"crossref","unstructured":"K. Imai, S. Sumino, and H. Imai. Minimax geometric fitting of two corresponding sets of points. In Proc. 5th Annu. ACM Sympos. Comput. Geom., pages 266\u2013275, 1989.","DOI":"10.1145\/73833.73863"},{"issue":"1","key":"5_CR13","doi-asserted-by":"crossref","first-page":"1","DOI":"10.7155\/jgaa.00004","volume":"2","author":"K. A. Lyons","year":"1998","unstructured":"K. A. Lyons, H. Meijer, and D. Rappaport. Algorithms for cluster busting in anchored graph drawing. Journal of Graph Algorithms and Applications, 2(1):1\u201324, 1998.","journal-title":"Journal of Graph Algorithms and Applications"},{"key":"5_CR14","doi-asserted-by":"crossref","unstructured":"K. Miriyala, S. W. Hornick, and R. Tamassia. An incremental approach to aesthetic graph layout. In Proc. Internat. Workshop on Computer-Aided Software Engineering, 1993.","DOI":"10.1109\/CASE.1993.634832"},{"issue":"2","key":"5_CR15","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1006\/jvlc.1995.1010","volume":"6","author":"K. Misue","year":"1995","unstructured":"K. Misue, P. Eades, W. Lai, and K. Sugiyama. Layout adjustment and the mental map. J. Visual Lang. Comput., 6(2):183\u2013210, 1995.","journal-title":"J. Visual Lang. Comput."},{"key":"5_CR16","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1109\/52.56447","volume":"7","author":"S. Moen","year":"1990","unstructured":"S. Moen. Drawing dynamic trees. IEEE Software, 7:21\u20138, 1990.","journal-title":"IEEE Software"},{"key":"5_CR17","doi-asserted-by":"crossref","unstructured":"S. North. Incremental layout in DynaDAG. In Graph Drawing (Proc. GD\u2019 95), volume 1027 of Lecture Notes Comput. Sci., pages 409\u2013418. Springer-Verlag, 1996.","DOI":"10.1007\/BFb0021824"},{"key":"5_CR18","doi-asserted-by":"crossref","unstructured":"A. Papakostas, J. M. Six, and I. G. Tollis. Experimental and theoretical results in interactive graph drawing. In S. North, editor, Graph Drawing (Proc. GD\u2019 96), volume 1190 of Lecture Notes Comput. Sci., pages 371\u2013386. Springer-Verlag, 1997.","DOI":"10.1007\/3-540-62495-3_61"},{"key":"5_CR19","unstructured":"A. Papakostas and I. G. Tollis. Interactive orthogonal graph drawing. In Graph Drawing (Proc. GD\u2019 95), volume 1027 of Lecture Notes Comput. Sci. Springer-Verlag, 1996."},{"key":"5_CR20","doi-asserted-by":"crossref","unstructured":"H. Purchase. Which aesthetic has the greatest effect on human understanding? In G. Di Battista, editor, Graph Drawing (Proc. GD\u2019 97), Lecture Notes Comput. Sci., pages 248\u2013261. Springer-Verlag, 1997.","DOI":"10.1007\/3-540-63938-1_67"},{"key":"5_CR21","doi-asserted-by":"crossref","unstructured":"H. C. Purchase, R. F. Cohen, and M. James. Validating graph drawing aesthetics. In F.J. Brandenburg, editor, Graph Drawing (Proc. GD\u2019 95, volume 1027 of Lecture Notes Comput. Sci., pages 435\u2013446. Springer-Verlag, 1996.","DOI":"10.1007\/BFb0021827"},{"key":"5_CR22","doi-asserted-by":"crossref","unstructured":"K. Ryall, J. Marks, and S. Shieber. An interactive system for drawing graphs. In S. North, editor, Graph Drawing (Proc. GD\u2019 96, volume 1190 of Lecture Notes Comput. Sci., pages 387\u2013393. Springer-Verlag, 1997.","DOI":"10.1007\/3-540-62495-3_62"},{"issue":"1","key":"5_CR23","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1109\/21.87055","volume":"SMC-18","author":"R. Tamassia","year":"1988","unstructured":"R. Tamassia, G. Di Battista, and C. Batini. Automatic graph drawing and readability of diagrams. IEEE Trans. Syst. Man Cybern., SMC-18(1):61\u201379, 1988.","journal-title":"IEEE Trans. Syst. Man Cybern."}],"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_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,4]],"date-time":"2019-05-04T15:20:17Z","timestamp":1556983217000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-37623-2_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998]]},"ISBN":["9783540654735","9783540376231"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/3-540-37623-2_5","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[1998]]}}}