{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,26]],"date-time":"2025-09-26T00:21:32Z","timestamp":1758846092972,"version":"3.44.0"},"reference-count":24,"publisher":"Elsevier BV","issue":"5","license":[{"start":{"date-parts":[[1999,10,1]],"date-time":"1999-10-01T00:00:00Z","timestamp":938736000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[1999,10,1]],"date-time":"1999-10-01T00:00:00Z","timestamp":938736000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2001,12,26]],"date-time":"2001-12-26T00:00:00Z","timestamp":1009324800000},"content-version":"vor","delay-in-days":817,"URL":"http:\/\/creativecommons.org\/licenses\/by-nc-nd\/4.0\/"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Computers & Graphics"],"published-print":{"date-parts":[[1999,10]]},"DOI":"10.1016\/s0097-8493(99)00091-6","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T22:59:16Z","timestamp":1027637956000},"page":"681-692","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":16,"title":["Hierarchical back-face computation"],"prefix":"10.1016","volume":"23","author":[{"given":"Subodh","family":"Kumar","sequence":"first","affiliation":[]},{"given":"Dinesh","family":"Manocha","sequence":"additional","affiliation":[]},{"given":"William","family":"Garrett","sequence":"additional","affiliation":[]},{"given":"Ming","family":"Lin","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"year":"1993","series-title":"Computer graphics principles and practice","author":"Foley","key":"10.1016\/S0097-8493(99)00091-6_BIB1"},{"issue":"3","key":"10.1016\/S0097-8493(99)00091-6_BIB2","doi-asserted-by":"crossref","first-page":"242","DOI":"10.1145\/965141.563901","article-title":"Shadow algorithms for computer graphics","volume":"11","author":"Crow","year":"1977","journal-title":"ACM Computer Graphics"},{"key":"10.1016\/S0097-8493(99)00091-6_BIB3","series-title":"Graphics gems V","first-page":"380","article-title":"Velocity-based collision detection","author":"Bouma","year":"1995"},{"key":"10.1016\/S0097-8493(99)00091-6_BIB4","doi-asserted-by":"crossref","first-page":"360","DOI":"10.1007\/BF01187019","article-title":"Visibility with a moving point of view","volume":"11","author":"Bern","year":"1994","journal-title":"Algorithmica"},{"key":"10.1016\/S0097-8493(99)00091-6_BIB5","doi-asserted-by":"crossref","unstructured":"Fuchs H, Kedem Z, Naylor B. On Visible Surface Generation by a Priority Tree Structure. In Proceedings of ACM SIGGRAPH, 1980. p. 124\u201333.","DOI":"10.1145\/965105.807481"},{"issue":"1","key":"10.1016\/S0097-8493(99)00091-6_BIB6","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/356625.356626","article-title":"A Characterization of Ten Hidden-surface Algorithms","volume":"6","author":"Sutherland","year":"1974","journal-title":"ACM Computing Surveys"},{"key":"10.1016\/S0097-8493(99)00091-6_BIB7","doi-asserted-by":"crossref","unstructured":"Schumacker R, Brand B, Gilliland M, Sharp W. Study for applying computer-generated images to visual generation. Technical Report, AFHRL-TR-69-74, US Air Force Human Resources Lab, 1969.","DOI":"10.21236\/AD0700375"},{"key":"10.1016\/S0097-8493(99)00091-6_BIB8","doi-asserted-by":"crossref","unstructured":"Newell M, Newell R, Sancha T. A new solution to the hidden surface problem. Proceedings of ACM Annual Conference, 1972. p. 443\u20138.","DOI":"10.1145\/800193.569954"},{"issue":"10","key":"10.1016\/S0097-8493(99)00091-6_BIB9","doi-asserted-by":"crossref","first-page":"547","DOI":"10.1145\/360349.360354","article-title":"Hierarchical geometric models for visible surface algorithms","volume":"19","author":"Clark","year":"1976","journal-title":"Communications of the ACM"},{"issue":"2","key":"10.1016\/S0097-8493(99)00091-6_BIB10","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1145\/91394.91416","article-title":"Towards image realism with interactive update rates in complex virtual building environments","volume":"24","author":"Airey","year":"1990","journal-title":"ACM Computer Graphics"},{"key":"10.1016\/S0097-8493(99)00091-6_BIB11","unstructured":"Teller SJ. Visibility computations in densely occluded polyhedral environments. PhD thesis, CS Division, UC Berkeley, 1992."},{"key":"10.1016\/S0097-8493(99)00091-6_BIB12","doi-asserted-by":"crossref","unstructured":"Greene N, Kass M, Miller G. Hierarchical Z-buffer visibility. In Proceedings of ACM SIGGRAPH, 1993. p. 231\u20138.","DOI":"10.1145\/166117.166147"},{"key":"10.1016\/S0097-8493(99)00091-6_BIB13","doi-asserted-by":"crossref","unstructured":"Zhang H, Manocha D, Hudson T, Hoff K. Visibility culling using hierarchical occlusion maps. In Proceedings of ACM SIGGRAPH, 1997. p. 77\u201388.","DOI":"10.1145\/258734.258781"},{"issue":"6","key":"10.1016\/S0097-8493(99)00091-6_BIB14","doi-asserted-by":"crossref","first-page":"542","DOI":"10.1109\/34.87341","article-title":"Efficiently computing and representing aspect graphs of polyhedral objects","volume":"13","author":"Gigus","year":"1991","journal-title":"IEEE Transactions on Pattern Analysis and Machine Intelligence"},{"key":"10.1016\/S0097-8493(99)00091-6_BIB15","doi-asserted-by":"crossref","unstructured":"Coorg S, Teller S. Temporally coherent conservative visibility. In Proceedings of 12th Annual ACM Symposium on Computational Geometry, 1996. p. 78\u201387.","DOI":"10.1145\/237218.237242"},{"key":"10.1016\/S0097-8493(99)00091-6_BIB16","doi-asserted-by":"crossref","unstructured":"Durand F, Drettakis G, Puech C. The visibility skeleton: a powerful and efficient multi-purpose global visibility tool. In Proceedings of ACM SIGGRAPH, 1997. p. 89\u2013100.","DOI":"10.1145\/258734.258785"},{"key":"10.1016\/S0097-8493(99)00091-6_BIB17","unstructured":"Kumar S, Manocha D. Hierarchical visibility culling for spline models. In Proceedings of Graphics Interface, Toronto, Canada, 1996. p. 142\u201350."},{"key":"10.1016\/S0097-8493(99)00091-6_BIB18","doi-asserted-by":"crossref","unstructured":"Shirman LA, Abi-Ezzi SS. The cone of normals technique for fast processing of curved patches. In EUROGRAPHICS, 1993. p. 261\u201372.","DOI":"10.1111\/1467-8659.1230261"},{"key":"10.1016\/S0097-8493(99)00091-6_BIB19","doi-asserted-by":"crossref","unstructured":"Tanimoto SL. A graph-theoretic real-time visible surface editing technique. In Proceedings of ACM SIGGRAPH, 1977. p. 223-8.","DOI":"10.1145\/563858.563897"},{"year":"1985","series-title":"Computational geometry","author":"Preparata","key":"10.1016\/S0097-8493(99)00091-6_BIB20"},{"key":"10.1016\/S0097-8493(99)00091-6_BIB21","unstructured":"Barber B, Dobkin D, Huhdanpaa H. The quickhull algorithm for convex hull. Technical Report GCG53, The Geometry Center, MN, 1993."},{"key":"10.1016\/S0097-8493(99)00091-6_BIB22","doi-asserted-by":"crossref","unstructured":"Seidel R. Linear programming and convex hulls made easy. In Proceedings of 6th Annual ACM Conference on Computational Geometry, Berkeley, California, 1990. p. 211\u20135.","DOI":"10.1145\/98524.98570"},{"key":"10.1016\/S0097-8493(99)00091-6_BIB23","first-page":"154","article-title":"Fast detection of polyhedral intersection","volume":"vol. 140","author":"Dobkin","year":"1982"},{"key":"10.1016\/S0097-8493(99)00091-6_BIB24","doi-asserted-by":"crossref","unstructured":"Durand F, Puech C. The visibility complex made visibly simple. In Proceedings of 11th Annual ACM Symposium Computational Geometry, 1995. p. V2.","DOI":"10.1145\/220279.220340"}],"container-title":["Computers & Graphics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0097849399000916?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0097849399000916?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,9,25]],"date-time":"2025-09-25T17:18:09Z","timestamp":1758820689000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0097849399000916"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999,10]]},"references-count":24,"journal-issue":{"issue":"5","published-print":{"date-parts":[[1999,10]]}},"alternative-id":["S0097849399000916"],"URL":"https:\/\/doi.org\/10.1016\/s0097-8493(99)00091-6","relation":{},"ISSN":["0097-8493"],"issn-type":[{"type":"print","value":"0097-8493"}],"subject":[],"published":{"date-parts":[[1999,10]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Hierarchical back-face computation","name":"articletitle","label":"Article Title"},{"value":"Computers & Graphics","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/S0097-8493(99)00091-6","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"converted-article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 1999 Published by Elsevier Ltd.","name":"copyright","label":"Copyright"}]}}