{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:02:45Z","timestamp":1725663765550},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540571551"},{"type":"electronic","value":"9783540479185"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1993]]},"DOI":"10.1007\/3-540-57155-8_249","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T12:05:46Z","timestamp":1330257946000},"page":"210-221","source":"Crossref","is-referenced-by-count":7,"title":["Filling polyhedral molds"],"prefix":"10.1007","author":[{"given":"Prosenjit","family":"Bose","sequence":"first","affiliation":[]},{"given":"Marc","family":"Kreveld","sequence":"additional","affiliation":[]},{"given":"Godfried","family":"Toussaint","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,6,9]]},"reference":[{"key":"21_CR1","doi-asserted-by":"crossref","unstructured":"Bose, P., M. van Kreveld, and G. Toussaint, Filling polyhedral molds. Tech. Rep. No. SOCS 93.1, School of Computer Science, McGill University, 1993.","DOI":"10.1007\/3-540-57155-8_249"},{"key":"21_CR2","unstructured":"Bose, P., and G. Toussaint, Geometric and computational aspects of injection molding. Tech. Rep. No. SOCS 92.16, School of Computer Science, McGill University, 1992."},{"key":"21_CR3","volume-title":"Injection Moulding of Plastic Components","author":"J. Bown","year":"1979","unstructured":"Bown, J., Injection Moulding of Plastic Components. McGraw-Hill, England, 1979."},{"key":"21_CR4","doi-asserted-by":"crossref","unstructured":"Chazelle, B., Triangulating a simple polygon in linear time. Proc. 31st IEEE Symp. Found. Comp. Science (1990), pp. 220\u2013230.","DOI":"10.1109\/FSCS.1990.89541"},{"key":"21_CR5","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/147508.147511","volume":"39","author":"B. Chazelle","year":"1992","unstructured":"Chazelle, B., and H. Edelsbrunner, An optimal algorithm for intersecting line segments in the plane. J. ACM 39 (1992), pp. 1\u201354.","journal-title":"J. ACM"},{"key":"21_CR6","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0304-3975(80)90031-6","volume":"11","author":"D. Dobkin","year":"1980","unstructured":"Dobkin, D., and S. Reiss, The Complexity of Linear Programming. Theoretical Computer Science 11 (1980), pp. 1\u201318.","journal-title":"Theoretical Computer Science"},{"key":"21_CR7","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-61568-9","volume-title":"Algorithms in Combinatorial Geometry","author":"H. Edelsbrunner","year":"1987","unstructured":"Edelsbrunner, H., Algorithms in Combinatorial Geometry. Springer-Verlag, Berlin, 1987."},{"key":"21_CR8","unstructured":"Fekete, S., and J. Mitchell, Geometric aspects of injection molding. Manuscript, 1993."},{"key":"21_CR9","unstructured":"Gajentaan, A., and M.H. Overmars, O(n2) difficult problems in computational geometry. Tech. Report, Dept. of Computer Science, Utrecht University, 1993, to appear."},{"key":"21_CR10","first-page":"81","volume":"24-2","author":"K.C. Hui","year":"1992","unstructured":"Hui, K.C., and S.T. Tan, Mould design with sweep operations \u2014 a heuristic search approach. C.A.D., 24-2: 81\u201390, 1992.","journal-title":"C.A.D."},{"key":"21_CR11","doi-asserted-by":"crossref","unstructured":"van Kreveld, M., Fat partitioning, fat covering and the union size of polygons. Tech. Rep. No. SOCS 93.2, School of Computer Science, McGill University, 1993. Extended abstract in these proceedings.","DOI":"10.1007\/3-540-57155-8_270"},{"key":"21_CR12","unstructured":"Matou\u0161ek, J., N. Miller, J. Pach, M. Sharir, S. Sifrony, and E. Welzl, Fat triangles determine linearly many holes. Proc. 32nd IEEE Symp. Found. Comp. Science (1991), pp. 49\u201358."},{"key":"21_CR13","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1016\/0020-0190(79)90069-3","volume":"8","author":"D. McCallum","year":"1979","unstructured":"McCallum, D. and D. Avis, A linear time algorithm for finding the convex hull of a simple polygon. Inform. Process. Lett. 8, (1979), pp. 201\u2013205.","journal-title":"Inform. Process. Lett."},{"key":"21_CR14","doi-asserted-by":"publisher","first-page":"759","DOI":"10.1137\/0212052","volume":"12","author":"N. Megiddo","year":"1983","unstructured":"Megiddo, N., Linear-time algorithms for linear programming in R 3 and related problems. SIAM J. Comp. 12 (1983), pp. 759\u2013776.","journal-title":"SIAM J. Comp."},{"key":"21_CR15","doi-asserted-by":"crossref","first-page":"11","DOI":"10.1016\/0020-0190(87)90086-X","volume":"25","author":"A. Melkman","year":"1987","unstructured":"Melkman, A., On-line construction of the convex hull of a simple polyline. Inform. Process. Lett. 25, (1987), pp. 11\u201312.","journal-title":"Inform. Process. Lett."},{"key":"21_CR16","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4612-1098-6","volume-title":"Computational geometry \u2014 an introduction","author":"F.P. Preparata","year":"1985","unstructured":"Preparata, F.P., and M.I. Shamos, Computational geometry \u2014 an introduction. Springer-Verlag, New York, 1985."},{"key":"21_CR17","volume-title":"Plastics mold engineering handbook","author":"W.I. Pribble","year":"1987","unstructured":"Pribble, W.I., Molds for reaction injection, structural foam and expandable styr\u00e9ne molding. In: Plastics mold engineering handbook, J.H. DuBois and W.I. Pribble (Eds.), Van Nostrand Reinhold Company Inc., New York, 1987."},{"key":"21_CR18","doi-asserted-by":"crossref","first-page":"593","DOI":"10.1007\/BF02574706","volume":"6","author":"M. Sharir","year":"1991","unstructured":"Sharir, M., On k-sets in arrangements of curves and surfaces. Discr. & Comp. Geom. 6 (1991), pp. 593\u2013613.","journal-title":"Discr. & Comp. Geom."},{"key":"21_CR19","first-page":"335","volume-title":"Computational Geometry","author":"G. Toussaint","year":"1990","unstructured":"Toussaint, G., Movable Separability of Sets. In: Computational Geometry, North-Holland, New York, (1990), pp. 335\u2013375."}],"container-title":["Lecture Notes in Computer Science","Algorithms and Data Structures"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-57155-8_249.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,12,31]],"date-time":"2021-12-31T05:12:37Z","timestamp":1640927557000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-57155-8_249"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993]]},"ISBN":["9783540571551","9783540479185"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/3-540-57155-8_249","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1993]]}}}