{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,11,11]],"date-time":"2026-11-11T03:51:42Z","timestamp":1794369102589,"version":"4.9.0"},"publisher-location":"Berlin, Heidelberg","reference-count":10,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642106309","type":"print"},{"value":"9783642106316","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-3-642-10631-6_117","type":"book-chapter","created":{"date-parts":[[2009,12,4]],"date-time":"2009-12-04T02:03:43Z","timestamp":1259892223000},"page":"1166-1174","source":"Crossref","is-referenced-by-count":5,"title":["Algorithms for Computing the Maximum Weight Region Decomposable into Elementary Shapes"],"prefix":"10.1007","author":[{"given":"Jinhee","family":"Chun","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Ryosei","family":"Kasai","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Matias","family":"Korman","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Takeshi","family":"Tokuyama","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"issue":"2","key":"117_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":"2","key":"117_CR2","doi-asserted-by":"crossref","first-page":"13","DOI":"10.1145\/235968.233313","volume":"25","author":"Takeshi Fukuda","year":"1996","unstructured":"Fukuda, T., Morimoto, Y., Morishita, S., Tokuyama, T.: Data Mining Using Two-Dimensional Optimized Association Rules: Scheme, Algorithms, and Visualization. In: SIGMOD Conference 1996, pp. 13\u201323 (1996)","journal-title":"ACM SIGMOD Record"},{"issue":"2","key":"117_CR3","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."},{"key":"117_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","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)"},{"issue":"3-4","key":"117_CR5","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1007\/s00453-005-1169-7","volume":"42","author":"D.Z. Chen","year":"2005","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. Algorithmica\u00a042(3-4), 265\u2013288 (2005)","journal-title":"Algorithmica"},{"key":"117_CR6","doi-asserted-by":"crossref","unstructured":"Chun, J., Korman, M., N\u00f6llenburg, M., Tokuyama, T.: Consistent Digital Rays. In: Proc. 24th ACM SOCG, pp. 355\u2013364 (2008)","DOI":"10.1145\/1377676.1377737"},{"key":"117_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"108","DOI":"10.1007\/978-3-540-44400-8_11","volume-title":"Discrete and Computational Geometry","author":"J. Chun","year":"2003","unstructured":"Chun, J., Sadakane, K., Tokuyama, T.: Efficient Algorithms for Constructing a Pyramid from a Terrain. In: Akiyama, J., Kano, M. (eds.) JCDCG 2002. LNCS, vol.\u00a02866, pp. 108\u2013117. Springer, Heidelberg (2003)"},{"key":"117_CR8","unstructured":"Chun, J., Korman, M., N\u00f6llenburg, M., Tokuyama, T.: Hardness of the Maximum Union-of-Closures Problem, Preprint (preliminarlily reported in WAAC2008)., http:\/\/www.dais.is.tohoku.ac.jp\/~mati\/2peakNP.pdf"},{"issue":"4","key":"117_CR9","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1002\/net.1012","volume":"37","author":"D. Hochbaum","year":"2001","unstructured":"Hochbaum, D.: A New-Old Algorithm for Minimum-cut and Maximum-flow in Closure Graphs. Network\u00a037(4), 171\u2013193 (2001)","journal-title":"Network"},{"key":"117_CR10","unstructured":"Yoda, K., Fukuda, T., Morimoto, Y., Morishita, S., Tokuyama, T.: Computing Optimized Rectilinear Regions for Association Rules. In: Proc. KDD 1997, pp. 96\u2013103 (1997)"}],"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-10631-6_117.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,23]],"date-time":"2020-11-23T21:32:09Z","timestamp":1606167129000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-10631-6_117"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642106309","9783642106316"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-10631-6_117","relation":{"is-part-of":[{"id-type":"doi","id":"https:\/\/doi.org\/10.1007\/978-3-642-10631-6","asserted-by":"object"}]},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2009]]}}}