{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,4]],"date-time":"2025-05-04T04:28:14Z","timestamp":1746332894974},"reference-count":8,"publisher":"World Scientific Pub Co Pte Lt","issue":"05","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Int. J. Found. Comput. Sci."],"published-print":{"date-parts":[[2020,8]]},"abstract":"<jats:p> We investigate the problem of finding the visible pieces of a scene of objects from a specified viewpoint. In particular, we are interested in the design of an efficient hidden surface removal algorithm for a scene comprised of iso-oriented rectangles. We propose an algorithm where given a set of [Formula: see text] iso-oriented rectangles we report all visible surfaces in [Formula: see text] time and linear space, where [Formula: see text] is the number of surfaces reported. The previous best result by Bern [Journal of Computer and System Sciences 40 (1990) 49\u201369], has the same time complexity but uses [Formula: see text] space. <\/jats:p>","DOI":"10.1142\/s0129054120500240","type":"journal-article","created":{"date-parts":[[2020,8,26]],"date-time":"2020-08-26T14:56:32Z","timestamp":1598453792000},"page":"539-549","source":"Crossref","is-referenced-by-count":1,"title":["A Space-Optimal Hidden Surface Removal Algorithm for Iso-Oriented Rectangles"],"prefix":"10.1142","volume":"31","author":[{"given":"Andreas","family":"Kosmatopoulos","sequence":"first","affiliation":[{"name":"Department of Informatics, Aristotle University of Thessaloniki, Thessaloniki, Greece"}]},{"given":"Athanasios","family":"Tsakalidis","sequence":"additional","affiliation":[{"name":"Department of Computer Engineering and Informatics, University of Patras, Patras, Greece"}]},{"given":"Kostas","family":"Tsichlas","sequence":"additional","affiliation":[{"name":"Computer Engineering and Informatics Department, University of Patras, 26504, Patras, Greece"}]}],"member":"219","published-online":{"date-parts":[[2020,8,26]]},"reference":[{"key":"S0129054120500240BIB001","unstructured":"M. J. Atallah and  M. T. Goodrich ,  Output-Sensitive Hidden Surface Elimination for Rectangles,  Computer Science Dept., John Hopkins University, Technical Report,  88-13, 1988."},{"key":"S0129054120500240BIB002","volume-title":"Solution to Klee\u2019s Rectangle Problem.","author":"Bentley J. L.","year":"1977"},{"key":"S0129054120500240BIB003","doi-asserted-by":"publisher","DOI":"10.1016\/0022-0000(90)90018-G"},{"key":"S0129054120500240BIB004","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1978.3"},{"key":"S0129054120500240BIB005","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0024005"},{"key":"S0129054120500240BIB006","doi-asserted-by":"publisher","DOI":"10.1016\/S0020-0190(96)00161-5"},{"key":"S0129054120500240BIB007","doi-asserted-by":"publisher","DOI":"10.1145\/27625.27627"},{"key":"S0129054120500240BIB008","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(90)90062-3"}],"container-title":["International Journal of Foundations of Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S0129054120500240","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,9,11]],"date-time":"2020-09-11T10:53:33Z","timestamp":1599821613000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S0129054120500240"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,8]]},"references-count":8,"journal-issue":{"issue":"05","published-print":{"date-parts":[[2020,8]]}},"alternative-id":["10.1142\/S0129054120500240"],"URL":"https:\/\/doi.org\/10.1142\/s0129054120500240","relation":{},"ISSN":["0129-0541","1793-6373"],"issn-type":[{"value":"0129-0541","type":"print"},{"value":"1793-6373","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,8]]}}}