{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,1]],"date-time":"2022-04-01T15:26:26Z","timestamp":1648826786477},"reference-count":14,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1991,6,1]],"date-time":"1991-06-01T00:00:00Z","timestamp":675734400000},"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":8082,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Complexity"],"published-print":{"date-parts":[[1991,6]]},"DOI":"10.1016\/0885-064x(91)90004-h","type":"journal-article","created":{"date-parts":[[2004,9,8]],"date-time":"2004-09-08T14:41:18Z","timestamp":1094654478000},"page":"174-183","source":"Crossref","is-referenced-by-count":0,"title":["A role of lower semicontinuous functions in the combinatorial complexity of geometric problems"],"prefix":"10.1016","volume":"7","author":[{"given":"Jerzy W","family":"Jaromczyk","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Grzegorz","family":"\u015awi\u015ftek","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0885-064X(91)90004-H_BIB1","series-title":"Algorithms in Combinatorial Geometry","author":"Edelsbrunner","year":"1987"},{"key":"10.1016\/0885-064X(91)90004-H_BIB2","article-title":"Minimum Diameter Partitioning of a Planar Set in Quadratic Time","author":"Edelsbrunner","year":"1987"},{"key":"10.1016\/0885-064X(91)90004-H_BIB3","doi-asserted-by":"crossref","DOI":"10.1007\/3-540-19488-6_118","article-title":"Arrangements of Curves in the Plane-Topology, Combinatorics, and Algorithms","author":"Edelsbrunner","year":"1988"},{"key":"10.1016\/0885-064X(91)90004-H_BIB4","series-title":"The complexity of the common intersection of n double wedges","author":"Edelsbrunner","year":"1989"},{"key":"10.1016\/0885-064X(91)90004-H_BIB5","doi-asserted-by":"crossref","DOI":"10.1007\/BF01934440","article-title":"Stabbing line segments","volume":"22","author":"Edelsbrunner","year":"1982","journal-title":"BIT"},{"key":"10.1016\/0885-064X(91)90004-H_BIB6","series-title":"Proceedings of the 4th Annual ACM Symposium on Computational Geometry","article-title":"A technique to cope with degenerate cases in geometric algorithms","author":"Edelsbrunner","year":"1988"},{"key":"10.1016\/0885-064X(91)90004-H_BIB7","series-title":"Proceedings of the 30th Annual Symposium on Foundations of Computer Science","article-title":"Stable maintenance of point set triangulations in two dimensions","author":"Fortune","year":"1989"},{"key":"10.1016\/0885-064X(91)90004-H_BIB8","series-title":"Proceedings of the 27th IEEE Symposium on the Foundations of Computer Science","article-title":"Finite-resolutions computational geometry","author":"Greene","year":"1986"},{"key":"10.1016\/0885-064X(91)90004-H_BIB9","series-title":"Proceedings of the 5th Annual Symposium on Computational Geometry","article-title":"Epsilon geometry: Building robust algorithms from imprecise computations","author":"Guibas","year":"1989"},{"key":"10.1016\/0885-064X(91)90004-H_BIB10","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1007\/BF02187683","article-title":"On the union of Jordan regions and collision-free translational motions amidst polygonal obstacles","volume":"1","author":"Kedem","year":"1986","journal-title":"Discrete Comput. Geom."},{"key":"10.1016\/0885-064X(91)90004-H_BIB11","series-title":"General Topology","author":"Kelley","year":"1970"},{"key":"10.1016\/0885-064X(91)90004-H_BIB12","doi-asserted-by":"crossref","DOI":"10.1016\/0734-189X(86)90073-3","article-title":"Fast hough transform: A hierarchical approach","volume":"36","author":"Li","year":"1986","journal-title":"Comput. Vision Graphics Image Process"},{"key":"10.1016\/0885-064X(91)90004-H_BIB13","series-title":"Proceedings of the 4th Annual Symposium on Computational Geometry","article-title":"A geometric consistency theorem for a symbolic perturbation scheme","author":"Yap","year":"1988"},{"key":"10.1016\/0885-064X(91)90004-H_BIB14","article-title":"Facing up to arrangements: Face-count formulas for partitions of space by hyperplanes","volume":"1954","author":"Zaslavsky","year":"1975","journal-title":"Mem. Amer. Math. Soc."}],"container-title":["Journal of Complexity"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0885064X9190004H?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0885064X9190004H?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,2,3]],"date-time":"2019-02-03T20:57:46Z","timestamp":1549227466000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0885064X9190004H"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1991,6]]},"references-count":14,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1991,6]]}},"alternative-id":["0885064X9190004H"],"URL":"https:\/\/doi.org\/10.1016\/0885-064x(91)90004-h","relation":{},"ISSN":["0885-064X"],"issn-type":[{"value":"0885-064X","type":"print"}],"subject":[],"published":{"date-parts":[[1991,6]]}}}