{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,10,12]],"date-time":"2023-10-12T05:55:23Z","timestamp":1697090123588},"reference-count":12,"publisher":"Elsevier BV","issue":"5","license":[{"start":{"date-parts":[[2002,3,1]],"date-time":"2002-03-01T00:00:00Z","timestamp":1014940800000},"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":["Information Processing Letters"],"published-print":{"date-parts":[[2002,3]]},"DOI":"10.1016\/s0020-0190(01)00228-9","type":"journal-article","created":{"date-parts":[[2002,10,14]],"date-time":"2002-10-14T13:55:05Z","timestamp":1034603705000},"page":"283-288","source":"Crossref","is-referenced-by-count":4,"title":["An optimal algorithm for reporting visible rectangles"],"prefix":"10.1016","volume":"81","author":[{"given":"N.","family":"Kitsios","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"C.","family":"Makris","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"S.","family":"Sioutas","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"A.","family":"Tsakalidis","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"J.","family":"Tsaknakis","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"B.","family":"Vassiliadis","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0020-0190(01)00228-9_BIB001","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."},{"issue":"1","key":"10.1016\/S0020-0190(01)00228-9_BIB002","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1006\/inco.1993.1059","article-title":"Output-sensitive methods for rectilinear hidden surface removal","volume":"107","author":"Goodrich","year":"1993","journal-title":"Inform. and Comput."},{"key":"10.1016\/S0020-0190(01)00228-9_BIB003","doi-asserted-by":"crossref","first-page":"207","DOI":"10.1142\/S0218195999000145","article-title":"The object complexity model for hidden line elimination","volume":"9","author":"Grove","year":"1999","journal-title":"Internat. J. Comput. Geom. Appl."},{"key":"10.1016\/S0020-0190(01)00228-9_BIB004","doi-asserted-by":"crossref","first-page":"188","DOI":"10.1016\/S0734-189X(87)80114-7","article-title":"New algorithms for special cases of the hidden line elimination problem","volume":"40","author":"Guting","year":"1987","journal-title":"Comput. Vision, Graphics Image Proc."},{"key":"10.1016\/S0020-0190(01)00228-9_BIB005","doi-asserted-by":"crossref","first-page":"209","DOI":"10.1016\/0022-0000(85)90014-5","article-title":"A linear-time algorithm for a special case of disjoint set union","volume":"30","author":"Gabow","year":"1985","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/S0020-0190(01)00228-9_BIB006","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1007\/BF02187683","article-title":"On the union of Jordan regions and collision-free translational motion amidst polygonal obstacles","volume":"1","author":"Kedem","year":"1986","journal-title":"Discrete Comput. Geom."},{"key":"10.1016\/S0020-0190(01)00228-9_BIB007","doi-asserted-by":"crossref","first-page":"223","DOI":"10.1016\/0925-7721(92)90024-M","article-title":"Efficient hidden surface removal for objects of small union size","volume":"2","author":"Katz","year":"1992","journal-title":"Comput. Geom. Theory Appl."},{"issue":"4","key":"10.1016\/S0020-0190(01)00228-9_BIB008","doi-asserted-by":"crossref","first-page":"195","DOI":"10.1016\/S0020-0190(96)00161-5","article-title":"Space-optimal hidden line elimination for rectangles","volume":"60","author":"Kitsios","year":"1997","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/S0020-0190(01)00228-9_BIB009","doi-asserted-by":"crossref","first-page":"137","DOI":"10.1016\/0020-0190(90)90062-3","article-title":"Hidden line elimination for iso-oriented rectangles","volume":"35","author":"Mehlhorn","year":"1990","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/S0020-0190(01)00228-9_BIB010","doi-asserted-by":"crossref","unstructured":"J. Matousek, J. Pach, M. Sharir, S. Sifrony, E. Welzl, Fat triangles determine linearly many holes, SIAM J. Comput. (1994) 154\u2013199","DOI":"10.1137\/S009753979018330X"},{"key":"10.1016\/S0020-0190(01)00228-9_BIB011","doi-asserted-by":"crossref","first-page":"421","DOI":"10.1007\/BF01933260","article-title":"Dynamic partition trees","volume":"31","author":"Schipper","year":"1991","journal-title":"BIT"},{"key":"10.1016\/S0020-0190(01)00228-9_BIB012","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/102377.112141","article-title":"A simple output-sensitive algorithm for hidden surface removal","volume":"11","author":"Sharir","year":"1992","journal-title":"ACM Trans. on Graphics"}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020019001002289?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020019001002289?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,28]],"date-time":"2019-04-28T10:53:37Z","timestamp":1556448817000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0020019001002289"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,3]]},"references-count":12,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2002,3]]}},"alternative-id":["S0020019001002289"],"URL":"https:\/\/doi.org\/10.1016\/s0020-0190(01)00228-9","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[2002,3]]}}}