{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T16:03:20Z","timestamp":1725552200302},"publisher-location":"Berlin, Heidelberg","reference-count":17,"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_17","type":"book-chapter","created":{"date-parts":[[2006,1,20]],"date-time":"2006-01-20T09:56:50Z","timestamp":1137751010000},"page":"177-188","source":"Crossref","is-referenced-by-count":7,"title":["Transversal Structures on Triangulations, with Application to Straight-Line Drawing"],"prefix":"10.1007","author":[{"given":"\u00c9ric","family":"Fusy","sequence":"first","affiliation":[]}],"member":"297","reference":[{"issue":"4","key":"17_CR1","doi-asserted-by":"publisher","first-page":"427","DOI":"10.1007\/PL00009182","volume":"19","author":"T.C. Biedl","year":"1997","unstructured":"Biedl, T.C., Kant, G., Kaufmann, M.: On triangulating planar graphs under the four-connectivity constraint. Algorithmica\u00a019(4), 427\u2013446 (1997)","journal-title":"Algorithmica"},{"key":"17_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"60","DOI":"10.1007\/978-3-540-31843-9_8","volume-title":"Graph Drawing","author":"N. Bonichon","year":"2005","unstructured":"Bonichon, N., Felsner, S., Mosbah, M.: Convex drawings of 3-connected plane graphs. In: Pach, J. (ed.) GD 2004. LNCS, vol.\u00a03383, pp. 60\u201370. Springer, Heidelberg (2005)"},{"key":"17_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"270","DOI":"10.1007\/978-3-540-30559-0_23","volume-title":"Graph-Theoretic Concepts in Computer Science","author":"N. Bonichon","year":"2004","unstructured":"Bonichon, N., Gavoille, C., Hanusse, N., Poulalhon, D., Schaeffer, G.: Planar graphs, via well-orderly maps and trees. In: Hromkovi\u010d, J., Nagl, M., Westfechtel, B. (eds.) WG 2004. LNCS, vol.\u00a03353, pp. 270\u2013284. Springer, Heidelberg (2004)"},{"key":"17_CR4","first-page":"109","volume":"63","author":"H. Fraysseix de","year":"1991","unstructured":"de Fraysseix, H., Ossona de Mendez, P., Pach, J.: Representation of planar graphs by segments. Intuitive Geometry\u00a063, 109\u2013117 (1991)","journal-title":"Intuitive Geometry"},{"issue":"2-3","key":"17_CR5","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1016\/0166-218X(94)00085-R","volume":"56","author":"H. Fraysseix de","year":"1995","unstructured":"de Fraysseix, H., Ossona de Mendez, P., Rosenstiehl, P.: Bipolar orientations revisited. Discrete Appl. Math.\u00a056(2-3), 157\u2013179 (1995)","journal-title":"Discrete Appl. Math."},{"key":"17_CR6","unstructured":"de Mendez, P.O.: Orientations bipolaires. PhD thesis, Paris (1994)"},{"key":"17_CR7","doi-asserted-by":"crossref","unstructured":"Felsner, S.: Lattice structures from planar graphs. Electronic Journal of Combinatorics\u00a0(R15), 24 (2004)","DOI":"10.37236\/1768"},{"key":"17_CR8","unstructured":"Fusy, \u00c9., Poulalhon, D., Schaeffer, G.: Dissections and trees, with applications to optimal mesh encoding and to random sampling. In: 16th Annual ACM-SIAM Symposium on Discrete Algorithms (January 2005)"},{"key":"17_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1007\/BFb0021812","volume-title":"Graph Drawing","author":"X. He","year":"1996","unstructured":"He, X.: Grid embedding of 4-connected plane graphs. In: Brandenburg, F.J. (ed.) GD 1995. LNCS, vol.\u00a01027, pp. 287\u2013299. Springer, Heidelberg (1996)"},{"issue":"1-2","key":"17_CR10","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(1-2), 175\u2013193 (1997)","journal-title":"Theoretical Computer Science"},{"issue":"2","key":"17_CR11","doi-asserted-by":"crossref","first-page":"73","DOI":"10.1007\/s00454-001-0004-4","volume":"26","author":"K. Miura","year":"2001","unstructured":"Miura, K., Nakano, S., Nishizeki, T.: Grid drawings of four-connected plane graphs. Disc. Comput. Geometry\u00a026(2), 73\u201387 (2001)","journal-title":"Disc. Comput. Geometry"},{"key":"17_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1080","DOI":"10.1007\/3-540-45061-0_83","volume-title":"Automata, Languages and Programming","author":"D. Poulalhon","year":"2003","unstructured":"Poulalhon, D., Schaeffer, G.: Optimal coding and sampling of triangulations. In: Baeten, J.C.M., Lenstra, J.K., Parrow, J., Woeginger, G.J. (eds.) ICALP 2003. LNCS, vol.\u00a02719, pp. 1080\u20131094. Springer, Heidelberg (2003)"},{"key":"17_CR13","unstructured":"Schaeffer, G.: Conjugaison d\u2019arbres et cartes combinatoires al\u00e9atoires. PhD thesis, Universit\u00e9 Bordeaux I (1998)"},{"key":"17_CR14","first-page":"760","volume-title":"Annual ACM Symposium on Theory of Computing","author":"G. Schaeffer","year":"1999","unstructured":"Schaeffer, G.: Random sampling of large planar maps and convex polyhedra. In: Annual ACM Symposium on Theory of Computing, Atlanta, GA, pp. 760\u2013769. ACM, New York (1999) (electronic)"},{"key":"17_CR15","doi-asserted-by":"publisher","first-page":"323","DOI":"10.1007\/BF00353652","volume":"5","author":"W. Schnyder","year":"1989","unstructured":"Schnyder, W.: Planar graphs and poset dimension. Order\u00a05, 323\u2013343 (1989)","journal-title":"Order"},{"key":"17_CR16","unstructured":"Schnyder, W.: Embedding planar graphs on the grid. In: SODA 1990: Proceedings of the first annual ACM-SIAM symposium on Discrete algorithms, pp. 138\u2013148 (1990)"},{"key":"17_CR17","doi-asserted-by":"publisher","first-page":"21","DOI":"10.4153\/CJM-1962-002-9","volume":"14","author":"W.T. Tutte","year":"1962","unstructured":"Tutte, W.T.: A census of planar triangulation. Canad. J. Math.\u00a014, 21\u201338 (1962)","journal-title":"Canad. J. Math."}],"container-title":["Lecture Notes in Computer Science","Graph Drawing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11618058_17.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T20:04:12Z","timestamp":1605643452000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11618058_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540314257","9783540316671"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/11618058_17","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}