{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:24:24Z","timestamp":1759638264840},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540314257"},{"type":"electronic","value":"9783540316671"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11618058_6","type":"book-chapter","created":{"date-parts":[[2006,1,20]],"date-time":"2006-01-20T04:56:50Z","timestamp":1137733010000},"page":"61-72","source":"Crossref","is-referenced-by-count":5,"title":["On Rectilinear Duals for Vertex-Weighted Plane Graphs"],"prefix":"10.1007","author":[{"given":"Mark","family":"de Berg","sequence":"first","affiliation":[]},{"given":"Elena","family":"Mumford","sequence":"additional","affiliation":[]},{"given":"Bettina","family":"Speckmann","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"6_CR1","doi-asserted-by":"publisher","first-page":"307","DOI":"10.1002\/net.3230170306","volume":"7","author":"J. Bhasker","year":"1987","unstructured":"Bhasker, J., Sahni, S.: A linear algorithm to check for the existence of a rectangular dual of a planar triangulated graph. Networks\u00a07, 307\u2013317 (1987)","journal-title":"Networks"},{"key":"6_CR2","unstructured":"Biedl, T., Genc, B.: Complexity of octagonal and rectangular cartograms. In: Proceedings of the 17th Canadian Conference on Computational Geometry, pp. 117\u2013120 (2005)"},{"issue":"5","key":"6_CR3","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1016\/0020-0190(92)90210-M","volume":"44","author":"F. d\u2019Amore","year":"1992","unstructured":"d\u2019Amore, F., Franciosa, P.G.: On the optimal binary plane partition for sets of isothetic rectangles. Information Processing Letters\u00a044(5), 255\u2013259 (1992)","journal-title":"Information Processing Letters"},{"key":"6_CR4","volume-title":"Cartography - thematic map design","author":"B. Dent","year":"1999","unstructured":"Dent, B.: Cartography - thematic map design, 5th edn. McGraw-Hill, New York (1999)","edition":"5"},{"key":"6_CR5","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1111\/j.0033-0124.1985.00075.x","volume":"37","author":"J.A. Dougenik","year":"1985","unstructured":"Dougenik, J.A., Chrisman, N.R., Niemeyer, D.R.: An algorithm to construct continous area cartograms. Professional Geographer\u00a037, 75\u201381 (1985)","journal-title":"Professional Geographer"},{"key":"6_CR6","doi-asserted-by":"crossref","unstructured":"Heilmann, R., Keim, D.A., Panse, C., Sips, M.: Recmap: Rectangular map approximations. In: Proceedings of the IEEE Symposium on Information Visualization (INFOVIS), pp. 33\u201340 (2004)","DOI":"10.1109\/INFVIS.2004.57"},{"key":"6_CR7","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1016\/S0304-3975(95)00257-X","volume":"172","author":"G. Kant","year":"1997","unstructured":"Kant, G., He, X.: Regular edge labeling of 4-connected plane graphs and its applications in graph drawing problems. Theoretical Computer Science\u00a0172, 175\u2013193 (1997)","journal-title":"Theoretical Computer Science"},{"key":"6_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., Kinnen, E.: Rectangular dual of planar graphs. Networks\u00a05, 145\u2013157 (1985)","journal-title":"Networks"},{"key":"6_CR9","doi-asserted-by":"publisher","first-page":"441","DOI":"10.1016\/S0196-6774(03)00057-9","volume":"48","author":"C.-C. Liao","year":"2003","unstructured":"Liao, C.-C., Lu, H.-I., Yen, H.-C.: Floor-planning using orderly spanning trees. Journal of Algorithms\u00a048, 441\u2013451 (2003)","journal-title":"Journal of Algorithms"},{"key":"6_CR10","unstructured":"NCGIA \/ USGS. Cartogram Central (2002), http:\/\/www.ncgia.ucsb.edu\/projects\/Cartogram_Central\/index.html"},{"key":"6_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"320","DOI":"10.1007\/978-3-540-30559-0_27","volume-title":"Graph-Theoretic Concepts in Computer Science","author":"M.S. Rahman","year":"2004","unstructured":"Rahman, M.S., Miura, K., Nishizeki, T.: Octagonal drawings of plane graphs with prescribed face areas. In: Hromkovi\u010d, J., Nagl, M., Westfechtel, B. (eds.) WG 2004. LNCS, vol.\u00a03353, pp. 320\u2013331. Springer, Heidelberg (2004)"},{"key":"6_CR12","doi-asserted-by":"publisher","first-page":"292","DOI":"10.2307\/208794","volume":"24","author":"E. Raisz","year":"1934","unstructured":"Raisz, E.: The rectangular statistical cartogram. Geographical Review\u00a024, 292\u2013296 (1934)","journal-title":"Geographical Review"},{"key":"6_CR13","doi-asserted-by":"publisher","first-page":"371","DOI":"10.1017\/S0963548300000407","volume":"1","author":"C. Thomassen","year":"1992","unstructured":"Thomassen, C.: Plane cubic graphs with prescribed face areas. Combinatorics, Probability and Computing\u00a01, 371\u2013381 (1992)","journal-title":"Combinatorics, Probability and Computing"},{"key":"6_CR14","doi-asserted-by":"crossref","unstructured":"van Kreveld, M., Speckmann, B.: On rectangular cartograms. Computational Geometry: Theory and Applications (2005) (to appear)","DOI":"10.1007\/978-3-540-30140-0_64"},{"issue":"2","key":"6_CR15","doi-asserted-by":"publisher","first-page":"258","DOI":"10.1137\/S0895480191266700","volume":"8","author":"G.K. Yeap","year":"1995","unstructured":"Yeap, G.K., Sarrafzadeh, M.: Sliceable floorplanning by graph dualization. SIAM Journal of Discrete Mathematics\u00a08(2), 258\u2013280 (1995)","journal-title":"SIAM Journal of Discrete Mathematics"}],"container-title":["Lecture Notes in Computer Science","Graph Drawing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11618058_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,12]],"date-time":"2020-04-12T02:11:00Z","timestamp":1586657460000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11618058_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540314257","9783540316671"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/11618058_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}