{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,22]],"date-time":"2025-03-22T04:19:47Z","timestamp":1742617187333,"version":"3.40.2"},"publisher-location":"Berlin, Heidelberg","reference-count":23,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540616801"},{"type":"electronic","value":"9783540706670"}],"license":[{"start":{"date-parts":[[1996,1,1]],"date-time":"1996-01-01T00:00:00Z","timestamp":820454400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1996]]},"DOI":"10.1007\/3-540-61680-2_66","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T22:11:21Z","timestamp":1330294281000},"page":"334-348","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["On minimum-area hulls"],"prefix":"10.1007","author":[{"given":"Esther M.","family":"Arkin","sequence":"first","affiliation":[]},{"given":"Yi-Jen","family":"Chiang","sequence":"additional","affiliation":[]},{"given":"Martin","family":"Held","sequence":"additional","affiliation":[]},{"given":"Joseph S. B.","family":"Mitchell","sequence":"additional","affiliation":[]},{"given":"Vera","family":"Sacristan","sequence":"additional","affiliation":[]},{"given":"Steven S.","family":"Skiena","sequence":"additional","affiliation":[]},{"given":"Tae-Cheon","family":"Yang","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,6,6]]},"reference":[{"key":"25_CR1","doi-asserted-by":"crossref","unstructured":"E. M. Arkin, Y-J. Chiang, M. Held, J. S. B. Mitchell, V. Sacristan, S. S. Skiena, and T-C. Yang. On minimum-area hulls. Manuscript, 1996. Available on http:\/\/ams.sunysb.edu\/\u223cjsbm\/jsbm.html","DOI":"10.1007\/3-540-61680-2_66"},{"key":"25_CR2","doi-asserted-by":"crossref","first-page":"399","DOI":"10.1007\/BF01769706","volume":"10","author":"E. M. Arkin","year":"1993","unstructured":"E. M. Arkin, S. Khuller, and J. S. B. Mitchell. Geometric knapsack problems. Algorithmica, 10:399\u2013427, 1993.","journal-title":"Algorithmica"},{"key":"25_CR3","doi-asserted-by":"crossref","first-page":"285","DOI":"10.1016\/0196-6774(86)90010-6","volume":"7","author":"M. J. Atallah","year":"1986","unstructured":"M. J. Atallah. Computing the convex hull of line intersections. J. Algorithms, 7:285\u2013288, 1986.","journal-title":"J. Algorithms"},{"key":"25_CR4","volume-title":"Report 240","author":"J. S. Chang","year":"1986","unstructured":"J. S. Chang. Polygon optimization problems. Report 240, Comput. Sci. Div., New York Univ., New York, NY, 1986."},{"key":"25_CR5","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 the potato-peeling problem. Discrete Comput. Geom., 1:155\u2013182, 1986.","journal-title":"Discrete Comput. Geom."},{"key":"25_CR6","doi-asserted-by":"crossref","unstructured":"B. Chazelle, H. Edelsbrunner, M. Grigni, L. Guibas, J. Hershberger, M. Sharir, and J. Snoeyink. Ray shooting in polygons using geodesic triangulations. In Proc. 18th JCALP'91, vol. 510, Springer LNCS, pages 661\u2013673.","DOI":"10.1007\/3-540-54233-7_172"},{"key":"25_CR7","doi-asserted-by":"crossref","first-page":"551","DOI":"10.1007\/BF02187747","volume":"4","author":"B. Chazelle","year":"1989","unstructured":"B. Chazelle and L. J. Guibas. Visibility and intersection problems in plane geometry. Discrete Comput. Geom., 4:551\u2013581, 1989.","journal-title":"Discrete Comput. Geom."},{"key":"25_CR8","unstructured":"K. Daniels. The restrict\/evaluate\/subdivide paradigm for translational containment. In Fifth MSI Stony Brook Workshop on Computational Geometry, 1995."},{"key":"25_CR9","unstructured":"K. Daniels and V. Milenkovic. Personal communication, 1995."},{"key":"25_CR10","unstructured":"K. Daniels and V.J. Milenkovic. Multiple translational containment. Part I: An approximation algorithm. Algorithmica, to appear."},{"key":"25_CR11","doi-asserted-by":"crossref","first-page":"45","DOI":"10.1007\/BF02187823","volume":"7","author":"D. Eppstein","year":"1992","unstructured":"D. Eppstein, M. Overmars, G. Rote, and G. Woeginger. Finding minimum area k-gons. Discrete Comput. Geom., 7:45\u201358, 1992.","journal-title":"Discrete Comput. Geom."},{"key":"25_CR12","doi-asserted-by":"crossref","unstructured":"J. Erickson and R. Seidel. Better lower bounds on detecting affine and spherical degeneracies. In Proc. FOCS'1993, pages 528\u2013536.","DOI":"10.1109\/SFCS.1993.366834"},{"key":"25_CR13","doi-asserted-by":"crossref","first-page":"365","DOI":"10.1007\/BF01758852","volume":"8","author":"R. Fleischer","year":"1992","unstructured":"R. Fleischer, K. Mehlhorn, G. Rote, E. Welzl, and C. K. Yap. Simultaneous inner and outer approximation of shapes. Algorithmica, 8:365\u2013389, 1992.","journal-title":"Algorithmica"},{"key":"25_CR14","doi-asserted-by":"crossref","first-page":"165","DOI":"10.1016\/0925-7721(95)00022-2","volume":"5","author":"A. Gajentaan","year":"1995","unstructured":"A. Gajentaan and M. H. Overmars. On a class of O(n 2) problems in computational geometry. Comput. Geom. Theory Appl., 5:165\u2013185, 1995.","journal-title":"Comput. Geom. Theory Appl."},{"key":"25_CR15","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1007\/BF01840360","volume":"2","author":"L. J. Guibas","year":"1987","unstructured":"L. J. Guibas, J. Hershberger, D. Leven, M. Sharir, and R. E. Tarjan. Linear-time algorithms for visibility and shortest path problems inside triangulated simple polygons. Algorithmica, 2:209\u2013233, 1987.","journal-title":"Algorithmica"},{"key":"25_CR16","unstructured":"Z. Li. Compaction algorithms for non-convex polygons and their applications. Ph.d. Thesis, Harvard University, Division of Applied Sciences, 1994."},{"key":"25_CR17","doi-asserted-by":"crossref","unstructured":"Z. Li and V. Milenkovic. A compaction algorithm for non-convex polygons and its application. In Proc. 9th Annu. ACM Sympos. Comput. Geom., pages 153\u2013162, 1993.","DOI":"10.1145\/160985.161013"},{"key":"25_CR18","unstructured":"V. Milenkovic, K. Daniels, and Z. Li. Automatic marker making. In Proc. 3rd Canad. Conf. Comput. Geom., pages 243\u2013246, 1991."},{"key":"25_CR19","unstructured":"V. Milenkovic, K. Daniels, and Z. Li. Placement and compaction of nonconvex polygons for clothing manufacture. In Proc. 4th Canad. Conf. Comput. Geom., pages 236\u2013243, 1992."},{"key":"25_CR20","doi-asserted-by":"crossref","first-page":"564","DOI":"10.1016\/0196-6774(90)90010-C","volume":"11","author":"D. M. Mount","year":"1990","unstructured":"D. M. Mount and R. Silverman. Packing and covering the plane with translates of a convex polygon. J. Algorithms, 11:564\u2013580, 1990.","journal-title":"J. Algorithms"},{"key":"25_CR21","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4612-1098-6","volume-title":"Computational Geometry: An Introduction","author":"F. P. Preparata","year":"1985","unstructured":"F. P. Preparata and M. I. Shamos. Computational Geometry: An Introduction. Springer-Verlag, New York, NY, 1985."},{"key":"25_CR22","doi-asserted-by":"crossref","first-page":"219","DOI":"10.1016\/0167-8655(83)90028-4","volume":"1","author":"G. T. Toussaint","year":"1983","unstructured":"G. T. Toussaint and H. ElGindy, A counterexample to an algorithm for computing monotone hulls of simple polygons. Pattern Recogn. Lett., 1:219\u2013222, 1983.","journal-title":"Pattern Recogn. Lett."},{"key":"25_CR23","doi-asserted-by":"crossref","first-page":"449","DOI":"10.1016\/0167-8655(86)90043-7","volume":"4","author":"G. T. Toussaint","year":"1986","unstructured":"G. T. Toussaint. A linear-time algorithm for solving the strong hidden-line problem in a simple polygon. Pattern Recogn. Lett., 4:449\u2013451, 1986.","journal-title":"Pattern Recogn. Lett."}],"container-title":["Lecture Notes in Computer Science","Algorithms \u2014 ESA '96"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-61680-2_66","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,21]],"date-time":"2025-03-21T23:23:55Z","timestamp":1742599435000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-61680-2_66"}},"subtitle":["Extended abstract"],"short-title":[],"issued":{"date-parts":[[1996]]},"ISBN":["9783540616801","9783540706670"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/3-540-61680-2_66","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1996]]},"assertion":[{"value":"6 June 2005","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}