{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,22]],"date-time":"2025-11-22T10:54:38Z","timestamp":1763808878174,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":12,"publisher":"ACM","license":[{"start":{"date-parts":[[2009,10,5]],"date-time":"2009-10-05T00:00:00Z","timestamp":1254700800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["547675"],"award-info":[{"award-number":["547675"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2009,10,5]]},"DOI":"10.1145\/1629255.1629297","type":"proceedings-article","created":{"date-parts":[[2009,10,8]],"date-time":"2009-10-08T17:31:08Z","timestamp":1255023068000},"page":"319-324","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":3,"title":["Efficient computation of a near-optimal primary parting line"],"prefix":"10.1145","author":[{"given":"Rahul","family":"Khardekar","sequence":"first","affiliation":[{"name":"University of California, Berkeley"}]},{"given":"Sara","family":"McMains","sequence":"additional","affiliation":[{"name":"University of California, Berkeley"}]}],"member":"320","published-online":{"date-parts":[[2009,10,5]]},"reference":[{"key":"e_1_3_2_1_1_1","volume-title":"http:\/\/www.cgal.org","author":"Algorithms Library Computational Geometry","year":"2007","unstructured":"Computational Geometry Algorithms Library . http:\/\/www.cgal.org , 2007 . Computational Geometry Algorithms Library. http:\/\/www.cgal.org, 2007."},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1016\/0166-218X(90)90127-X"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.cad.2008.02.002"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0010-4485(01)00117-8"},{"key":"e_1_3_2_1_5_1","first-page":"795","article-title":"Computer-assisted parting line development for cast pattern production","volume":"98","author":"Ganter M. A.","year":"1990","unstructured":"M. A. Ganter and L. L. Tuss . Computer-assisted parting line development for cast pattern production . AFS Transactions , 98 : 795 -- 800 , 1990 . M. A. Ganter and L. L. Tuss. Computer-assisted parting line development for cast pattern production. AFS Transactions, 98:795--800, 1990.","journal-title":"AFS Transactions"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1016\/0166-218X(91)90011-K"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/1236246.1236274"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0925-7721(99)00023-1"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/2422.322418"},{"key":"e_1_3_2_1_10_1","first-page":"394","volume-title":"Graphics Gems V","author":"Narkhede A.","unstructured":"A. Narkhede and D. Manocha . Fast polygon triangulation based on Seidel's algorithm . Graphics Gems V , pages 394 -- 397 . A. Narkhede and D. Manocha. Fast polygon triangulation based on Seidel's algorithm. Graphics Gems V, pages 394--397."},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0925-7721(99)00042-5"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01201764"}],"event":{"name":"SIAM '09: 2009 SIAM\/ACM Joint Conference on Geometric and Physical Modeling","sponsor":["SIAM Activity Group on Geometric Design","SIGGRAPH ACM Special Interest Group on Computer Graphics and Interactive Techniques"],"location":"San Francisco California","acronym":"SIAM '09"},"container-title":["2009 SIAM\/ACM Joint Conference on Geometric and Physical Modeling"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1629255.1629297","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1629255.1629297","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T12:41:26Z","timestamp":1750250486000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1629255.1629297"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,10,5]]},"references-count":12,"alternative-id":["10.1145\/1629255.1629297","10.1145\/1629255"],"URL":"https:\/\/doi.org\/10.1145\/1629255.1629297","relation":{},"subject":[],"published":{"date-parts":[[2009,10,5]]},"assertion":[{"value":"2009-10-05","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}