{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,15]],"date-time":"2026-05-15T03:17:31Z","timestamp":1778815051745,"version":"3.51.4"},"reference-count":24,"publisher":"Elsevier BV","issue":"1-4","license":[{"start":{"date-parts":[[1996,7,1]],"date-time":"1996-07-01T00:00:00Z","timestamp":836179200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Information Sciences"],"published-print":{"date-parts":[[1996,7]]},"DOI":"10.1016\/0020-0255(96)00056-4","type":"journal-article","created":{"date-parts":[[2003,5,19]],"date-time":"2003-05-19T17:32:55Z","timestamp":1053365575000},"page":"175-196","source":"Crossref","is-referenced-by-count":13,"title":["Fundamentals of Restricted-Orientation Convexity"],"prefix":"10.1016","volume":"92","author":[{"given":"Eugene","family":"Fink","sequence":"first","affiliation":[]},{"given":"Derick","family":"Wood","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0020-0255(96)00056-4_BIB1","first-page":"765","article-title":"On Ln-sets, the Hausdorff metric, and connectedness","volume":"13","author":"Bruckner","year":"1962"},{"key":"10.1016\/0020-0255(96)00056-4_BIB2","series-title":"Generalized halfspaces in restricted-orientation convexity","author":"Fink","year":"1995"},{"key":"10.1016\/0020-0255(96)00056-4_BIB3","series-title":"Strong restricted-orientation convexity","author":"Fink","year":"1995"},{"key":"10.1016\/0020-0255(96)00056-4_BIB4","series-title":"Proceedings of the Vision Geometry IV Conference","article-title":"Three-dimensional strong convexity and visibility","author":"Fink","year":"1995"},{"key":"10.1016\/0020-0255(96)00056-4_BIB5","series-title":"Convex Polytopes","author":"Gr\u00fcnbaum","year":"1967"},{"key":"10.1016\/0020-0255(96)00056-4_BIB6","article-title":"Conquering contours: Efficient algorithms for computational geometry","author":"G\u00fcting","year":"1983"},{"key":"10.1016\/0020-0255(96)00056-4_BIB7","doi-asserted-by":"crossref","first-page":"35","DOI":"10.1016\/0020-0190(83)90010-8","article-title":"Stabbing C-oriented polygons","volume":"16","author":"G\u00fcting","year":"1983","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/0020-0255(96)00056-4_BIB8","doi-asserted-by":"crossref","first-page":"143","DOI":"10.1016\/S0019-9958(84)80011-X","article-title":"Dynamic C-oriented polygonal intersection searching","volume":"63","author":"G\u00fcting","year":"1984","journal-title":"Inform. and Control"},{"key":"10.1016\/0020-0255(96)00056-4_BIB9","series-title":"Geometry and Convexity: A Study in Mathematical Methods","author":"Kelly","year":"1978"},{"key":"10.1016\/0020-0255(96)00056-4_BIB10","doi-asserted-by":"crossref","first-page":"616","DOI":"10.2307\/2316569","article-title":"What is a convex set?","volume":"78","author":"Klee","year":"1971","journal-title":"Amer. Math. Monthly"},{"key":"10.1016\/0020-0255(96)00056-4_BIB11","doi-asserted-by":"crossref","first-page":"211","DOI":"10.1016\/0196-6774(81)90023-7","article-title":"A fast algorithm for testing for safety and detecting deadlock in locked transaction systems","volume":"2","author":"Lipski","year":"1981","journal-title":"J. Algorithms"},{"key":"10.1016\/0020-0255(96)00056-4_BIB12","article-title":"Finding the x-y convex hull of a set of x-y polygons","author":"Montuno","year":"1982"},{"key":"10.1016\/0020-0255(96)00056-4_BIB13","doi-asserted-by":"crossref","first-page":"456","DOI":"10.1007\/BF01933620","article-title":"Constructing the X-Y convex hull of a set of X-Y polygons","volume":"23","author":"Nicholl","year":"1983","journal-title":"BIT"},{"key":"10.1016\/0020-0255(96)00056-4_BIB14","doi-asserted-by":"crossref","first-page":"157","DOI":"10.1016\/0020-0255(84)90025-2","article-title":"On the definition and computation of rectilinear convex hulls","volume":"33","author":"Ottmann","year":"1984","journal-title":"Inform. Sci."},{"key":"10.1016\/0020-0255(96)00056-4_BIB15","series-title":"Computational Geometry","author":"Preparata","year":"1985"},{"key":"10.1016\/0020-0255(96)00056-4_BIB16","article-title":"Explorations in restricted-orientation geometry","author":"Rawlins","year":"1987"},{"key":"10.1016\/0020-0255(96)00056-4_BIB17","doi-asserted-by":"crossref","first-page":"150","DOI":"10.1016\/0890-5401(87)90045-9","article-title":"Optimal computation of finitely oriented convex hulls","volume":"72","author":"Rawlins","year":"1987","journal-title":"Inform. and Comput."},{"key":"10.1016\/0020-0255(96)00056-4_BIB18","series-title":"Computational Morphology","first-page":"137","article-title":"Ortho-convexity and its generalizations","author":"Rawlins","year":"1988"},{"key":"10.1016\/0020-0255(96)00056-4_BIB19","doi-asserted-by":"crossref","first-page":"143","DOI":"10.1007\/BF01231029","article-title":"A decomposition theory for convexity spaces","volume":"36","author":"Rawlins","year":"1989","journal-title":"J. Geom."},{"key":"10.1016\/0020-0255(96)00056-4_BIB20","doi-asserted-by":"crossref","first-page":"263","DOI":"10.1016\/0020-0255(91)90054-X","article-title":"Restricted-orientation convex sets","volume":"54","author":"Rawlins","year":"1991","journal-title":"Inform. Sci."},{"key":"10.1016\/0020-0255(96)00056-4_BIB21","article-title":"On generalized visibility","author":"Schuierer","year":"1991"},{"key":"10.1016\/0020-0255(96)00056-4_BIB22","doi-asserted-by":"crossref","first-page":"199","DOI":"10.1016\/0196-6774(84)90027-0","article-title":"Optimal algorithms to compute the closure of a set of iso-rectangles","volume":"5","author":"Soisalon-Soininen","year":"1984","journal-title":"J. Algorithms"},{"key":"10.1016\/0020-0255(96)00056-4_BIB23","first-page":"1305","article-title":"Local convexity and Ln-sets","volume":"16","author":"Valentine","year":"1965"},{"key":"10.1016\/0020-0255(96)00056-4_BIB24","doi-asserted-by":"crossref","first-page":"728","DOI":"10.1137\/0216049","article-title":"On some distance problems in fixed orientations","volume":"16","author":"Widmayer","year":"1987","journal-title":"SIAM J. Comput."}],"container-title":["Information Sciences"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0020025596000564?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0020025596000564?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,30]],"date-time":"2019-04-30T16:51:12Z","timestamp":1556643072000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0020025596000564"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996,7]]},"references-count":24,"journal-issue":{"issue":"1-4","published-print":{"date-parts":[[1996,7]]}},"alternative-id":["0020025596000564"],"URL":"https:\/\/doi.org\/10.1016\/0020-0255(96)00056-4","relation":{},"ISSN":["0020-0255"],"issn-type":[{"value":"0020-0255","type":"print"}],"subject":[],"published":{"date-parts":[[1996,7]]}}}