{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T15:56:51Z","timestamp":1725638211456},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642255908"},{"type":"electronic","value":"9783642255915"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"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":[[2011]]},"DOI":"10.1007\/978-3-642-25591-5_74","type":"book-chapter","created":{"date-parts":[[2011,12,3]],"date-time":"2011-12-03T00:32:34Z","timestamp":1322872354000},"page":"724-733","source":"Crossref","is-referenced-by-count":5,"title":["Maximum Weight Digital Regions Decomposable into Digital Star-Shaped Regions"],"prefix":"10.1007","author":[{"given":"Matt","family":"Gibson","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dongfeng","family":"Han","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Milan","family":"Sonka","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xiaodong","family":"Wu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"2","key":"74_CR1","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1142\/S0218195901000420","volume":"11","author":"T. Asano","year":"2001","unstructured":"Asano, T., Chen, D.Z., Katoh, N., Tokuyama, T.: Efficient algorithms for optimization-based image segmentation. Int. J. Comput. Geometry Appl.\u00a011(2), 145\u2013166 (2001)","journal-title":"Int. J. Comput. Geometry Appl."},{"issue":"11","key":"74_CR2","doi-asserted-by":"publisher","first-page":"1222","DOI":"10.1109\/34.969114","volume":"23","author":"Y. Boykov","year":"2001","unstructured":"Boykov, Y., Veksler, O., Zabih, R.: Fast approximate energy minimization via graph cuts. IEEE Trans. Pattern Anal. Mach. Intell.\u00a023(11), 1222\u20131239 (2001)","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"key":"74_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"238","DOI":"10.1007\/978-3-540-27798-9_27","volume-title":"Computing and Combinatorics","author":"D.Z. Chen","year":"2004","unstructured":"Chen, D.Z., Chun, J., Katoh, N., Tokuyama, T.: Efficient Algorithms for Approximating a Multi-dimensional Voxel Terrain by a Unimodal Terrain. In: Chwa, K.-Y., Munro, J.I.J. (eds.) COCOON 2004. LNCS, vol.\u00a03106, pp. 238\u2013248. Springer, Heidelberg (2004)"},{"key":"74_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"270","DOI":"10.1007\/3-540-45749-6_27","volume-title":"Algorithms - ESA 2002","author":"D.Z. Chen","year":"2002","unstructured":"Chen, D.Z., Hu, X.S., Luan, S., Wu, X., Yu, C.X.: Optimal Terrain Construction Problems and Applications in Intensity-modulated Radiation Therapy. In: M\u00f6hring, R.H., Raman, R. (eds.) ESA 2002. LNCS, vol.\u00a02461, pp. 270\u2013283. Springer, Heidelberg (2002)"},{"key":"74_CR5","first-page":"11","volume-title":"Symposium on Computational Geometry","author":"T. Christ","year":"2010","unstructured":"Christ, T., P\u00e1lv\u00f6lgyi, D., Stojakovic, M.: Consistent digital line segments. In: Snoeyink, J., de Berg, M., Mitchell, J.S.B., Rote, G., Teillaud, M. (eds.) Symposium on Computational Geometry, pp. 11\u201318. ACM, New York (2010)"},{"key":"74_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1166","DOI":"10.1007\/978-3-642-10631-6_117","volume-title":"Algorithms and Computation","author":"J. Chun","year":"2009","unstructured":"Chun, J., Kasai, R., Korman, M., Tokuyama, T.: Algorithms for Computing the Maximum Weight Region Decomposable into Elementary Shapes. In: Dong, Y., Du, D.-Z., Ibarra, O. (eds.) ISAAC 2009. LNCS, vol.\u00a05878, pp. 1166\u20131174. Springer, Heidelberg (2009)"},{"issue":"3","key":"74_CR7","doi-asserted-by":"publisher","first-page":"359","DOI":"10.1007\/s00454-009-9166-2","volume":"42","author":"J. Chun","year":"2009","unstructured":"Chun, J., Korman, M., N\u00f6llenburg, M., Tokuyama, T.: Consistent digital rays. Discrete & Computational Geometry\u00a042(3), 359\u2013378 (2009)","journal-title":"Discrete & Computational Geometry"},{"issue":"2","key":"74_CR8","doi-asserted-by":"publisher","first-page":"783","DOI":"10.1093\/ietisy\/e89-d.2.783","volume":"89-D","author":"J. Chun","year":"2006","unstructured":"Chun, J., Sadakane, K., Tokuyama, T.: Efficient algorithms for constructing a pyramid from a terrain. IEICE Transactions\u00a089-D(2), 783\u2013788 (2006)","journal-title":"IEICE Transactions"},{"key":"74_CR9","doi-asserted-by":"crossref","unstructured":"Fukuda, T., Morimoto, Y., Morishita, S., Tokuyama, T.: Data mining using two-dimensional optimized accociation rules: Scheme, algorithms, and visualization. In: Jagadish, H.V., Mumick, I.S. (eds.) SIGMOD Conference, pp. 13\u201323. ACM Press (1996)","DOI":"10.1145\/235968.233313"},{"issue":"2","key":"74_CR10","doi-asserted-by":"publisher","first-page":"179","DOI":"10.1145\/383891.383893","volume":"26","author":"T. Fukuda","year":"2001","unstructured":"Fukuda, T., Morimoto, Y., Morishita, S., Tokuyama, T.: Data mining with optimized two-dimensional association rules. ACM Trans. Database Syst.\u00a026(2), 179\u2013213 (2001)","journal-title":"ACM Trans. Database Syst."},{"issue":"4","key":"74_CR11","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1002\/net.1012","volume":"37","author":"D.S. Hochbaum","year":"2001","unstructured":"Hochbaum, D.S.: A new - old algorithm for minimum-cut and maximum-flow in closure graphs. Networks\u00a037(4), 171\u2013193 (2001)","journal-title":"Networks"},{"issue":"11","key":"74_CR12","doi-asserted-by":"publisher","first-page":"1268","DOI":"10.1287\/mnsc.22.11.1268","volume":"22","author":"J.-C. Picard","year":"1976","unstructured":"Picard, J.-C.: Maximal closure of a graph and applications to combinatorial problems. Management Science\u00a022(11), 1268\u20131272 (1976)","journal-title":"Management Science"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-25591-5_74","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,20]],"date-time":"2019-06-20T06:11:18Z","timestamp":1561011078000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-25591-5_74"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642255908","9783642255915"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-25591-5_74","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}