{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,10,24]],"date-time":"2023-10-24T04:19:34Z","timestamp":1698121174875},"reference-count":0,"publisher":"Wiley","issue":"2","license":[{"start":{"date-parts":[[2003,2,7]],"date-time":"2003-02-07T00:00:00Z","timestamp":1044576000000},"content-version":"vor","delay-in-days":3995,"URL":"http:\/\/onlinelibrary.wiley.com\/termsAndConditions#vor"}],"content-domain":{"domain":["onlinelibrary.wiley.com"],"crossmark-restriction":true},"short-container-title":["Computer Graphics Forum"],"published-print":{"date-parts":[[1992,3]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>This paper compares two image space hidden surface removal algorithms for polygonal scenes. These are the z\u2010buffer and scan\u2010line algorithms. There is first an overview of each algorithm, followed by a simulation experiment, designed to compare the number of polygons per second which can be rendered by each algorithm. The simulation varies the number of polygons in the scene, and the size and distribution of polygons over the display. The results suggest that the z\u2010buffer is preferred for a large enough number of polygons, however, smaller polygons and uniform distribution of polygons favour the scan\u2010line approach. The analysis does not take into account the complexity of the shading rule, which is likely also to favour the scan\u2010line method.<\/jats:p>","DOI":"10.1111\/1467-8659.1120131","type":"journal-article","created":{"date-parts":[[2003,2,21]],"date-time":"2003-02-21T22:18:59Z","timestamp":1045865939000},"page":"131-138","update-policy":"http:\/\/dx.doi.org\/10.1002\/crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["A Statistical Comparison of Two Hidden Surface Techniques: the Scan\u2010line and Z\u2010buffer Algorithms"],"prefix":"10.1111","volume":"11","author":[{"given":"Mel","family":"Slater","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kieron","family":"Drake","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Allan","family":"Davison","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Emmanouell","family":"Kordakis","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Adam","family":"Billyard","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Eliot","family":"Miranda","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"311","published-online":{"date-parts":[[2003,2,7]]},"container-title":["Computer Graphics Forum"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.wiley.com\/onlinelibrary\/tdm\/v1\/articles\/10.1111%2F1467-8659.1120131","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/pdf\/10.1111\/1467-8659.1120131","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,10,23]],"date-time":"2023-10-23T14:40:39Z","timestamp":1698072039000},"score":1,"resource":{"primary":{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/10.1111\/1467-8659.1120131"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1992,3]]},"references-count":0,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1992,3]]}},"alternative-id":["10.1111\/1467-8659.1120131"],"URL":"https:\/\/doi.org\/10.1111\/1467-8659.1120131","archive":["Portico"],"relation":{},"ISSN":["0167-7055","1467-8659"],"issn-type":[{"value":"0167-7055","type":"print"},{"value":"1467-8659","type":"electronic"}],"subject":[],"published":{"date-parts":[[1992,3]]},"assertion":[{"value":"2003-02-07","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}