{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,3,25]],"date-time":"2024-03-25T22:46:41Z","timestamp":1711406801315},"reference-count":12,"publisher":"Elsevier BV","issue":"6","license":[{"start":{"date-parts":[[1996,11,1]],"date-time":"1996-11-01T00:00:00Z","timestamp":846806400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":6102,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Computational Geometry"],"published-print":{"date-parts":[[1996,11]]},"DOI":"10.1016\/0925-7721(95)00030-5","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T08:08:03Z","timestamp":1027584483000},"page":"397-404","source":"Crossref","is-referenced-by-count":3,"title":["Space reduction and an extension for a hidden line elimination algorithm"],"prefix":"10.1016","volume":"6","author":[{"given":"Nectarios","family":"Kitsios","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Athanasios","family":"Tsakalidis","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0925-7721(95)00030-5_BIB1","doi-asserted-by":"crossref","first-page":"11","DOI":"10.1007\/BF02189304","article-title":"Applications of a new space partitioning technique","volume":"9","author":"Agarwal","year":"1993","journal-title":"Discrete Comput. Geom."},{"key":"10.1016\/0925-7721(95)00030-5_BIB2","doi-asserted-by":"crossref","first-page":"643","DOI":"10.1109\/TC.1979.1675432","article-title":"Algorithms for reporting and counting geometric intersections","volume":"C-28","author":"Bentley","year":"1979","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/0925-7721(95)00030-5_BIB3","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1016\/0022-0000(90)90018-G","article-title":"Hidden surface removal for rectangles","volume":"40","author":"Bern","year":"1990","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0925-7721(95)00030-5_BIB4","doi-asserted-by":"crossref","first-page":"30","DOI":"10.1007\/BF01377182","article-title":"Efficient ray shooting and hidden surface removal","volume":"12","author":"de Berg","year":"1994","journal-title":"Algorithmica"},{"key":"10.1016\/0925-7721(95)00030-5_BIB5","doi-asserted-by":"crossref","first-page":"147","DOI":"10.1109\/TC.1981.6312179","article-title":"Comments on \u201cAlgorithms for reporting and counting geometric intersections\u201d","volume":"C-30","author":"Brown","year":"1981","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/0925-7721(95)00030-5_BIB6","doi-asserted-by":"crossref","first-page":"86","DOI":"10.1016\/0022-0000(89)90034-2","article-title":"Making data structures persistent","volume":"38","author":"Driscoll","year":"1989","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0925-7721(95)00030-5_BIB7","series-title":"Proc. 25th Allerton Conf. on Communication, Control and Computing","first-page":"849","article-title":"A polygonal approach to hidden line elimination","author":"Goodrich","year":"1987"},{"key":"10.1016\/0925-7721(95)00030-5_BIB8","series-title":"Proc. ICALP'90","first-page":"689","article-title":"An input size \/ output size trade-off in the time-complexity of rectilinear hidden surface removal","volume":"443","author":"Goodrich","year":"1990"},{"key":"10.1016\/0925-7721(95)00030-5_BIB9","doi-asserted-by":"crossref","first-page":"223","DOI":"10.1016\/0925-7721(92)90024-M","article-title":"Efficient hidden surface removal for objects with small union size","volume":"2","author":"Katz","year":"1992","journal-title":"Computational Geometry"},{"issue":"3","key":"10.1016\/0925-7721(95)00030-5_BIB10","doi-asserted-by":"crossref","first-page":"466","DOI":"10.1007\/BF01935366","article-title":"A fast line sweep algorithm for hidden line elimination","volume":"25","author":"Nurmi","year":"1985","journal-title":"BIT"},{"key":"10.1016\/0925-7721(95)00030-5_BIB11","article-title":"On the time and space complexity of certain exact hidden line algorithms","author":"Schmitt","year":"1981"},{"key":"10.1016\/0925-7721(95)00030-5_BIB12","article-title":"Efficient algorithms for reporting intersections","author":"Swart","year":"1983"}],"container-title":["Computational Geometry"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0925772195000305?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0925772195000305?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,30]],"date-time":"2019-04-30T21:55:23Z","timestamp":1556661323000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0925772195000305"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996,11]]},"references-count":12,"journal-issue":{"issue":"6","published-print":{"date-parts":[[1996,11]]}},"alternative-id":["0925772195000305"],"URL":"https:\/\/doi.org\/10.1016\/0925-7721(95)00030-5","relation":{},"ISSN":["0925-7721"],"issn-type":[{"value":"0925-7721","type":"print"}],"subject":[],"published":{"date-parts":[[1996,11]]}}}