{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,1,16]],"date-time":"2025-01-16T16:10:02Z","timestamp":1737043802356,"version":"3.33.0"},"reference-count":14,"publisher":"Springer Science and Business Media LLC","issue":"7","license":[{"start":{"date-parts":[[2007,5,24]],"date-time":"2007-05-24T00:00:00Z","timestamp":1179964800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2007,5,24]],"date-time":"2007-05-24T00:00:00Z","timestamp":1179964800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Visual Comput"],"published-print":{"date-parts":[[2007,7]]},"DOI":"10.1007\/s00371-007-0121-z","type":"journal-article","created":{"date-parts":[[2007,5,23]],"date-time":"2007-05-23T21:30:49Z","timestamp":1179955849000},"page":"503-511","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Polygon visibility ordering via Voronoi diagrams"],"prefix":"10.1007","volume":"23","author":[{"given":"Shinichi","family":"Fukushige","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hiromasa","family":"Suzuki","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2007,5,24]]},"reference":[{"key":"121_CR1","doi-asserted-by":"crossref","unstructured":"Agarwal, P.K., Murali, T.M., Vitter, J.S.: Practical techniques for constructing binary space partitions for orthogonal rectangles. In: Proceedings of Symposium on Computational Geometry, pp. 382\u2013384 (1997)","DOI":"10.1145\/262839.263011"},{"issue":"3","key":"121_CR2","doi-asserted-by":"publisher","first-page":"346","DOI":"10.1145\/116873.116880","volume":"23","author":"F. Aurenhammer","year":"1991","unstructured":"Aurenhammer, F.: Voronoi diagrams: a survey of a fundamental geometric data structure. ACM Comput. Surv. 23(3), 346\u2013405 (1991)","journal-title":"ACM Comput. Surv."},{"key":"121_CR3","doi-asserted-by":"crossref","unstructured":"Catmull, E.: A hidden-surface algorithm with antialiasing. In: Proceedings of ACM SIGGRAPH\u201978, pp. 6\u201311 (1978)","DOI":"10.1145\/965139.807360"},{"key":"121_CR4","doi-asserted-by":"crossref","unstructured":"Chen, H., Wang, W.: The feudal priority algorithm on hidden-surface removal. In: Proceedings of ACM SIGGRAPH\u201996, pp. 55\u201364 (1996)","DOI":"10.1145\/237170.237204"},{"key":"121_CR5","doi-asserted-by":"crossref","first-page":"25","DOI":"10.1080\/10867651.2003.10487592","volume":"8","author":"A. Dur","year":"2003","unstructured":"Dur, A., Leimgruber, S.: A practical list-priority algorithm for 3D polygons. J. Graph. Tools 8, 25\u201336 (2003)","journal-title":"J. Graph. Tools"},{"issue":"3","key":"121_CR6","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1145\/964967.801134","volume":"17","author":"H. Fuchs","year":"1983","unstructured":"Fuchs, H., Abram, G.D., Grant, E.D.: Near real-time shaded display of rigid objects. Comput. Graph. 17(3), 65\u201372 (1983)","journal-title":"Comput. Graph."},{"key":"121_CR7","doi-asserted-by":"crossref","unstructured":"Fuchs, H., Kedem, Z.M., Naylor, B.F.: On visible surface generation by a priori tree structures. In: Proceedings of ACM SIGGRAPH\u201980, pp. 124\u2013133 (1980)","DOI":"10.1145\/965105.807481"},{"key":"121_CR8","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1111\/1467-8659.00215","volume":"17","author":"A. James","year":"1998","unstructured":"James, A., Day, A.M.: The priority face determination tree for hidden surface removal. Comput. Graph. Forum 17, 55\u201371 (1998)","journal-title":"Comput. Graph. Forum"},{"key":"121_CR9","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1111\/1467-8659.1440217","volume":"14","author":"P. Morer","year":"1995","unstructured":"Morer, P., Garcia-Alonso, A.M., Flaquer, J.: Optimization of a priority list algorithm for 3D rendering of buildings. Comput. Graph. Forum 14, 217\u2013227 (1995)","journal-title":"Comput. Graph. Forum"},{"key":"121_CR10","unstructured":"Nayor, B.F.: A priori based techniques for determining visibility priory for 3D scenes. Dissertation, University of Texas at Dallas (1981)"},{"key":"121_CR11","doi-asserted-by":"crossref","unstructured":"Newell, M.E., Newell, R.G., Sancha, T.L.: A solution to the hidden surface problem. In: Proceedings of the ACM National Conference, pp. 443\u2013450 (1972)","DOI":"10.1145\/800193.569954"},{"key":"121_CR12","doi-asserted-by":"crossref","unstructured":"Schumacker, R.A., Brand, B., Gilliland, M.G., Sharp, W.H.: Study for applying computer-generated images to visual simulation. Technical Report AFHRL-TR-69-14, Air Force Human Resources Lab, Brooks Air Force Base, TX (1969)","DOI":"10.21236\/AD0700375"},{"key":"121_CR13","doi-asserted-by":"crossref","unstructured":"Sutherland, I.E., Sproull, R.F., Schumacker, R.A.: Sorting and the hidden-surface problem. In: Proceedings of the National Computer Conference, pp. 685\u2013693 (1973)","DOI":"10.1145\/1499586.1499749"},{"key":"121_CR14","doi-asserted-by":"crossref","unstructured":"Yao, F.F.: On the priority approach to hidden-surface algorithms. In: Proceedings of the 21st Annual IEEE Symposium on the Foundations of Computer Science, pp. 301\u2013307 (1980)","DOI":"10.1109\/SFCS.1980.32"}],"container-title":["The Visual Computer"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00371-007-0121-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00371-007-0121-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00371-007-0121-z","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00371-007-0121-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,16]],"date-time":"2025-01-16T15:41:36Z","timestamp":1737042096000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00371-007-0121-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007,5,24]]},"references-count":14,"journal-issue":{"issue":"7","published-print":{"date-parts":[[2007,7]]}},"alternative-id":["121"],"URL":"https:\/\/doi.org\/10.1007\/s00371-007-0121-z","relation":{},"ISSN":["0178-2789","1432-2315"],"issn-type":[{"type":"print","value":"0178-2789"},{"type":"electronic","value":"1432-2315"}],"subject":[],"published":{"date-parts":[[2007,5,24]]},"assertion":[{"value":"24 May 2007","order":1,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}