{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,23]],"date-time":"2026-08-23T17:48:20Z","timestamp":1787507300918,"version":"build-2736575974"},"reference-count":16,"publisher":"Elsevier BV","issue":"5","license":[{"start":{"date-parts":[[1993,11,1]],"date-time":"1993-11-01T00:00:00Z","timestamp":752112000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":7198,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Computational Geometry"],"published-print":{"date-parts":[[1993,11]]},"DOI":"10.1016\/0925-7721(93)90018-2","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T23:41:31Z","timestamp":1027640491000},"page":"277-288","source":"Crossref","is-referenced-by-count":36,"title":["On the union of fat wedges and separating a collection of segments by a line"],"prefix":"10.1016","volume":"3","author":[{"given":"Alon","family":"Efrat","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"G\u00fcnter","family":"Rote","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Micha","family":"Sharir","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"key":"10.1016\/0925-7721(93)90018-2_BIB1","first-page":"281","article-title":"Approximate motion planning and the complexity of the boundary of the union of simple geometric figures","author":"Alt","year":"1990","journal-title":"Proc. 6th Ann. Symp. on Computational Geometry"},{"key":"10.1016\/0925-7721(93)90018-2_BIB2","doi-asserted-by":"crossref","first-page":"573","DOI":"10.1007\/BF01840405","article-title":"An optimal algorithm for the boundary of a cell in a union of rays","volume":"5","author":"Alevizos","year":"1990","journal-title":"Algorithmica"},{"key":"10.1016\/0925-7721(93)90018-2_BIB3","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/147508.147511","article-title":"An optimal algorithm for intersecting line segments in the plane","volume":"38","author":"Chazelle","year":"1992","journal-title":"J. Assoc. Comput. Mach."},{"key":"10.1016\/0925-7721(93)90018-2_BIB4","doi-asserted-by":"crossref","first-page":"387","DOI":"10.1007\/BF02187740","article-title":"Applications of random sampling in computational geometry","volume":"4","author":"Clarkson","year":"1989","journal-title":"Discrete Comput. Geom."},{"key":"10.1016\/0925-7721(93)90018-2_BIB5","author":"Edelbrunner","year":"1987"},{"key":"10.1016\/0925-7721(93)90018-2_BIB6","doi-asserted-by":"crossref","first-page":"165","DOI":"10.1016\/0022-0000(89)90038-X","article-title":"Topologically sweeping an arrangement","volume":"38","author":"Edelsbrunner","year":"1989","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0925-7721(93)90018-2_BIB7","doi-asserted-by":"crossref","first-page":"161","DOI":"10.1007\/BF02187784","article-title":"The complexity and construction of many faces in arrangements of lines and of segments","volume":"5","author":"Edelsbrunner","year":"1990","journal-title":"Discrete Comput. Geom."},{"key":"10.1016\/0925-7721(93)90018-2_BIB8","author":"Erickson","year":"1993","journal-title":"Better lower bounds on detecting affine and spherical degeneracies"},{"key":"10.1016\/0925-7721(93)90018-2_BIB9","first-page":"218","article-title":"On the complexity of shattering using arrangements","author":"Freimer","year":"1990","journal-title":"Proc. 2nd Canadian Conf. on Computational Geometry"},{"key":"10.1016\/0925-7721(93)90018-2_BIB10","author":"Gajentaan","year":"1993","journal-title":"n2-Hard problems in computational geometry"},{"key":"10.1016\/0925-7721(93)90018-2_BIB11","doi-asserted-by":"crossref","first-page":"888","DOI":"10.1137\/0220055","article-title":"An output-sensitive algorithm for computing visibility graphs","volume":"20","author":"Ghosh","year":"1991","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0925-7721(93)90018-2_BIB12","doi-asserted-by":"crossref","first-page":"151","DOI":"10.1007\/BF02579170","article-title":"Nonlinearity of Davenport-Schinzel sequences and of generalized path compression schemes","volume":"6","author":"Hart","year":"1986","journal-title":"Combinatorica"},{"key":"10.1016\/0925-7721(93)90018-2_BIB13","doi-asserted-by":"crossref","first-page":"169","DOI":"10.1016\/0020-0190(89)90136-1","article-title":"Finding the upper envelope of n line segments in O(n log n) time","volume":"33","author":"Hershberger","year":"1989","journal-title":"Inform. Proc. Lett."},{"key":"10.1016\/0925-7721(93)90018-2_BIB14","doi-asserted-by":"crossref","DOI":"10.1137\/S009753979018330X","article-title":"Fat triangles determine linearly many holes","volume":"23","author":"Matou\u0161ek","year":"1994","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0925-7721(93)90018-2_BIB15","author":"Miller","year":"1991","journal-title":"Efficient randomized incremental construction of the union of fat triangles"},{"key":"10.1016\/0925-7721(93)90018-2_BIB16","doi-asserted-by":"crossref","first-page":"253","DOI":"10.1016\/S0747-7171(08)80064-8","article-title":"A fast planar partition algorithm I","volume":"10","author":"Mulmuley","year":"1990","journal-title":"J. Symbolic Comput."}],"container-title":["Computational Geometry"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0925772193900182?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0925772193900182?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T02:56:00Z","timestamp":1555124160000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0925772193900182"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993,11]]},"references-count":16,"journal-issue":{"issue":"5","published-print":{"date-parts":[[1993,11]]}},"alternative-id":["0925772193900182"],"URL":"https:\/\/doi.org\/10.1016\/0925-7721(93)90018-2","relation":{},"ISSN":["0925-7721"],"issn-type":[{"value":"0925-7721","type":"print"}],"subject":[],"published":{"date-parts":[[1993,11]]}}}