乐胖代购免代理版

{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,7,4]],"date-time":"2024-07-04T17:41:50Z","timestamp":1720114910224},"reference-count":38,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2012,12,1]],"date-time":"2012-12-01T00:00:00Z","timestamp":1354320000000},"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":[[2012,12]]},"DOI":"10.1016\/j.ins.2012.05.029","type":"journal-article","created":{"date-parts":[[2012,6,20]],"date-time":"2012-06-20T21:24:03Z","timestamp":1340227443000},"page":"176-195","source":"Crossref","is-referenced-by-count":11,"special_numbering":"C","title":["A linear-time combinatorial algorithm to find the orthogonal hull of an object on the digital plane"],"prefix":"10.1016","volume":"216","author":[{"given":"Arindam","family":"Biswas","sequence":"first","affiliation":[]},{"given":"Partha","family":"Bhowmick","sequence":"additional","affiliation":[]},{"given":"Moumita","family":"Sarkar","sequence":"additional","affiliation":[]},{"given":"Bhargab B.","family":"Bhattacharya","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"issue":"4","key":"10.1016\/j.ins.2012.05.029_b0005","doi-asserted-by":"crossref","first-page":"487","DOI":"10.1109\/TIP.2005.843755","article-title":"Jpeg2000-coded image error concealment exploiting convex sets projections","volume":"14","author":"Atzori","year":"2005","journal-title":"IEEE Transactions on Image Processing"},{"key":"10.1016\/j.ins.2012.05.029_b0010","doi-asserted-by":"crossref","first-page":"163","DOI":"10.1007\/s10898-006-9065-5","article-title":"Extremal problems for convex polygons","volume":"38","author":"Audet","year":"2007","journal-title":"Journal of Global Optimization"},{"key":"10.1016\/j.ins.2012.05.029_b0015","doi-asserted-by":"crossref","unstructured":"D. Avis, D. Bremner, How good are convex hull algorithms? in: Symposium on Computational Geometry, 1995, pp. 20\u201328.","DOI":"10.1145\/220279.220282"},{"key":"10.1016\/j.ins.2012.05.029_b0020","unstructured":"P. Balazs, On the number of hv-convex discrete sets, in: V. Brimkov, R. Barneva, H. Hauptman (Eds.), Intl. Workshop on Combinatorial Image Analysis (IWCIA), LNCS, vol. 4958. Springer-Verlag, Berlin Heidelberg."},{"key":"10.1016\/j.ins.2012.05.029_b0025","unstructured":"B.B. Barber, D.P. Dobkin, H. Huhdanpaa, The quickhull algorithm for convex hull, The Geometry Center, University of Minnesota, Technical Report GCG53, July 1993."},{"key":"10.1016\/j.ins.2012.05.029_b0030","doi-asserted-by":"crossref","unstructured":"M.D. Berg, M.V. Kreveld, M. Overmars, O. Schwarzkopf, Computational Geometry Algorithms and Applications, Springer-Verlag, Berlin, 2000.","DOI":"10.1007\/978-3-662-04245-8"},{"key":"10.1016\/j.ins.2012.05.029_b0035","unstructured":"A. Biswas, P. Bhowmick, B.B. Bhattacharya, TIPS: On finding a Tight Isothetic Polygonal Shape covering a 2D object, in: Proc. 14th Scandinavian Conf. Image Analysis (SCIA), LNCS, vol. 3540, Springer, Berlin, 2005, pp. 930\u2013939."},{"key":"10.1016\/j.ins.2012.05.029_b0040","unstructured":"A. Biswas, P. Bhowmick, M. Sarkar, B.B. Bhattacharya, Finding the orthogonal hull of digital object: a combinatorial approach, in: V. Brimkov, R. Barneva, H. Hauptman (Eds.), Intl. Workshop on Combinatorial Image Analysis (IWCIA), LNCS, vol. 4958. Springer-Verlag, Berlin Heidelberg."},{"key":"10.1016\/j.ins.2012.05.029_b0045","series-title":"Morphometric Tools for Landmark Data: Geometry and Biology","author":"Bookstein","year":"1991"},{"issue":"1-3","key":"10.1016\/j.ins.2012.05.029_b0050","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0012-365X(95)00003-F","article-title":"A method for the enumeration of various classes of column-convex polygons","volume":"154","author":"Bousquet-Mlou","year":"1996","journal-title":"Discrete Mathematics"},{"key":"10.1016\/j.ins.2012.05.029_b0055","doi-asserted-by":"crossref","first-page":"163","DOI":"10.1016\/0167-8655(93)90067-N","article-title":"Computing deviations from convexity in polygons","volume":"14","author":"Boxer","year":"1993","journal-title":"Pattern Recognition Letters"},{"key":"10.1016\/j.ins.2012.05.029_b0060","doi-asserted-by":"crossref","first-page":"377","DOI":"10.1007\/BF02573985","article-title":"An optimal convex hull algorithm in any fixed dimension","volume":"10","author":"Chazelle","year":"1993","journal-title":"Discrete Computational Geometry"},{"key":"10.1016\/j.ins.2012.05.029_b0065","unstructured":"T.H. Cormen, C.E. Leiserson, R.L. Rivest, Introduction to Algorithms, Prentice Hall of India, New-Delhi, 2000."},{"key":"10.1016\/j.ins.2012.05.029_b0070","series-title":"Shape Analysis and Classification","author":"Costa","year":"2001"},{"key":"10.1016\/j.ins.2012.05.029_b0075","doi-asserted-by":"crossref","first-page":"175","DOI":"10.1016\/0020-0255(96)00056-4","article-title":"Fundamentals of restricted-orientation convexity","volume":"92","author":"Fink","year":"1996","journal-title":"Information Sciences"},{"key":"10.1016\/j.ins.2012.05.029_b0080","doi-asserted-by":"crossref","first-page":"132","DOI":"10.1016\/0020-0190(72)90045-2","article-title":"An efficient algorithm for determining the convex hull of a finite point set","volume":"1","author":"Graham","year":"1972","journal-title":"Information Processing Letters"},{"key":"10.1016\/j.ins.2012.05.029_b0085","series-title":"The Language of Shape","author":"Hyde","year":"1997"},{"key":"10.1016\/j.ins.2012.05.029_b0090","doi-asserted-by":"crossref","first-page":"18","DOI":"10.1016\/0020-0190(73)90020-3","article-title":"On the identification of the convex hull of a finite set of points in the plane","volume":"2","author":"Jarvis","year":"1973","journal-title":"Information Processing Letters"},{"issue":"3","key":"10.1016\/j.ins.2012.05.029_b0095","doi-asserted-by":"crossref","first-page":"192","DOI":"10.1109\/LSP.2008.2012227","article-title":"A novel multiple image deblurring technique using fuzzy projection onto convex sets","volume":"16","author":"Jung","year":"2009","journal-title":"IEEE Signal Processing Letters"},{"key":"10.1016\/j.ins.2012.05.029_b0100","unstructured":"R. Karlsson, M. Overmars, Scanline algorithms on a grid, second ed. Dept. of Computer Science, University of Utrecht, Technical Report RUU-CS-86-18, 1986."},{"issue":"2","key":"10.1016\/j.ins.2012.05.029_b0105","doi-asserted-by":"crossref","first-page":"227","DOI":"10.1007\/BF01934088","article-title":"Scanline algorithms on a grid","volume":"28","author":"Karlsson","year":"1988","journal-title":"BIT Numerical Mathematics"},{"key":"10.1016\/j.ins.2012.05.029_b0110","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1137\/0215021","article-title":"The ultimate planar convex hull algorithm?","volume":"15","author":"Kirkpatrick","year":"1986","journal-title":"SIAM Journal on Computing"},{"key":"10.1016\/j.ins.2012.05.029_b0115","unstructured":"R. Klette, A. Rosenfeld, Digital Geometry: Geometric Methods for Digital Picture Analysis, Morgan Kaufmann Series in Computer Graphics and Geometric Modeling, Morgan Kaufmann, San Francisco, 2004."},{"key":"10.1016\/j.ins.2012.05.029_b0120","unstructured":"S.C. Nandy, K. Mukhopadhyaya, B.B. Bhattacharya, Recognition of the largest empty ortho-convex polygon in a point set, in: Proc. Canadian Conference on Computational Geometry (CCCG), 2008."},{"issue":"3","key":"10.1016\/j.ins.2012.05.029_b0125","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":"Information Sciences"},{"key":"10.1016\/j.ins.2012.05.029_b0130","series-title":"Geomorphology","author":"Pitty","year":"1984"},{"key":"10.1016\/j.ins.2012.05.029_b0135","series-title":"Computational Geometry","author":"Preparata","year":"1985"},{"key":"10.1016\/j.ins.2012.05.029_b0140","doi-asserted-by":"crossref","unstructured":"F.P. Preparata, M.I. Shamos, Computational Geometry\u2014An Introduction, Spinger-Verlag, New York, 1985.","DOI":"10.1007\/978-1-4612-1098-6"},{"key":"10.1016\/j.ins.2012.05.029_b0145","series-title":"Digital Picture Processing","author":"Rosenfeld","year":"1982"},{"key":"10.1016\/j.ins.2012.05.029_b0150","series-title":"Image Processing Analysis and Machine Vision","author":"Sonka","year":"1993"},{"key":"10.1016\/j.ins.2012.05.029_b0155","doi-asserted-by":"crossref","first-page":"229","DOI":"10.1016\/0167-8655(89)90093-7","article-title":"Polygonal entropy: a convexity measure","volume":"10","author":"Stern","year":"1989","journal-title":"Pattern Recognition Letters"},{"key":"10.1016\/j.ins.2012.05.029_b0160","doi-asserted-by":"crossref","first-page":"17","DOI":"10.1016\/0196-6774(85)90017-3","article-title":"Finding the convex hull facet by facet","author":"Swart","year":"1985","journal-title":"Journal of Algorithms"},{"key":"10.1016\/j.ins.2012.05.029_b0165","doi-asserted-by":"crossref","first-page":"3964","DOI":"10.1016\/j.ins.2009.06.023","article-title":"A new family of metrics for compact convex (fuzzy) sets based on a generalized concept of mid and spread","volume":"179","author":"Trutschnig","year":"2009","journal-title":"Information Sciences"},{"issue":"12","key":"10.1016\/j.ins.2012.05.029_b0170","doi-asserted-by":"crossref","first-page":"1836","DOI":"10.1109\/83.974568","article-title":"Restoration of error-diffused images using projection onto convex sets","volume":"10","author":"Unal","year":"2001","journal-title":"IEEE Transactions on Image Processing"},{"issue":"10","key":"10.1016\/j.ins.2012.05.029_b0175","doi-asserted-by":"crossref","first-page":"891","DOI":"10.1109\/TCSVT.2002.804881","article-title":"Artifact reduction in compressed images based on region homogeneity constraints using the projection onto convex sets algorithm","volume":"12","author":"Weerasinghe","year":"2002","journal-title":"IEEE Transactions on Circuits and Systems for Video Technology"},{"issue":"4","key":"10.1016\/j.ins.2012.05.029_b0180","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 Journal on Computing"},{"issue":"3","key":"10.1016\/j.ins.2012.05.029_b0185","doi-asserted-by":"crossref","first-page":"449","DOI":"10.1109\/TR.2005.853039","article-title":"On constructing the minimum orthogonal convex polygon for the fault-tolerant routing in 2-d faulty meshes","volume":"54","author":"Wu","year":"2005","journal-title":"IEEE Transactions on Reliability"},{"issue":"7","key":"10.1016\/j.ins.2012.05.029_b0190","doi-asserted-by":"crossref","first-page":"923","DOI":"10.1109\/TPAMI.2004.19","article-title":"A new convexity measure for polygons","volume":"26","author":"Zunic","year":"2004","journal-title":"IEEE Transactions on PAMI"}],"container-title":["Information Sciences"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020025512004100?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020025512004100?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,6,30]],"date-time":"2019-06-30T00:59:27Z","timestamp":1561856367000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0020025512004100"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,12]]},"references-count":38,"alternative-id":["S0020025512004100"],"URL":"https:\/\/doi.org\/10.1016\/j.ins.2012.05.029","relation":{},"ISSN":["0020-0255"],"issn-type":[{"value":"0020-0255","type":"print"}],"subject":[],"published":{"date-parts":[[2012,12]]}}}