{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T23:11:41Z","timestamp":1725577901737},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642184680"},{"type":"electronic","value":"9783642184697"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"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":[[2011]]},"DOI":"10.1007\/978-3-642-18469-7_23","type":"book-chapter","created":{"date-parts":[[2011,2,10]],"date-time":"2011-02-10T05:30:40Z","timestamp":1297315840000},"page":"250-261","source":"Crossref","is-referenced-by-count":11,"title":["On Touching Triangle Graphs"],"prefix":"10.1007","author":[{"given":"Emden R.","family":"Gansner","sequence":"first","affiliation":[]},{"given":"Yifan","family":"Hu","sequence":"additional","affiliation":[]},{"given":"Stephen G.","family":"Kobourov","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"23_CR1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-04245-8","volume-title":"Computational Geometry: Algorithms and Applications","author":"M. Berg de","year":"2000","unstructured":"de Berg, M., van Kreveld, M., Overmars, M.H., Schwarzkopf, O.: Computational Geometry: Algorithms and Applications, 2nd edn. Springer, Heidelberg (2000)","edition":"2"},{"issue":"7","key":"23_CR2","doi-asserted-by":"publisher","first-page":"1794","DOI":"10.1016\/j.disc.2007.12.087","volume":"309","author":"M. Berg de","year":"2009","unstructured":"de Berg, M., Mumford, E., Speckmann, B.: On rectilinear duals for vertex-weighted plane graphs. Discrete Mathematics\u00a0309(7), 1794\u20131812 (2009)","journal-title":"Discrete Mathematics"},{"key":"23_CR3","volume-title":"Handbook of Discrete and Computational Geometry","author":"M. Bern","year":"1997","unstructured":"Bern, M.: Triangulations. In: Goodman, J.E., O\u2019Rourke, J. (eds.) Handbook of Discrete and Computational Geometry. CRC Press, Boca Raton (1997)"},{"key":"23_CR4","doi-asserted-by":"publisher","first-page":"247","DOI":"10.1007\/BF01762117","volume":"3","author":"J. Bhasker","year":"1988","unstructured":"Bhasker, J., Sahni, S.: A linear algorithm to find a rectangular dual of a planar triangulated graph. Algorithmica\u00a03, 247\u2013278 (1988)","journal-title":"Algorithmica"},{"issue":"2","key":"23_CR5","doi-asserted-by":"publisher","first-page":"214","DOI":"10.1137\/0406017","volume":"6","author":"G.R. Brightwell","year":"1993","unstructured":"Brightwell, G.R., Scheinerman, E.R.: Representations of planar graphs. SIAM Journal on Discrete Mathematics\u00a06(2), 214\u2013229 (1993)","journal-title":"SIAM Journal on Discrete Mathematics"},{"key":"23_CR6","doi-asserted-by":"crossref","unstructured":"Buchsbaum, A.L., Gansner, E.R., Procopiuc, C.M., Venkatasubramanian, S.: Rectangular layouts and contact graphs. ACM Transactions on Algorithms\u00a04(1) (2008)","DOI":"10.1145\/1328911.1328919"},{"key":"23_CR7","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1017\/S0963548300001139","volume":"3","author":"H. Fraysseix de","year":"1994","unstructured":"de Fraysseix, H., de Mendez, P.O., Rosenstiehl, P.: On triangle contact graphs. Combinatorics, Probability and Computing\u00a03, 233\u2013246 (1994)","journal-title":"Combinatorics, Probability and Computing"},{"key":"23_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1007\/978-3-540-77537-9_15","volume-title":"Graph Drawing","author":"H. Fraysseix de","year":"2008","unstructured":"de Fraysseix, H., de Mendez, P.O., Rosenstiehl, P.: Representation of planar hypergraphs by contacts of triangles. In: Hong, S.-H., Nishizeki, T., Quan, W. (eds.) GD 2007. LNCS, vol.\u00a04875, pp. 125\u2013136. Springer, Heidelberg (2008)"},{"key":"23_CR9","doi-asserted-by":"crossref","unstructured":"de Fraysseix, H., Pach, J., Pollack, R.: Small sets supporting Fary embeddings of planar graphs. In: 20th Symposium on Theory of Computing (STOC), pp. 426\u2013433 (1988)","DOI":"10.1145\/62212.62254"},{"key":"23_CR10","doi-asserted-by":"crossref","unstructured":"Gansner, E., Hu, Y., Kaufmann, M., Kobourov, S.: Optimal polygonal representation of planar graphs. In: 9th LATIN Sympoisum, pp. 417\u2013432 (2010)","DOI":"10.1007\/978-3-642-12200-2_37"},{"key":"23_CR11","volume-title":"Graph Theory","author":"F. Harary","year":"1972","unstructured":"Harary, F.: Graph Theory. Addison-Wesley, Reading (1972)"},{"issue":"6","key":"23_CR12","doi-asserted-by":"publisher","first-page":"1218","DOI":"10.1137\/0222072","volume":"22","author":"X. He","year":"1993","unstructured":"He, X.: On finding the rectangular duals of planar triangular graphs. SIAM Journal of Computing\u00a022(6), 1218\u20131226 (1993)","journal-title":"SIAM Journal of Computing"},{"issue":"6","key":"23_CR13","doi-asserted-by":"publisher","first-page":"2150","DOI":"10.1137\/S0097539796308874","volume":"28","author":"X. He","year":"1999","unstructured":"He, X.: On floor-plan of plane graphs. SIAM Journal of Computing\u00a028(6), 2150\u20132167 (1999)","journal-title":"SIAM Journal of Computing"},{"issue":"4","key":"23_CR14","doi-asserted-by":"publisher","first-page":"549","DOI":"10.1145\/321850.321852","volume":"21","author":"J. Hopcroft","year":"1974","unstructured":"Hopcroft, J., Tarjan, R.E.: Efficient planarity testing. Journal of the ACM\u00a021(4), 549\u2013568 (1974)","journal-title":"Journal of the ACM"},{"key":"23_CR15","doi-asserted-by":"crossref","unstructured":"Kant, G.: Hexagonal grid drawings. In: 18th Workshop on Graph-Theoretic Concepts in Computer Science, pp. 263\u2013276 (1992)","DOI":"10.1007\/3-540-56402-0_53"},{"key":"23_CR16","first-page":"141","volume":"88","author":"P. Koebe","year":"1936","unstructured":"Koebe, P.: Kontaktprobleme der konformen Abbildung. Berichte \u00fcber die Verhandlungen der S\u00e4chsischen Akademie der Wissenschaften zu Leipzig. Math.-Phys. Klasse\u00a088, 141\u2013164 (1936)","journal-title":"Berichte \u00fcber die Verhandlungen der S\u00e4chsischen Akademie der Wissenschaften zu Leipzig. Math.-Phys. Klasse"},{"key":"23_CR17","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.: Compact floor-planning via orderly spanning trees. Journal of Algorithms\u00a048, 441\u2013451 (2003)","journal-title":"Journal of Algorithms"},{"issue":"1","key":"23_CR18","doi-asserted-by":"publisher","first-page":"62","DOI":"10.1016\/S0196-6774(03)00126-3","volume":"50","author":"M. Rahman","year":"2004","unstructured":"Rahman, M., Nishizeki, T., Ghosh, S.: Rectangular drawings of planar graphs. Journal of Algorithms\u00a050(1), 62\u201378 (2004)","journal-title":"Journal of Algorithms"},{"key":"23_CR19","volume-title":"Vorlesungen \u00fcber die Theorie der Polyeder","author":"E. Steinitz","year":"1934","unstructured":"Steinitz, E., Rademacher, H.: Vorlesungen \u00fcber die Theorie der Polyeder. Springer, Berlin (1934)"},{"key":"23_CR20","first-page":"43","volume-title":"Progress in Graph Theory","author":"C. Thomassen","year":"1984","unstructured":"Thomassen, C.: Plane representations of graphs. In: Bondy, J.A., Murty, U.S.R. (eds.) Progress in Graph Theory, pp. 43\u201369. Academic Press, Canada (1984)"},{"key":"23_CR21","doi-asserted-by":"publisher","first-page":"336","DOI":"10.1112\/jlms\/s1-28.3.336","volume":"28","author":"P. Ungar","year":"1953","unstructured":"Ungar, P.: On diagrams representing maps. Journal of the London Mathematical Society\u00a028, 336\u2013342 (1953)","journal-title":"Journal of the London Mathematical Society"}],"container-title":["Lecture Notes in Computer Science","Graph Drawing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-18469-7_23","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,21]],"date-time":"2019-05-21T07:36:03Z","timestamp":1558424163000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-18469-7_23"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642184680","9783642184697"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-18469-7_23","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}