{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,3]],"date-time":"2026-07-03T23:16:52Z","timestamp":1783120612123,"version":"3.54.6"},"reference-count":15,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2026,8,1]],"date-time":"2026-08-01T00:00:00Z","timestamp":1785542400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2026,8,1]],"date-time":"2026-08-01T00:00:00Z","timestamp":1785542400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2026,4,28]],"date-time":"2026-04-28T00:00:00Z","timestamp":1777334400000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"DOI":"10.13039\/501100001659","name":"Deutsche Forschungsgemeinschaft","doi-asserted-by":"publisher","award":["KA812-18\/2"],"award-info":[{"award-number":["KA812-18\/2"]}],"id":[{"id":"10.13039\/501100001659","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001659","name":"Deutsche Forschungsgemeinschaft","doi-asserted-by":"publisher","award":["MICIU\/AEI\/10.13039\/501100011033"],"award-info":[{"award-number":["MICIU\/AEI\/10.13039\/501100011033"]}],"id":[{"id":"10.13039\/501100001659","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100014440","name":"Gobierno de Espana Ministerio de Ciencia e Innovacion","doi-asserted-by":"publisher","award":["PID2023-150725NB-I00"],"award-info":[{"award-number":["PID2023-150725NB-I00"]}],"id":[{"id":"10.13039\/100014440","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100002428","name":"Austrian Science Fund","doi-asserted-by":"publisher","award":["I 3340-N35"],"award-info":[{"award-number":["I 3340-N35"]}],"id":[{"id":"10.13039\/501100002428","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Information Processing Letters"],"published-print":{"date-parts":[[2026,8]]},"DOI":"10.1016\/j.ipl.2026.106642","type":"journal-article","created":{"date-parts":[[2026,4,26]],"date-time":"2026-04-26T14:38:13Z","timestamp":1777214293000},"page":"106642","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"special_numbering":"C","title":["Bowties and hourglasses: Intersections of double-wedges or: Stabbing and avoiding line segments"],"prefix":"10.1016","volume":"194","author":[{"given":"Daniel","family":"Bertschinger","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Henry","family":"F\u00f6rster","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Fabian","family":"Klute","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3147-0083","authenticated-orcid":false,"given":"Irene","family":"Parada","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Patrick","family":"Schnider","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Birgit","family":"Vogtenhuber","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"issue":"5","key":"10.1016\/j.ipl.2026.106642_bib0001","doi-asserted-by":"crossref","first-page":"303","DOI":"10.1016\/j.comgeo.2010.12.004","article-title":"Stabbers of line segments in the plane","volume":"44","author":"Claverol","year":"2011","journal-title":"Comput. Geom."},{"issue":"1","key":"10.1016\/j.ipl.2026.106642_bib0002","doi-asserted-by":"crossref","first-page":"110","DOI":"10.1016\/j.dam.2003.11.014","article-title":"Separability by two lines and by nearly straight polygonal chains","volume":"144","author":"Hurtado","year":"2004","journal-title":"Discrete Appl. Math."},{"issue":"3","key":"10.1016\/j.ipl.2026.106642_bib0003","doi-asserted-by":"crossref","first-page":"274","DOI":"10.1007\/BF01934440","article-title":"Stabbing line segments","volume":"22","author":"Edelsbrunner","year":"1982","journal-title":"BIT Numer. Math."},{"key":"10.1016\/j.ipl.2026.106642_bib0004","series-title":"Computational Geometry: Algorithms and Applications","author":"de Berg","year":"2008"},{"key":"10.1016\/j.ipl.2026.106642_bib0005","series-title":"Algorithms in Combinatorial Geometry","volume":"10","author":"Edelsbrunner","year":"1987"},{"key":"10.1016\/j.ipl.2026.106642_bib0006","series-title":"Handbook of Discrete and Computational Geometry","author":"Toth","year":"2017"},{"key":"10.1016\/j.ipl.2026.106642_bib0007","doi-asserted-by":"crossref","first-page":"195","DOI":"10.1007\/BF01228199","article-title":"Transversalenprobleme in der Ebene","volume":"24","author":"Eckhoff","year":"1973","journal-title":"Arch. Math."},{"key":"10.1016\/j.ipl.2026.106642_bib0008","doi-asserted-by":"crossref","first-page":"203","DOI":"10.1007\/BF02189319","article-title":"A Gallai-Type transversal problem in the plane","volume":"9","author":"Eckhoff","year":"1993","journal-title":"Discret. Comput. Geom."},{"issue":"4","key":"10.1016\/j.ipl.2026.106642_bib0009","doi-asserted-by":"crossref","first-page":"2916","DOI":"10.1137\/21M1408920","article-title":"Line transversals in families of connected sets in the plane","volume":"36","author":"McGinnis","year":"2022","journal-title":"SIAM J. Discrete Math."},{"key":"10.1016\/j.ipl.2026.106642_bib0010","doi-asserted-by":"crossref","first-page":"217","DOI":"10.1016\/0304-3975(78)90051-8","article-title":"Finding the intersection of two convex polyhedra","volume":"7","author":"Muller","year":"1978","journal-title":"Theor. Comput. Sci."},{"issue":"1","key":"10.1016\/j.ipl.2026.106642_bib0011","doi-asserted-by":"crossref","first-page":"7:1","DOI":"10.1145\/3363541","article-title":"More logarithmic-factor speedups for 3SUM, (median, +)-convolution, and some geometric 3SUM-hard problems","volume":"16","author":"Chan","year":"2020","journal-title":"ACM Trans. Algorithms"},{"issue":"4","key":"10.1016\/j.ipl.2026.106642_bib0012","doi-asserted-by":"crossref","first-page":"22:1","DOI":"10.1145\/3185378","article-title":"Threesomes, degenerates, and love triangles","volume":"65","author":"Gr\u00f8nlund","year":"2018","journal-title":"J. ACM"},{"key":"10.1016\/j.ipl.2026.106642_bib0013","series-title":"55th IEEE Annual Symposium on Foundations of Computer Science (FOCS 2014)","first-page":"434","article-title":"Popular conjectures imply strong lower bounds for dynamic problems","author":"Abboud","year":"2014"},{"key":"10.1016\/j.ipl.2026.106642_bib0014","doi-asserted-by":"crossref","first-page":"165","DOI":"10.1016\/0925-7721(95)00022-2","article-title":"On a class of O(n2) problems in computational geometry","volume":"5","author":"Gajentaan","year":"1995","journal-title":"Comput. Geom."},{"key":"10.1016\/j.ipl.2026.106642_bib0015","series-title":"Proceedings of the 42nd ACM Symposium on Theory of Computing, (STOC 2010)","first-page":"603","article-title":"Towards polynomial lower bounds for dynamic problems","author":"P\u0103tra\u015fcu","year":"2010"}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020019026000232?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020019026000232?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2026,7,3]],"date-time":"2026-07-03T22:24:39Z","timestamp":1783117479000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0020019026000232"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,8]]},"references-count":15,"alternative-id":["S0020019026000232"],"URL":"https:\/\/doi.org\/10.1016\/j.ipl.2026.106642","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[2026,8]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Bowties and hourglasses: Intersections of double-wedges or: Stabbing and avoiding line segments","name":"articletitle","label":"Article Title"},{"value":"Information Processing Letters","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.ipl.2026.106642","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2026 The Authors. Published by Elsevier B.V.","name":"copyright","label":"Copyright"}],"article-number":"106642"}}