{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,11]],"date-time":"2025-07-11T10:48:51Z","timestamp":1752230931016},"reference-count":20,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1990,2,1]],"date-time":"1990-02-01T00:00:00Z","timestamp":633830400000},"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":8567,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Computer and System Sciences"],"published-print":{"date-parts":[[1990,2]]},"DOI":"10.1016\/0022-0000(90)90018-g","type":"journal-article","created":{"date-parts":[[2003,12,4]],"date-time":"2003-12-04T12:01:00Z","timestamp":1070539260000},"page":"49-69","source":"Crossref","is-referenced-by-count":27,"title":["Hidden surface removal for rectangles"],"prefix":"10.1016","volume":"40","author":[{"given":"Marshall","family":"Bern","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0022-0000(90)90018-G_BIB1","series-title":"The Design and Analysis of Computer Algorithms","author":"Aho","year":"1974"},{"key":"10.1016\/0022-0000(90)90018-G_BIB2","article-title":"Output-Sensitive Hidden Surface Elimination for Rectangles","author":"Atallah","year":"1988"},{"key":"10.1016\/0022-0000(90)90018-G_BIB3","doi-asserted-by":"crossref","first-page":"133","DOI":"10.1007\/BF01840440","article-title":"Fractional cascading. I. A data structuring technique","volume":"1","author":"Chazelle","year":"1986","journal-title":"Algorithmiea"},{"key":"10.1016\/0022-0000(90)90018-G_BIB4","series-title":"Proceedings, 18th ACM Symp. on Theory of Computing","first-page":"109","article-title":"Making data structures persistent","author":"Driscoll","year":"1986"},{"key":"10.1016\/0022-0000(90)90018-G_BIB5","first-page":"34","article-title":"A note on dynamic range searching","volume":"15","author":"Edelsbrunner","year":"1981","journal-title":"Bull. EATCS"},{"key":"10.1016\/0022-0000(90)90018-G_BIB6","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1016\/0020-0190(81)90053-3","article-title":"On the intersection of orthogonal objects","volume":"13","author":"Edelsbrunner","year":"1981","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/0022-0000(90)90018-G_BIB7","series-title":"Proceedings, 1st ACM Symp. on Comp. Geometry","first-page":"168","article-title":"Dynamization of geometric data structures","author":"Fries","year":"1985"},{"key":"10.1016\/0022-0000(90)90018-G_BIB8","series-title":"Proceedings, 15th Annual ACM Symp. on Theory of Computing","first-page":"246","article-title":"A linear-time algorithm for a special case of disjoint set union","author":"Gabow","year":"1983"},{"key":"10.1016\/0022-0000(90)90018-G_BIB9","series-title":"Proceedings, 25th Allerton Conf. on Comm., Control, and Comput","first-page":"849","article-title":"A polygonal approach to hidden-line elimination","author":"Goodrich","year":"1987"},{"key":"10.1016\/0022-0000(90)90018-G_BIB10","series-title":"Proceedings, 9th ACM Symp. on Theory of Computing","first-page":"49","article-title":"A new representation for linear lists","author":"Guibas","year":"1977"},{"key":"10.1016\/0022-0000(90)90018-G_BIB11","series-title":"Proceedings, Symp. on Theor. Aspects of Comput. Sci.","article-title":"New algorithms for special cases of the hidden line elimination problem","author":"G\u00fcting","year":"1985"},{"key":"10.1016\/0022-0000(90)90018-G_BIB12","doi-asserted-by":"crossref","first-page":"257","DOI":"10.1137\/0214021","article-title":"Priority search trees","volume":"14","author":"McCreight","year":"1985","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0022-0000(90)90018-G_BIB13","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1145\/27625.27627","article-title":"Worst-case optimal hidden surface removal","volume":"6","author":"McKenna","year":"1987","journal-title":"ACM Trans. Graphics"},{"key":"10.1016\/0022-0000(90)90018-G_BIB14","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1109\/MC.1986.1663332","article-title":"A complete and efficient implementation of covered windows","volume":"19","author":"Myers","year":"1986","journal-title":"Computer"},{"key":"10.1016\/0022-0000(90)90018-G_BIB15","series-title":"Computational Geometry: An introduction","author":"Preparata","year":"1985"},{"key":"10.1016\/0022-0000(90)90018-G_BIB16","series-title":"Computation of the axial view of a set of isothetic parallelepipeds","author":"Preparata","year":"1988"},{"key":"10.1016\/0022-0000(90)90018-G_BIB17","doi-asserted-by":"crossref","first-page":"669","DOI":"10.1145\/6138.6151","article-title":"Planar point location using persistent search trees","volume":"29","author":"Sarnak","year":"1986","journal-title":"Comm. ACM"},{"key":"10.1016\/0022-0000(90)90018-G_BIB18","series-title":"Data Structures and Network Algorithms","author":"Tarjan","year":"1983"},{"key":"10.1016\/0022-0000(90)90018-G_BIB19","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1007\/BF01683268","article-title":"Design and implementation of an efficient priority queue","volume":"10","author":"Van Emde Boas","year":"1977","journal-title":"Math. Systems Theory"},{"key":"10.1016\/0022-0000(90)90018-G_BIB20","doi-asserted-by":"crossref","first-page":"597","DOI":"10.1145\/3828.3839","article-title":"Adding range restriction capability to dynamic data structure","volume":"32","author":"Willard","year":"1985","journal-title":"J. Assoc. Comput. Mach."}],"container-title":["Journal of Computer and System Sciences"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:002200009090018G?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:002200009090018G?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,2,16]],"date-time":"2019-02-16T13:55:28Z","timestamp":1550325328000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/002200009090018G"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1990,2]]},"references-count":20,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1990,2]]}},"alternative-id":["002200009090018G"],"URL":"https:\/\/doi.org\/10.1016\/0022-0000(90)90018-g","relation":{},"ISSN":["0022-0000"],"issn-type":[{"value":"0022-0000","type":"print"}],"subject":[],"published":{"date-parts":[[1990,2]]}}}