{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,10]],"date-time":"2026-02-10T17:07:22Z","timestamp":1770743242275,"version":"3.49.0"},"reference-count":11,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[1988,12,1]],"date-time":"1988-12-01T00:00:00Z","timestamp":596937600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Comput Geom"],"published-print":{"date-parts":[[1988,12]]},"DOI":"10.1007\/bf02187918","type":"journal-article","created":{"date-parts":[[2005,10,29]],"date-time":"2005-10-29T04:11:50Z","timestamp":1130559110000},"page":"349-365","source":"Crossref","is-referenced-by-count":14,"title":["The orthogonal convex skull problem"],"prefix":"10.1007","volume":"3","author":[{"given":"Derick","family":"Wood","sequence":"first","affiliation":[]},{"given":"Chee K.","family":"Yap","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[1988,12,1]]},"reference":[{"key":"BF02187918_CR1","doi-asserted-by":"crossref","first-page":"155","DOI":"10.1007\/BF02187692","volume":"1","author":"J. S. Chang","year":"1986","unstructured":"J. S. Chang and C. K. Yap. A polynomial solution for potato-peeling problem.Discrete Comput. Geom.,1:155\u2013182, 1986.","journal-title":"Discrete Comput. Geom."},{"key":"BF02187918_CR2","doi-asserted-by":"crossref","unstructured":"J. S. Chang and C. K. Yap. A polynomial solution to potato-peeling and other polygon inclusion and enclosure problems. InProceedings of the 25th Annual Symposium on the Foundations of Computer Science, pp. 408\u2013416, 1984.","DOI":"10.1109\/SFCS.1984.715942"},{"key":"BF02187918_CR3","doi-asserted-by":"crossref","first-page":"300","DOI":"10.1137\/0215022","volume":"15","author":"B. Chazelle","year":"1986","unstructured":"B. Chazelle, R. L. Drysdale, and D. T. Lee. Computing the largest empty rectangle.SIAM Journal on Computing,15:300\u2013315, 1986.","journal-title":"SIAM Journal on Computing"},{"key":"BF02187918_CR4","first-page":"75","volume":"11","author":"J. Goodman","year":"1981","unstructured":"J. Goodman. On the largest convex polygon contained in a non-convex region.Geometrica Dedicata,11:75\u201378, 1981.","journal-title":"Geometrica Dedicata"},{"key":"BF02187918_CR5","unstructured":"M. McKenna, J. O'Rourke, and S. Suri. Finding the Largest Rectangle in an Orthogonal Polygon. Technical Report JHU\/EECS-85\/09, Electrical Engineering and Computer Science, The Johns Hopkins University, 1985."},{"key":"BF02187918_CR6","doi-asserted-by":"crossref","first-page":"157","DOI":"10.1016\/0020-0255(84)90025-2","volume":"33","author":"Th. Ottmann","year":"1984","unstructured":"Th. Ottmann, E. Soisalon-Soininen, and D. Wood. On the definition and computation of rectilinear convex hulls.Information Sciences,33:157\u2013171, 1984.","journal-title":"Information Sciences"},{"key":"BF02187918_CR7","unstructured":"J.-R. Sack. Rectilinear Computational Geometry. Technical Report SCS-TR-54, School of Computer Science, Carleton University, 1984."},{"key":"BF02187918_CR8","unstructured":"J.-R. Sack. A simple hidden-line elimination algorithm for rectilinear polygons. InProceedings of the 20th Annual Allerton Conference on Communication, Control, and Computing, pp. 437\u2013446, 1983."},{"key":"BF02187918_CR9","doi-asserted-by":"crossref","first-page":"1355","DOI":"10.1109\/T-C.1972.223507","volume":"21","author":"J. Sklansky","year":"1972","unstructured":"J. Sklansky. Measuring concavity on a rectangular mosaic.IEEE Transactions on Computers,21:1355\u20131364, 1972.","journal-title":"IEEE Transactions on Computers"},{"key":"BF02187918_CR10","series-title":"Technical Report","volume-title":"The Convex Skull Problem","author":"T. C. Woo","year":"1986","unstructured":"T. C. Woo. The Convex Skull Problem. Technical Report TR 86-31, Department of Industrial and Operations Engineering, University of Michigan, Ann Arbor, MI, 1986."},{"key":"BF02187918_CR11","unstructured":"D. Wood and C. K. Yap. The Orthogonal Convex Skull Problem. Technical Report CS-86-57, Department of Computer Science, University of Waterloo, 1986."}],"container-title":["Discrete & Computational Geometry"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02187918.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF02187918\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02187918","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,14]],"date-time":"2019-05-14T13:22:36Z","timestamp":1557840156000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF02187918"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1988,12]]},"references-count":11,"journal-issue":{"issue":"4","published-print":{"date-parts":[[1988,12]]}},"alternative-id":["BF02187918"],"URL":"https:\/\/doi.org\/10.1007\/bf02187918","relation":{},"ISSN":["0179-5376","1432-0444"],"issn-type":[{"value":"0179-5376","type":"print"},{"value":"1432-0444","type":"electronic"}],"subject":[],"published":{"date-parts":[[1988,12]]}}}