{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,6,6]],"date-time":"2024-06-06T11:59:48Z","timestamp":1717675188680},"reference-count":7,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1997,3,1]],"date-time":"1997-03-01T00:00:00Z","timestamp":857174400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Computers & Graphics"],"published-print":{"date-parts":[[1997,3]]},"DOI":"10.1016\/s0097-8493(96)00084-2","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T15:05:05Z","timestamp":1027609505000},"page":"209-214","source":"Crossref","is-referenced-by-count":6,"title":["A fast algorithm for line clipping by convex polyhedron in E3"],"prefix":"10.1016","volume":"21","author":[{"given":"V\u00e1clav","family":"Skala","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0097-8493(96)00084-2_BIB1","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1016\/0097-8493(78)90021-3","article-title":"Generalized two and three dimensional clipping","volume":"3","author":"Cyrus","year":"1979","journal-title":"Computers & Graphics"},{"key":"10.1016\/S0097-8493(96)00084-2_BIB2","doi-asserted-by":"crossref","first-page":"417","DOI":"10.1016\/0097-8493(93)90030-D","article-title":"An efficient algorithm for line clipping by convex polygon","volume":"17","author":"Skala","year":"1993","journal-title":"Computers & Graphics"},{"key":"10.1016\/S0097-8493(96)00084-2_BIB3","doi-asserted-by":"crossref","first-page":"517","DOI":"10.1016\/0097-8493(94)90064-7","article-title":"O(lg N) line clipping algorithm in E2","volume":"18","author":"Skala","year":"1994","journal-title":"Computers & Graphics"},{"key":"10.1016\/S0097-8493(96)00084-2_BIB4","doi-asserted-by":"crossref","first-page":"523","DOI":"10.1016\/0097-8493(96)00024-6","article-title":"Line clipping in E3 with O(1) processing complexity convex","volume":"20","author":"Skala","year":"1996","journal-title":"Computers & Graphics"},{"key":"10.1016\/S0097-8493(96)00084-2_BIB5","series-title":"Proceedings of 12th Spring Conference on Computer Graphics","first-page":"27","article-title":"A comparison of O(1) and Cyrus-Beck line clipping algorithms in E2 and E3","author":"Skala","year":"1996"},{"key":"10.1016\/S0097-8493(96)00084-2_BIB6","author":"Foley","year":"1990"},{"key":"10.1016\/S0097-8493(96)00084-2_BIB7","first-page":"61","article-title":"An efficient algorithm for line clipping by convex and non-convex polyhedrons in E3","volume":"15","author":"Skala","year":"1996"}],"container-title":["Computers & Graphics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0097849396000842?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0097849396000842?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,22]],"date-time":"2019-04-22T22:55:25Z","timestamp":1555973725000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0097849396000842"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997,3]]},"references-count":7,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1997,3]]}},"alternative-id":["S0097849396000842"],"URL":"https:\/\/doi.org\/10.1016\/s0097-8493(96)00084-2","relation":{},"ISSN":["0097-8493"],"issn-type":[{"value":"0097-8493","type":"print"}],"subject":[],"published":{"date-parts":[[1997,3]]}}}