{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T13:15:13Z","timestamp":1725887713589},"publisher-location":"Cham","reference-count":17,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319591070"},{"type":"electronic","value":"9783319591087"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017]]},"DOI":"10.1007\/978-3-319-59108-7_16","type":"book-chapter","created":{"date-parts":[[2017,5,16]],"date-time":"2017-05-16T04:43:06Z","timestamp":1494909786000},"page":"198-211","source":"Crossref","is-referenced-by-count":2,"title":["Inscribing Convex Polygons in Star-Shaped Objects"],"prefix":"10.1007","author":[{"given":"Nikolay M.","family":"Sirakov","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nona Nikolaeva","family":"Sirakova","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,5,17]]},"reference":[{"key":"16_CR1","unstructured":"Aggarwal, A., Booth, H., O\u2019Rourke, J., Suri, S.: Finding minimal convex nested polygons. J. Inf. Comput. 83(1), 98\u2013110 (1989)"},{"key":"16_CR2","doi-asserted-by":"publisher","unstructured":"Arbelaez, P., Hariharan, P., Gu, C., Gupta, S., Bourdev, L., Malik, J.: Semantic segmentation using regions and parts. In: Proceedings of IEEE CVPR 2012, Rhode Island, 16\u201321 June (2012). doi: 10.1109\/CVPR.2012.6248077","DOI":"10.1109\/CVPR.2012.6248077"},{"key":"16_CR3","doi-asserted-by":"crossref","unstructured":"Aslan, C., Tari, M.: An axis based representation for recognition. In: ICCV, pp. 1339\u20131346 (2005)","DOI":"10.1109\/ICCV.2005.32"},{"issue":"1","key":"16_CR4","doi-asserted-by":"crossref","first-page":"211","DOI":"10.1023\/A:1022102007948","volume":"96","author":"M Bridgeman","year":"2003","unstructured":"Bridgeman, M., Canary, R.D.: From the boundary of the convex core to the conformal boundary. J. Geometrica Dedicata 96(1), 211\u2013240 (2003)","journal-title":"J. Geometrica Dedicata"},{"key":"16_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1007\/978-3-642-12712-0_2","volume-title":"Computational Modeling of Objects Represented in Images","author":"VE Brimkov","year":"2010","unstructured":"Brimkov, V.E., Barneva, R.P.: Digital stars and visibility of digital objects. In: Barneva, R.P., Brimkov, V.E., Hauptman, H.A., Natal Jorge, R.M., Tavares, J.M.R.S. (eds.) CompIMAGE 2010. LNCS, vol. 6026, pp. 11\u201323. Springer, Heidelberg (2010). doi: 10.1007\/978-3-642-12712-0_2"},{"key":"16_CR6","unstructured":"Crawling neutrophil chasing a bacterium. http:\/\/www.youtube.com\/watch?v=I_xh-bkiv_c . Accessed 01 Dec 2015"},{"key":"16_CR7","unstructured":"Coeurjolly, D., Chassery, J.-M.: Fast approximation of the maximum area convex subset for star-shaped polygons. In: RR-LIRIS-2004-006, CNRS (2004). http:\/\/liris.cnrs.fr\/Documents\/Liris-1909.pdf"},{"key":"16_CR8","doi-asserted-by":"crossref","unstructured":"Carreira, J., Sminchisescu, C.: CPMC: automatic object segmentation using constrained parametric min-cuts. IEEE Trans. PAMI 34(7), 1312\u20131328 (2012)","DOI":"10.1109\/TPAMI.2011.231"},{"issue":"10","key":"16_CR9","first-page":"1454","volume":"10","author":"J Fan","year":"2001","unstructured":"Fan, J., Yao, D.K., Elmagarmid, A.K., Aref, W.G.: Automatic image segmentation by integrating color-edge extraction and seeded region growing. IEEE TIP 10(10), 1454\u20131466 (2001)","journal-title":"IEEE TIP"},{"key":"16_CR10","doi-asserted-by":"publisher","unstructured":"Hall-Holt, O., Katz, M.J., Kumar, P., Mitchell, J.S., Sityon, B.A.: Finding large stick and potato in polygons. In: Proceedings of the 17th SIAM SODA 2006, pp. 474\u2013483 (2006). doi: 10.1145\/1109557.1109610","DOI":"10.1145\/1109557.1109610"},{"key":"16_CR11","unstructured":"Jin, K., Matulef, R.D.: Finding the maximum area paralelogram in a convex polygon. In: CCCG2011, Toronto, 10\u201312 August 2011 (2011). cccg.ca\/PDFschedule\/papers\/paper3.pdf"},{"key":"16_CR12","unstructured":"Keil, J.M.: Polygon Decomposition Survey in Handbook of Computational Geometry. Elsevier Sciences Publishing, Amsterdam (2000). Sack, J.R., Urrutia, J. (eds.) ISBN: 9780444825377"},{"issue":"2006","key":"16_CR13","doi-asserted-by":"crossref","first-page":"100","DOI":"10.1016\/j.comgeo.2005.10.005","volume":"35","author":"J-M Lien","year":"2006","unstructured":"Lien, J.-M., Amato, N.M.: Approximate convex decomposition of poligons. Comput. Geom. 35(2006), 100\u2013123 (2006)","journal-title":"Comput. Geom."},{"issue":"3","key":"16_CR14","doi-asserted-by":"crossref","first-page":"309","DOI":"10.1007\/s10851-006-9004-6","volume":"26","author":"NM Sirakov","year":"2006","unstructured":"Sirakov, N.M.: A new active convex hull model for image regions. J. Math. Imaging Vis. 26(3), 309\u2013325 (2006)","journal-title":"J. Math. Imaging Vis."},{"key":"16_CR15","doi-asserted-by":"crossref","unstructured":"Sirakov, N.M.: Monotonic vector forces and Green\u2019s theorem for automatic area calculation. In: Proceedings of IEEE ICIP2007, San Antonio, September, vol. IV, pp. 297\u2013300 (2007)","DOI":"10.1109\/ICIP.2007.4380013"},{"key":"16_CR16","doi-asserted-by":"crossref","unstructured":"Tari, S.: Extracting parts of 2D shapes using local and global interactions simultaneously. In: Chen, C.H. (ed.) Handbook of Pattern Recognition and Computer Vision, 4th edn., pp. 283\u2013303 (2009)","DOI":"10.1142\/9789814273398_0012"},{"issue":"1","key":"16_CR17","doi-asserted-by":"crossref","first-page":"69","DOI":"10.1007\/s10851-013-0441-8","volume":"49","author":"S Tari","year":"2014","unstructured":"Tari, S., Genctav, M.: From a non-local Ambrosio-Tortorelli phase field to a randomized part hierarchy tree. JMIV 49(1), 69\u201386 (2014)","journal-title":"JMIV"}],"container-title":["Lecture Notes in Computer Science","Combinatorial Image Analysis"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-59108-7_16","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,24]],"date-time":"2019-09-24T14:06:54Z","timestamp":1569334014000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-59108-7_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319591070","9783319591087"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-59108-7_16","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2017]]}}}