{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,5]],"date-time":"2026-03-05T17:52:27Z","timestamp":1772733147259,"version":"3.50.1"},"reference-count":13,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[2002,4,1]],"date-time":"2002-04-01T00:00:00Z","timestamp":1017619200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2002,4,1]],"date-time":"2002-04-01T00:00:00Z","timestamp":1017619200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2002,4,1]],"date-time":"2002-04-01T00:00:00Z","timestamp":1017619200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-017"},{"start":{"date-parts":[[2002,4,1]],"date-time":"2002-04-01T00:00:00Z","timestamp":1017619200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"},{"start":{"date-parts":[[2002,4,1]],"date-time":"2002-04-01T00:00:00Z","timestamp":1017619200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-012"},{"start":{"date-parts":[[2002,4,1]],"date-time":"2002-04-01T00:00:00Z","timestamp":1017619200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2002,4,1]],"date-time":"2002-04-01T00:00:00Z","timestamp":1017619200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-004"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Computers & Graphics"],"published-print":{"date-parts":[[2002,4]]},"DOI":"10.1016\/s0097-8493(02)00060-2","type":"journal-article","created":{"date-parts":[[2002,10,14]],"date-time":"2002-10-14T10:29:16Z","timestamp":1034591356000},"page":"341-350","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":29,"title":["Polygonal chain intersection"],"prefix":"10.1016","volume":"26","author":[{"given":"Sang C.","family":"Park","sequence":"first","affiliation":[]},{"given":"Hayong","family":"Shin","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"issue":"2","key":"10.1016\/S0097-8493(02)00060-2_BIB1","doi-asserted-by":"crossref","first-page":"71","DOI":"10.1145\/274363.274364","article-title":"Efficient clipping of arbitrary polygons","volume":"17","author":"Greiner","year":"1998","journal-title":"ACM Transactions on Graphics"},{"issue":"7","key":"10.1016\/S0097-8493(02)00060-2_BIB2","doi-asserted-by":"crossref","first-page":"56","DOI":"10.1145\/129902.129906","article-title":"A generic solution to polygon clipping","volume":"35","author":"Vatti","year":"1992","journal-title":"Communications of the ACM"},{"issue":"10","key":"10.1016\/S0097-8493(02)00060-2_BIB3","doi-asserted-by":"crossref","first-page":"739","DOI":"10.1145\/358656.358681","article-title":"Plane-sweep algorithms for intersecting geometric figures","volume":"25","author":"Nievergelt","year":"1982","journal-title":"Communications of the ACM"},{"issue":"2","key":"10.1016\/S0097-8493(02)00060-2_BIB4","doi-asserted-by":"crossref","first-page":"152","DOI":"10.1145\/130826.130832","article-title":"An algorithm for generating NC tool paths for arbitrary shaped pockets with island","volume":"11","author":"Hansen","year":"1992","journal-title":"ACM Transaction on Graphics"},{"issue":"12","key":"10.1016\/S0097-8493(02)00060-2_BIB5","doi-asserted-by":"crossref","first-page":"735","DOI":"10.1016\/S0010-4485(99)00060-3","article-title":"A pair-wise offset algorithm for 2D point-sequence curve","volume":"31","author":"Choi","year":"1999","journal-title":"Computer-Aided Design"},{"key":"10.1016\/S0097-8493(02)00060-2_BIB6","series-title":"On the computational geometry of pocket machining","author":"Held","year":"1991"},{"issue":"1","key":"10.1016\/S0097-8493(02)00060-2_BIB7","doi-asserted-by":"crossref","first-page":"17","DOI":"10.1016\/S0010-4485(99)00080-9","article-title":"Tool-path planning for direction-parallel area milling","volume":"32","author":"Park","year":"2000","journal-title":"Computer-Aided Design"},{"issue":"2","key":"10.1016\/S0097-8493(02)00060-2_BIB8","doi-asserted-by":"crossref","first-page":"123","DOI":"10.1016\/S0010-4485(97)00064-X","article-title":"An algorithm for reducing tool retractions in zigzag pocket machining","volume":"30","author":"Tang","year":"1998","journal-title":"Computer-Aided Design"},{"key":"10.1016\/S0097-8493(02)00060-2_BIB9","doi-asserted-by":"crossref","first-page":"643","DOI":"10.1109\/TC.1979.1675432","article-title":"Algorithms for reporting and counting geometric intersections","volume":"28","author":"Bentley","year":"1979","journal-title":"IEEE Transactions on Computers"},{"key":"10.1016\/S0097-8493(02)00060-2_BIB10","series-title":"Computational geometry\u2014an introduction","author":"Preparata","year":"1985"},{"issue":"4","key":"10.1016\/S0097-8493(02)00060-2_BIB11","doi-asserted-by":"crossref","first-page":"439","DOI":"10.1287\/ijoc.4.4.439","article-title":"Monotone pieces of chains","volume":"4","author":"Chandru","year":"1992","journal-title":"ORSA Journal on Computing"},{"key":"10.1016\/S0097-8493(02)00060-2_BIB12","doi-asserted-by":"crossref","first-page":"161","DOI":"10.1016\/0020-0190(81)90091-0","article-title":"Testing a simple polygon for monotonocity","volume":"12","author":"Preparata","year":"1981","journal-title":"Information Processing Letters"},{"key":"10.1016\/S0097-8493(02)00060-2_BIB13","doi-asserted-by":"crossref","unstructured":"Shamos MI, Hoey DJ. Geometric intersection problems. In: Proceedings of the 17th Annual Conference Foundation of Computer Science, October 1976. p. 208\u201315.","DOI":"10.1109\/SFCS.1976.16"}],"container-title":["Computers & Graphics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0097849302000602?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0097849302000602?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,9,25]],"date-time":"2025-09-25T17:18:24Z","timestamp":1758820704000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0097849302000602"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,4]]},"references-count":13,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2002,4]]}},"alternative-id":["S0097849302000602"],"URL":"https:\/\/doi.org\/10.1016\/s0097-8493(02)00060-2","relation":{},"ISSN":["0097-8493"],"issn-type":[{"value":"0097-8493","type":"print"}],"subject":[],"published":{"date-parts":[[2002,4]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Polygonal chain intersection","name":"articletitle","label":"Article Title"},{"value":"Computers & Graphics","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/S0097-8493(02)00060-2","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"converted-article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 2002 Elsevier Science Ltd. All rights reserved.","name":"copyright","label":"Copyright"}]}}