{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,9]],"date-time":"2026-01-09T02:18:00Z","timestamp":1767925080715,"version":"3.49.0"},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540578994","type":"print"},{"value":"9783540483854","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1994]]},"DOI":"10.1007\/3-540-57899-4_69","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T13:41:07Z","timestamp":1330263667000},"page":"396-410","source":"Crossref","is-referenced-by-count":18,"title":["Two algorithms for finding rectangular duals of planar graphs"],"prefix":"10.1007","author":[{"given":"Goos","family":"Kant","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xin","family":"He","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,5,26]]},"reference":[{"key":"34_CR1","doi-asserted-by":"crossref","first-page":"307","DOI":"10.1002\/net.3230170306","volume":"7","author":"J. Bhasker","year":"1987","unstructured":"Bhasker, J., and S. Sahni, A linear algorithm to check for the existence of a rectangular dual of a planar triangulated graph, Networks 7 (1987), pp. 307\u2013317.","journal-title":"Networks"},{"key":"34_CR2","doi-asserted-by":"crossref","first-page":"247","DOI":"10.1007\/BF01762117","volume":"3","author":"J. Bhasker","year":"1988","unstructured":"Bhasker, J., and S. Sahni, A linear algorithm to find a rectangular dual of a planar triangulated graph, Algorithmica 3 (1988), pp. 247\u2013178.","journal-title":"Algorithmica"},{"key":"34_CR3","unstructured":"Eades, P., and R. Tamassia, Algorithms for Automatic Graph Drawing: An Annotated Bibliography, Dept. of Comp. Science, Brown Univ., Technical Report CS-89-09, 1989."},{"key":"34_CR4","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1007\/BF02122694","volume":"10","author":"H. Fraysseix de","year":"1990","unstructured":"Fraysseix, H. de, J. Pach and R. Pollack, How to draw a planar graph on a grid, Combinatorica 10 (1990), pp. 41\u201351.","journal-title":"Combinatorica"},{"key":"34_CR5","unstructured":"He, X., On finding the rectangular duals of planar triangulated graphs, SIAM J. Comput., to appear."},{"key":"34_CR6","volume-title":"Technical Report 91-05","author":"X. He","year":"1991","unstructured":"He, X., Efficient Parallel Algorithms for two Graph Layout Problems, Technical Report 91-05, Dept. of Comp. Science, State Univ. of New York at Buffalo, 1991."},{"key":"34_CR7","doi-asserted-by":"crossref","unstructured":"Kant, G., Drawing planar graphs using the lmc-ordering, Proc. 33th Ann. IEEE Symp. on Found. of Comp. Science, Pittsburgh, 1992, pp. 101\u2013110.","DOI":"10.1109\/SFCS.1992.267814"},{"key":"34_CR8","doi-asserted-by":"crossref","first-page":"145","DOI":"10.1002\/net.3230150202","volume":"5","author":"K. Ko\u017ami\u0144ski","year":"1985","unstructured":"Ko\u017ami\u0144ski, K., and E. Kinne\u00f1, Rectangular dual of planar graphs, Network 5 (1985), pp. 145\u2013157.","journal-title":"Network"},{"key":"34_CR9","doi-asserted-by":"crossref","first-page":"343","DOI":"10.1007\/BF02187706","volume":"1","author":"P. Rosenstiehl","year":"1986","unstructured":"Rosenstiehl, P., and R. E. Tarjan, Rectilinear planar layouts and bipolar orientations of planar graphs, Discr. and Comp. Geometry 1 (1986), pp. 343\u2013353.","journal-title":"Discr. and Comp. Geometry"},{"key":"34_CR10","unstructured":"Schnyder, W., Embedding planar graphs on the grid, in: Proc. 1st Annual ACM-SIAM Symp. on Discr. Alg., San Francisco, 1990, pp. 138\u2013147."},{"key":"34_CR11","doi-asserted-by":"crossref","first-page":"321","DOI":"10.1007\/BF02187705","volume":"1","author":"R. Tamassia","year":"1986","unstructured":"Tamassia, R., and I. G. Tollis, A unified approach to visibility representations of planar graphs, Discr. and Comp. Geometry 1 (1986), pp. 321\u2013341.","journal-title":"Discr. and Comp. Geometry"}],"container-title":["Lecture Notes in Computer Science","Graph-Theoretic Concepts in Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-57899-4_69.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,28]],"date-time":"2021-04-28T01:09:41Z","timestamp":1619572181000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-57899-4_69"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994]]},"ISBN":["9783540578994","9783540483854"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/3-540-57899-4_69","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[1994]]}}}