{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,4]],"date-time":"2026-06-04T12:18:57Z","timestamp":1780575537379,"version":"3.54.1"},"reference-count":19,"publisher":"Elsevier BV","issue":"1-2","license":[{"start":{"date-parts":[[1990,5,1]],"date-time":"1990-05-01T00:00:00Z","timestamp":641520000000},"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":8478,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Applied Mathematics"],"published-print":{"date-parts":[[1990,5]]},"DOI":"10.1016\/0166-218x(90)90124-u","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T03:46:59Z","timestamp":1027655219000},"page":"3-23","source":"Crossref","is-referenced-by-count":29,"title":["Applications of generalized matrix searching to geometric algorithms"],"prefix":"10.1016","volume":"27","author":[{"given":"Alok","family":"Aggarwal","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Maria","family":"Klawe","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"key":"10.1016\/0166-218X(90)90124-U_BIB1_1","first-page":"45","article-title":"A linear time algorithm for computing the Voronoi diagram of a convex polygon","author":"Aggarwal","year":"1987","journal-title":"Proceedings 19th Ann. ACM Symposium on Theory of Comp."},{"key":"10.1016\/0166-218X(90)90124-U_BIB1_2","doi-asserted-by":"crossref","first-page":"591","DOI":"10.1007\/BF02187749","volume":"4","author":"Aggarwal","year":"1989","journal-title":"Discrete Comput. Geom."},{"key":"10.1016\/0166-218X(90)90124-U_BIB2","doi-asserted-by":"crossref","first-page":"195","DOI":"10.1007\/BF01840359","article-title":"Geometric applications of a matrix searching algorithm","volume":"2","author":"Aggarwal","year":"1987","journal-title":"Algorithmica"},{"key":"10.1016\/0166-218X(90)90124-U_BIB3","first-page":"278","article-title":"Fast algorithms for computing the largest empty rectangle","author":"Aggarwal","year":"1987","journal-title":"Proceedings 3rd Symposium on Computational Geometry"},{"issue":"1","key":"10.1016\/0166-218X(90)90124-U_BIB4","doi-asserted-by":"crossref","first-page":"300","DOI":"10.1137\/0215022","article-title":"Computing the largest empty rectangle","volume":"15","author":"Chazelle","year":"1986","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0166-218X(90)90124-U_BIB5","doi-asserted-by":"crossref","first-page":"228","DOI":"10.1145\/323233.323263","article-title":"An improved algorithm for constructing the kth order Voronoi diagrams","author":"Chazelle","year":"1985","journal-title":"Proceedings 1st Ann. ACM Symposium on Computational Geometry"},{"key":"10.1016\/0166-218X(90)90124-U_BIB6","doi-asserted-by":"crossref","first-page":"381","DOI":"10.1016\/0196-6774(85)90007-0","article-title":"A linear algorithm for determining the separation of convex polyhedra","volume":"3","author":"Dobkin","year":"1985","journal-title":"J. Algorithms"},{"key":"10.1016\/0166-218X(90)90124-U_BIB7","first-page":"50","article-title":"Optimal shortest path queries in a simple polygon","author":"Guibas","year":"1987","journal-title":"Proceedings 3rd Ann. Symposium on Computational Geometry"},{"issue":"1","key":"10.1016\/0166-218X(90)90124-U_BIB8","doi-asserted-by":"crossref","first-page":"28","DOI":"10.1137\/0212002","article-title":"Optimal search in planar subdivisions","volume":"12","author":"Kirkpatrick","year":"1983","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0166-218X(90)90124-U_BIB9","doi-asserted-by":"crossref","unstructured":"M.M. Klawe and D.J. Kleitman, An almost linear time algorithm for generalized matrix searching, SIAM J. Discrete Math. (to appear).","DOI":"10.1137\/0403009"},{"issue":"6","key":"10.1016\/0166-218X(90)90124-U_BIB10","first-page":"478","article-title":"On k-nearest neighbor Voronoi diagrams in the plane","volume":"31","author":"Lee","year":"1982","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/0166-218X(90)90124-U_BIB11","doi-asserted-by":"crossref","first-page":"183","DOI":"10.1016\/0020-0190(78)90066-2","article-title":"The all nearest neighbor problem for convex polygons","volume":"7","author":"Lee","year":"1978","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/0166-218X(90)90124-U_BIB12","first-page":"376","article-title":"Finding the largest empty rectangle in an orthogonal polygon","author":"McKenna","year":"1985","journal-title":"Proceedings 23rd Annual Allerton Conference on Communication, Control and Computing"},{"key":"10.1016\/0166-218X(90)90124-U_BIB13","series-title":"An Introduction, Texts and Monographs in Computer Science","article-title":"Computational Geometry","author":"Preparata","year":"1985"},{"key":"10.1016\/0166-218X(90)90124-U_BIB14","series-title":"Tech. Rept. TR-84\u2013592","article-title":"A method for proving lower bounds for certain geometric problems","author":"Seidel","year":"1984"},{"key":"10.1016\/0166-218X(90)90124-U_BIB15","series-title":"Ph.D. Thesis","article-title":"Computational geometry","author":"Shamos","year":"1978"},{"key":"10.1016\/0166-218X(90)90124-U_BIB16","unstructured":"P. Shor, Personal communication (1987)."},{"key":"10.1016\/0166-218X(90)90124-U_BIB17","doi-asserted-by":"crossref","first-page":"34","DOI":"10.1145\/10515.10519","article-title":"Finding the minimum visible vertex distance between two non-intersecting simple polygons","author":"Wang","year":"1986","journal-title":"Proceedings 2nd Symposium on Computational Geometry"},{"key":"10.1016\/0166-218X(90)90124-U_BIB18","doi-asserted-by":"crossref","first-page":"418","DOI":"10.1016\/0196-6774(88)90032-6","article-title":"The concave least weight subsequence revisited","volume":"9","author":"Wilber","year":"1988","journal-title":"J. Algorithms"}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0166218X9090124U?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0166218X9090124U?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2023,4,18]],"date-time":"2023-04-18T16:28:16Z","timestamp":1681835296000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0166218X9090124U"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1990,5]]},"references-count":19,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[1990,5]]}},"alternative-id":["0166218X9090124U"],"URL":"https:\/\/doi.org\/10.1016\/0166-218x(90)90124-u","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[1990,5]]}}}