{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T02:28:24Z","timestamp":1743128904557,"version":"3.40.3"},"publisher-location":"Cham","reference-count":25,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319218397"},{"type":"electronic","value":"9783319218403"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-319-21840-3_24","type":"book-chapter","created":{"date-parts":[[2015,7,27]],"date-time":"2015-07-27T09:57:38Z","timestamp":1437991058000},"page":"289-300","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Convex Polygons in Geometric Triangulations"],"prefix":"10.1007","author":[{"given":"Adrian","family":"Dumitrescu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Csaba D.","family":"T\u00f3th","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,7,28]]},"reference":[{"issue":"1","key":"24_CR1","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1007\/s00373-007-0704-5","volume":"23","author":"O Aichholzer","year":"2007","unstructured":"Aichholzer, O., Hackl, T., Vogtenhuber, B., Huemer, C., Hurtado, F., Krasser, H.: On the number of plane geometric graphs. Graphs Combin. 23(1), 67\u201384 (2007)","journal-title":"Graphs Combin."},{"key":"24_CR2","first-page":"9","volume":"12","author":"M Ajtai","year":"1982","unstructured":"Ajtai, M., Chv\u00e1tal, V., Newborn, M., Szemer\u00e9di, E.: Crossing-free subgraphs. Ann. Discrete Math. 12, 9\u201312 (1982)","journal-title":"Ann. Discrete Math."},{"key":"24_CR3","doi-asserted-by":"crossref","unstructured":"Alvarez, V., Bringmann, K., Curticapean, R., Ray, S.: Counting crossing-free structures. In: Proc. 28th Sympos. on Comput. Geom. (SOCG), pp. 61\u201368. ACM Press (2012). arXiv:1312.4628","DOI":"10.1145\/2261250.2261259"},{"key":"24_CR4","doi-asserted-by":"crossref","unstructured":"Alvarez, V., Seidel, R.: A simple aggregative algorithm for counting triangulations of planar point sets and related problems. In: Proc. 29th Sympos. on Comput. Geom. (SOCG), pp. 1\u20138. ACM Press (2013)","DOI":"10.1145\/2462356.2462392"},{"issue":"5","key":"24_CR5","doi-asserted-by":"publisher","first-page":"386","DOI":"10.1016\/j.comgeo.2014.12.006","volume":"48","author":"V Alvarez","year":"2015","unstructured":"Alvarez, V., Bringmann, K., Ray, S., Ray, S.: Counting triangulations and other crossing-free structures approximately. Comput. Geom. 48(5), 386\u2013397 (2015)","journal-title":"Comput. Geom."},{"key":"24_CR6","doi-asserted-by":"crossref","unstructured":"de Berg, M., Cheong, O., van Kreveld, M., Overmars, M.: Computational Geometry, 3rd edn. Springer (2008)","DOI":"10.1007\/978-3-540-77974-2"},{"key":"24_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1007\/978-3-540-73545-8_12","volume-title":"Computing and Combinatorics","author":"K Buchin","year":"2007","unstructured":"Buchin, K., Knauer, C., Kriegel, K., Schulz, A., Seidel, R.: On the number of cycles in planar graphs. In: Lin, G. (ed.) COCOON 2007. LNCS, vol. 4598, pp. 97\u2013107. Springer, Heidelberg (2007)"},{"issue":"2","key":"24_CR8","doi-asserted-by":"publisher","first-page":"802","DOI":"10.1137\/110849407","volume":"27","author":"A Dumitrescu","year":"2013","unstructured":"Dumitrescu, A., Schulz, A., Sheffer, A., T\u00f3th, C.D.: Bounds on the maximum multiplicity of some common geometric graphs. SIAM J. Discrete Math. 27(2), 802\u2013826 (2013)","journal-title":"SIAM J. Discrete Math."},{"issue":"4","key":"24_CR9","doi-asserted-by":"publisher","first-page":"90","DOI":"10.1145\/2421119.2421136","volume":"43","author":"A Dumitrescu","year":"2012","unstructured":"Dumitrescu, A., T\u00f3th, C.D.: Computational Geometry Column 54. SIGACT News Bulletin 43(4), 90\u201397 (2012)","journal-title":"SIGACT News Bulletin"},{"key":"24_CR10","doi-asserted-by":"crossref","unstructured":"Dumitrescu, A., T\u00f3th, C.D.: Convex polygons in geometric triangulations, November 2014. arXiv:1411.1303","DOI":"10.1007\/978-3-319-21840-3_24"},{"issue":"1","key":"24_CR11","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1007\/BF02187823","volume":"7","author":"D Eppstein","year":"1992","unstructured":"Eppstein, D., Overmars, M., Rote, G., Woeginger, G.: Finding minimum area $$k$$-gons. Discrete Comput. Geom. 7(1), 45\u201358 (1992)","journal-title":"Discrete Comput. Geom."},{"key":"24_CR12","first-page":"52","volume":"5","author":"P Erd\u0151s","year":"1978","unstructured":"Erd\u0151s, P.: Some more problems on elementary geometry. Austral. Math. Soc. Gaz. 5, 52\u201354 (1978)","journal-title":"Austral. Math. Soc. Gaz."},{"key":"24_CR13","first-page":"463","volume":"2","author":"P Erd\u0151s","year":"1935","unstructured":"Erd\u0151s, P., Szekeres, G.: A combinatorial problem in geometry. Compos. Math. 2, 463\u2013470 (1935)","journal-title":"Compos. Math."},{"issue":"4","key":"24_CR14","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1016\/S0925-7721(00)00010-9","volume":"16","author":"A Garc\u00eda","year":"2000","unstructured":"Garc\u00eda, A., Noy, M., Tejel, A.: Lower bounds on the number of crossing-free subgraphs of $$K_N$$. Comput. Geom. 16(4), 211\u2013221 (2000)","journal-title":"Comput. Geom."},{"key":"24_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"166","DOI":"10.1007\/978-3-642-35261-4_20","volume-title":"Algorithms and Computation","author":"M van Kreveld","year":"2012","unstructured":"van Kreveld, M., L\u00f6ffler, M., Pach, J.: How Many potatoes are in a mesh? In: Chao, K.-M., Hsu, T., Lee, D.-T. (eds.) ISAAC 2012. LNCS, vol. 7676, pp. 166\u2013176. Springer, Heidelberg (2012)"},{"key":"24_CR16","unstructured":"L\u00f6ffler, M., Schulz, A., T\u00f3th, C.D.: Counting carambolas. In: Proc. 25th Canadian Conf. on Comput. Geom. (CCCG), Waterloo, ON, pp. 163\u2013168 (2013)"},{"key":"24_CR17","doi-asserted-by":"publisher","first-page":"437","DOI":"10.1090\/S0273-0979-00-00877-6","volume":"37","author":"W Morris","year":"2000","unstructured":"Morris, W., Soltan, V.: The Erd\u0151s-Szekeres problem on points in convex position\u2013a survey. Bull. AMS 37, 437\u2013458 (2000)","journal-title":"Bull. AMS"},{"key":"24_CR18","first-page":"195","volume":"31","author":"A Razen","year":"2008","unstructured":"Razen, A., Snoeyink, J., Welzl, E.: Number of crossing-free geometric graphs vs. triangulations, Electron. Notes. Discrete Math. 31, 195\u2013200 (2008)","journal-title":"Discrete Math."},{"key":"24_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"36","DOI":"10.1007\/978-3-642-19391-0_3","volume-title":"Rainbow of Computer Science","author":"A Razen","year":"2011","unstructured":"Razen, A., Welzl, E.: Counting plane graphs with exponential speed-up. In: Calude, C.S., Rozenberg, G., Salomaa, A. (eds.) Rainbow of Computer Science. LNCS, vol. 6570, pp. 36\u201346. Springer, Heidelberg (2011)"},{"key":"24_CR20","doi-asserted-by":"crossref","first-page":"P70","DOI":"10.37236\/557","volume":"18","author":"M Sharir","year":"2011","unstructured":"Sharir, M., Sheffer, A.: Counting triangulations of planar point sets. Electron. J. Combin. 18, P70 (2011)","journal-title":"Electron. J. Combin."},{"issue":"6","key":"24_CR21","doi-asserted-by":"publisher","first-page":"935","DOI":"10.1017\/S096354831300031X","volume":"22","author":"M Sharir","year":"2013","unstructured":"Sharir, M., Sheffer, A.: Counting plane graphs: cross-graph charging schemes. Combin., Probab. Comput. 22(6), 935\u2013954 (2013)","journal-title":"Combin., Probab. Comput."},{"issue":"4","key":"24_CR22","doi-asserted-by":"publisher","first-page":"777","DOI":"10.1016\/j.jcta.2013.01.002","volume":"120","author":"M Sharir","year":"2013","unstructured":"Sharir, M., Sheffer, A., Welzl, E.: Counting plane graphs: perfect matchings, spanning cycles, and Kasteleyn\u2019s technique. J. Combin. Theory, Ser. A 120(4), 777\u2013794 (2013)","journal-title":"J. Combin. Theory, Ser. A"},{"issue":"3","key":"24_CR23","doi-asserted-by":"publisher","first-page":"695","DOI":"10.1137\/050636036","volume":"36","author":"M Sharir","year":"2006","unstructured":"Sharir, M., Welzl, E.: On the number of crossing-free matchings, cycles, and partitions. SIAM J. Comput. 36(3), 695\u2013720 (2006)","journal-title":"SIAM J. Comput."},{"key":"24_CR24","unstructured":"Sheffer, A.: Numbers of plane graphs (version of May, 2015). https:\/\/adamsheffer.wordpress.com\/numbers-of-plane-graphs\/"},{"key":"24_CR25","doi-asserted-by":"crossref","unstructured":"Wettstein, M.: Counting and enumerating crossing-free geometric graphs. In: Proc. 30th Sympos. on Comput. Geom. (SOCG), pp. 1\u201310. ACM Press (2014)","DOI":"10.1145\/2582112.2582145"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Data Structures"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-21840-3_24","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,20]],"date-time":"2023-01-20T20:19:59Z","timestamp":1674245999000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-21840-3_24"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319218397","9783319218403"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-21840-3_24","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]},"assertion":[{"value":"28 July 2015","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}