{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,15]],"date-time":"2025-08-15T01:43:37Z","timestamp":1755222217902,"version":"3.43.0"},"publisher-location":"Cham","reference-count":20,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783032002808","type":"print"},{"value":"9783032002815","type":"electronic"}],"license":[{"start":{"date-parts":[[2025,8,11]],"date-time":"2025-08-11T00:00:00Z","timestamp":1754870400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,8,11]],"date-time":"2025-08-11T00:00:00Z","timestamp":1754870400000},"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":[[2026]]},"DOI":"10.1007\/978-3-032-00281-5_23","type":"book-chapter","created":{"date-parts":[[2025,8,10]],"date-time":"2025-08-10T11:38:34Z","timestamp":1754825914000},"page":"387-397","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Weights of\u00a0Convex Quadrilaterals and\u00a0Empty Triangles in\u00a0Weighted Point Sets"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-3796-9910","authenticated-orcid":false,"given":"Toshinori","family":"Sakai","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,8,11]]},"reference":[{"key":"23_CR1","doi-asserted-by":"publisher","unstructured":"Aichholzer, O., Aurenhammer, F., Krasser, H.: On the crossing number of complete graphs. In: SoCG \u201902: Proc.\u00a0the 18th Annual Symp.\u00a0on Comput.\u00a0Geom. pp.\u00a019\u201424. Association for Computing Machinery, New York (2002). https:\/\/doi.org\/10.1145\/513400.513403","DOI":"10.1145\/513400.513403"},{"key":"23_CR2","doi-asserted-by":"publisher","first-page":"671","DOI":"10.1007\/s00454-005-1227-6","volume":"35","author":"J Balogh","year":"2006","unstructured":"Balogh, J., Salazar, G.: $$k$$-sets, convex quadrilaterals, and the rectilinear crossing number of $$K_n$$. Discrete Comput. Geom. 35, 671\u2013690 (2006). https:\/\/doi.org\/10.1007\/s00454-005-1227-6","journal-title":"Discrete Comput. Geom."},{"issue":"2","key":"23_CR3","doi-asserted-by":"publisher","first-page":"243","DOI":"10.1556\/sscmath.41.2004.2.4","volume":"41","author":"I B\u00e1r\u00e1ny","year":"2004","unstructured":"B\u00e1r\u00e1ny, I., Valtr, P.: Planar point sets with a small number of empty convex polygons. Studia Sci. Math. Hungar. 41(2), 243\u2013269 (2004). https:\/\/doi.org\/10.1556\/sscmath.41.2004.2.4","journal-title":"Studia Sci. Math. Hungar."},{"issue":"1\u20133","key":"23_CR4","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1016\/S0012-365X(02)00491-0","volume":"262","author":"A Brodsky","year":"2003","unstructured":"Brodsky, A., Durocher, S., Gethner, E.: Toward the rectilinear crossing number of $$K_n$$: New drawings, upper bounds, and asymptotics. Discrete Math. 262(1\u20133), 59\u201377 (2003). https:\/\/doi.org\/10.1016\/S0012-365X(02)00491-0","journal-title":"Discrete Math."},{"key":"23_CR5","unstructured":"Czyzowicz, J., Kranakis, E., Urrutia, J.: Guarding the convex subsets of a point set. In: the 12th Canadian Conference on Computational Geometry, pp.\u00a047\u201350. Fredericton (2000)"},{"key":"23_CR6","unstructured":"Dehnhardt, K.: Leere Konvexe Vielecke in ebenen Punktmengen. Dissertation, TU Braunschweig, Braunschweig (1987)"},{"issue":"1\u20132","key":"23_CR7","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1556\/sscmath.36.2000.1-2.9","volume":"36","author":"A Dumitrescu","year":"2000","unstructured":"Dumitrescu, A.: Planar sets with few empty convex polygons. Studia Sci. Math. Hungar. 36(1\u20132), 93\u2013110 (2000). https:\/\/doi.org\/10.1556\/sscmath.36.2000.1-2.9","journal-title":"Studia Sci. Math. Hungar."},{"key":"23_CR8","doi-asserted-by":"crossref","unstructured":"Erd\u0151s, P.: Some old and new problems in combinatorial geometry. In: Rosenfeld, M. and Zaks, J. (eds.) Convexity and graph theory, Ann. Discrete Math. vol. 20, pp.\u00a0129\u2013136, North-Holland (1984)","DOI":"10.1016\/S0304-0208(08)72816-0"},{"key":"23_CR9","first-page":"463","volume":"2","author":"P Erd\u0151s","year":"1935","unstructured":"Erd\u0151s, P., Szekeres, G.: A combinatorial problem in geometry. Compositio Math. 2, 463\u2013470 (1935)","journal-title":"Compositio Math."},{"key":"23_CR10","unstructured":"Erd\u0151s, P. and Szekeres, G.: On some extremum problems in elementary geometry. Ann.\u00a0Univ.\u00a0Sci.\u00a0Budapest E\u00f6tv\u00f6s Sect. Math. 3\u20134, 53\u201362 (1960\u201361)"},{"key":"23_CR11","doi-asserted-by":"publisher","first-page":"239","DOI":"10.1007\/s00454-007-9018-x","volume":"39","author":"T Gerken","year":"2008","unstructured":"Gerken, T.: Empty convex hexagons in planar point sets. Discrete Comput. Geom. 39, 239\u2013272 (2008). https:\/\/doi.org\/10.1007\/s00454-007-9018-x","journal-title":"Discrete Comput. Geom."},{"key":"23_CR12","doi-asserted-by":"publisher","unstructured":"Guy, R.K.: Crossing numbers of graphs. In: Alavi, Y., Lick, D.R., White, A.T. (eds.) Graph Theory and Applications, Lecture Notes in Mathematics, vol. 303, pp.\u00a0111-124 Springer, Berlin, Heidelberg (1972). https:\/\/doi.org\/10.1007\/BFb0067363","DOI":"10.1007\/BFb0067363"},{"key":"23_CR13","doi-asserted-by":"publisher","unstructured":"Harary, F. and Hill, A.: On the number of crossings in a complete graph. In: Proc. Edinburgh Math. Soc. 13(4), 333\u2013338 (1962\/63). https:\/\/doi.org\/10.1017\/S0013091500025645","DOI":"10.1017\/S0013091500025645"},{"key":"23_CR14","first-page":"116","volume":"33","author":"H Harborth","year":"1978","unstructured":"Harborth, H.: Konvexe F\u00fcnfecke in ebenen Punktmengen. Elem. Math. 33, 116\u2013118 (1978)","journal-title":"Elem. Math."},{"issue":"4","key":"23_CR15","doi-asserted-by":"publisher","first-page":"482","DOI":"10.4153\/CMB-1983-077-8","volume":"26","author":"JD Horton","year":"1983","unstructured":"Horton, J.D.: Sets with no empty convex 7-gons. Canad. Math. Bull. 26(4), 482\u2013484 (1983). https:\/\/doi.org\/10.4153\/CMB-1983-077-8","journal-title":"Canad. Math. Bull."},{"key":"23_CR16","unstructured":"Kalbfleisch, J.\u00a0D., Kalbfleisch, J.\u00a0G., Stanton, R.\u00a0G.: A combinatorial problem on convex $$n$$-gons. In: Proc. Louisiana Conf. on Combinatorics, Graph Theory, and Computing, pp.\u00a0180\u2013188. Baton Rouge: Louisiana State Univ. (1970)"},{"key":"23_CR17","doi-asserted-by":"publisher","first-page":"323","DOI":"10.1007\/BF01903339","volume":"51","author":"M Katchalski","year":"1988","unstructured":"Katchalski, M., Meir, A.: On empty triangles determined by points in the plane. Acta Math. Hung. 51, 323\u2013328 (1988). https:\/\/doi.org\/10.1007\/BF01903339","journal-title":"Acta Math. Hung."},{"key":"23_CR18","doi-asserted-by":"publisher","first-page":"389","DOI":"10.1007\/s00454-007-1343-6","volume":"38","author":"CM Nicol\u00e1s","year":"2007","unstructured":"Nicol\u00e1s, C.M.: The empty hexagon theorem. Discrete Comput. Geom. 38, 389\u2013397 (2007). https:\/\/doi.org\/10.1007\/s00454-007-1343-6","journal-title":"Discrete Comput. Geom."},{"key":"23_CR19","doi-asserted-by":"publisher","unstructured":"Sakai, T. and Matsumoto, S.: Numbers of weights of convex quadrilaterals in weighted point sets. Indonesian Journal of Combinatorics 8, 1\u201312 (2024). https:\/\/doi.org\/10.19184\/ijc.2024.8.1.1","DOI":"10.19184\/ijc.2024.8.1.1"},{"issue":"2","key":"23_CR20","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1017\/S144618110000300X","volume":"48","author":"G Szekeres","year":"2006","unstructured":"Szekeres, G., Peters, L.: Computer solution to the 17-point Erd\u0151s-Szekeres problem. The ANZIAM Journal 48(2), 151\u2013164 (2006). https:\/\/doi.org\/10.1017\/S144618110000300X","journal-title":"The ANZIAM Journal"}],"container-title":["Lecture Notes in Computer Science","Discrete and Computational Geometry, Graphs, and Games"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-032-00281-5_23","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,8,10]],"date-time":"2025-08-10T11:38:35Z","timestamp":1754825915000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-00281-5_23"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,8,11]]},"ISBN":["9783032002808","9783032002815"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-00281-5_23","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,8,11]]},"assertion":[{"value":"11 August 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"The author has no competing interests to declare that are relevant to the content of this article.","order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Disclosure of Interests"}},{"value":"JCDCGGG","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Japanese Conference on Discrete and Computational Geometry, Graphs, and Games","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"9 September 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11 September 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"jcdcg2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.alg.cei.uec.ac.jp\/itohiro\/JCDCGG\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}