{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,21]],"date-time":"2025-03-21T22:40:01Z","timestamp":1742596801885,"version":"3.40.2"},"publisher-location":"Berlin, Heidelberg","reference-count":31,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540571551"},{"type":"electronic","value":"9783540479185"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1993]]},"DOI":"10.1007\/3-540-57155-8_278","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T12:06:50Z","timestamp":1330258010000},"page":"541-552","source":"Crossref","is-referenced-by-count":1,"title":["Repetitive hidden-surface-removal for polyhedral scenes"],"prefix":"10.1007","author":[{"given":"Marco","family":"Pellegrini","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,6,9]]},"reference":[{"key":"50_CR1","doi-asserted-by":"crossref","unstructured":"P. Agarwal and J. Matou\u0161ek. Range searching with semialgebraic sets. In Proc. of the 17th Symp. on Mathematical Foundations of Computer Science, number 629 in Lecture Notes in Computer Science, pages 1\u201313, 1992.","DOI":"10.1007\/3-540-55808-X_1"},{"key":"50_CR2","doi-asserted-by":"crossref","unstructured":"P. Agarwal and J. Matou\u0161ek. Ray shooting and parametric search. In Proceedings of the 24th Annual ACM Symposium on Theory of Computing, pages 517\u2013526, 1992.","DOI":"10.1145\/129712.129763"},{"key":"50_CR3","doi-asserted-by":"crossref","unstructured":"P. K. Agarwal and M. Sharir. Applications of a new space partitioning technique. In Proceedings of the 1991 Workshop on Algorithms and Data Structures, number 519 in Lecture Notes in Computer Science, pages 379\u2013391. Springer Verlag, 1991.","DOI":"10.1007\/BFb0028277"},{"key":"50_CR4","doi-asserted-by":"crossref","first-page":"643","DOI":"10.1109\/TC.1979.1675432","volume":"C-28","author":"J. Bentley","year":"1979","unstructured":"J. Bentley and T. Ottman. Algorithms for reporting and counting geometric intersections. IEEE Trans. on Computers, C-28:643\u2013647, 1979.","journal-title":"IEEE Trans. on Computers"},{"key":"50_CR5","doi-asserted-by":"crossref","unstructured":"M. Bern. Hidden surface removal for rectangles. In Proceedings of the 4th ACM Symposium on Computational Geometry, pages 183\u2013192, 1988.","DOI":"10.1145\/73393.73412"},{"key":"50_CR6","unstructured":"M. Bern, D. Dobkin, D. Eppstein, and R. Grossman. Visibility with a moving point. In Proceedings of the 1st ACM-SIAM Symposium on Discrete Algorithms, pages 107\u2013117, 1990."},{"key":"50_CR7","unstructured":"B. Chazelle, H. Edelsbrunner, L. Guibas, R. Pollack, R. Seidel, M. Sharir, and J. Snoeyink. Counting and cutting circles of lines and rods in space. In Proceedings of the 31st Annual Symposium on Foundations of Computer Science, 1990."},{"key":"50_CR8","doi-asserted-by":"crossref","unstructured":"B. Chazelle, M. Sharir, and E. Welzl. Quasioptimal upper bounds for simplex range searching and new zone theorems. In Proceedings of the 6th ACM Symposium on Computational Geometry, pages 23\u201333, 1990.","DOI":"10.1145\/98524.98532"},{"key":"50_CR9","doi-asserted-by":"crossref","first-page":"119","DOI":"10.1016\/0925-7721(92)90004-C","volume":"2","author":"M. Berg de","year":"1992","unstructured":"M. de Berg. Dynamic output-sensitive hidden surface removal for c-oriented polyhedra. Computational Geometry: Theory and Applications, 2:119\u2013140, 1992.","journal-title":"Computational Geometry: Theory and Applications"},{"key":"50_CR10","unstructured":"M. de Berg. Efficient Algorithms for rayshooting and hidden surface removal. PhD thesis, Utrecht University, Dept. of Comp. Sci., 1992."},{"key":"50_CR11","doi-asserted-by":"crossref","unstructured":"M. de Berg, D. Halperlin, M. Overmars, J. Snoeyink, and M. van Kreveld. Efficient ray-shooting and hidden surface removal. In Proceedings of the 7th ACM Symposium on Computational Geometry, pages 21\u201330, 1991.","DOI":"10.1145\/109648.109651"},{"key":"50_CR12","unstructured":"M. de Berg, D. Halperlin, M. Overmars, and M. van Kreveld. Sparse arrangements and the number of views of polyhedral scenes. Manuscript, June 1992."},{"key":"50_CR13","doi-asserted-by":"crossref","unstructured":"M. de Berg and M. Overmars. Hidden surface removal foraxisparallel polyhedra. In Proceedings of the 31st IEEE Symposium on Foundations of Computer Science, pages 252\u2013261, 1990.","DOI":"10.1109\/FSCS.1990.89544"},{"key":"50_CR14","doi-asserted-by":"crossref","unstructured":"M. de Berg, M. Overmars, and O. Schwarzkopf. Computing and verifying depth orders. In Proceedings of the 8th ACM Symposium on Computational Geometry, pages 138\u2013145, 1992.","DOI":"10.1145\/142675.142708"},{"key":"50_CR15","doi-asserted-by":"crossref","first-page":"542","DOI":"10.1109\/34.87341","volume":"13","author":"Z. Gigus","year":"1991","unstructured":"Z. Gigus, J. Canny, and R. Seidel. Efficiently computing and representing aspect graphs of polyhedral objects. IEEE Transactions on pattern Analysis and Machine Intelligence, 13:542\u2013551, 1991.","journal-title":"IEEE Transactions on pattern Analysis and Machine Intelligence"},{"key":"50_CR16","doi-asserted-by":"crossref","first-page":"113","DOI":"10.1109\/34.44399","volume":"12","author":"Z. Gigus","year":"1990","unstructured":"Z. Gigus and J. Malik. Computing the aspect graphs for line drawings of of polyhedral objects. IEEE Transactions on pattern Analysis and Machine Intelligence, 12:113\u2013122, 1990.","journal-title":"IEEE Transactions on pattern Analysis and Machine Intelligence"},{"key":"50_CR17","doi-asserted-by":"crossref","unstructured":"M. Katz, M. Overmars, and M. Sharir. Efficient hidden surface removal for objects with small union size. In Proceedings of the 7th ACM Symposium on Computational Geometry, pages 31\u201340, 1991.","DOI":"10.1145\/109648.109652"},{"key":"50_CR18","doi-asserted-by":"crossref","first-page":"51","DOI":"10.1007\/BF00365595","volume":"24","author":"J. Koenderlink","year":"1976","unstructured":"J. Koenderlink and J. van Doom. The singularities of visual mapping. Biological Cybernetics, 24:51\u201359, 1976.","journal-title":"Biological Cybernetics"},{"key":"50_CR19","doi-asserted-by":"crossref","first-page":"211","DOI":"10.1007\/BF00337644","volume":"32","author":"J. Koenderlink","year":"1979","unstructured":"J. Koenderlink and J. van Doom. The internal representation of solid shape with respect to vision. Biological Cybernetics, 32:211\u2013216, 1979.","journal-title":"Biological Cybernetics"},{"key":"50_CR20","doi-asserted-by":"crossref","unstructured":"J. Matou\u0161ek. Efficient partition trees. In Proceedings of the 7th ACM Symposium on Computational Geometry, pages 1\u20139, 1991.","DOI":"10.1145\/109648.109649"},{"key":"50_CR21","doi-asserted-by":"crossref","first-page":"852","DOI":"10.1145\/2157.322410","volume":"30","author":"N. Megiddo","year":"1983","unstructured":"N. Megiddo. Applying parallel computation algorithms in the design of sequential algorithms. J. of ACM, 30:852\u2013865, 1983.","journal-title":"J. of ACM"},{"key":"50_CR22","doi-asserted-by":"crossref","unstructured":"K. Mulmuley. Hidden surface removal with respect to a moving view point. In Proceedings of the 23th Annual ACM Symposium on Theory of Computing, pages 512\u2013522, 1991.","DOI":"10.1145\/103418.103471"},{"key":"50_CR23","doi-asserted-by":"crossref","unstructured":"M. Overmars and M. Sharir. Output-sensitive hidden surface removal. In Proceedings of the 30th IEEE Symposium on Foundations of Computer Science, pages 598\u2013603, 1989.","DOI":"10.1109\/SFCS.1989.63541"},{"key":"50_CR24","unstructured":"M. Pellegrini. On collision-free placements of simplices and the closest pair of lines in 3-space. To appear in SIAM J. on Computing. Preliminary version in the 8th ACM Symp. on Comp. Geom. with the title\u2019 Incidence and nearest-neighbor problems for lines in 3-space\u2019 pp. 130\u2013137, 1992."},{"key":"50_CR25","doi-asserted-by":"crossref","first-page":"471","DOI":"10.1007\/BF01187036","volume":"9","author":"M. Pellegrini","year":"1993","unstructured":"M. Pellegrini. Ray shooting on triangles in 3-space. Algorithmica, 9:471\u2013494, 1993.","journal-title":"Algorithmica"},{"key":"50_CR26","doi-asserted-by":"crossref","unstructured":"W. Plantiga and C. Dyer. An algorithm for constructing the aspect graph. In Proceedings of the 27th IEEE Symposium on Foundations of Computer Science, pages 123\u2013131, 1986.","DOI":"10.1109\/SFCS.1986.4"},{"key":"50_CR27","doi-asserted-by":"crossref","first-page":"137","DOI":"10.1007\/BF00054919","volume":"5","author":"W. Plantiga","year":"1990","unstructured":"W. Plantiga and C. Dyer. Visibility, occlusion and the aspect graph. Int. J. of Computer Vision, 5:137\u2013160, 1990.","journal-title":"Int. J. of Computer Vision"},{"key":"50_CR28","doi-asserted-by":"crossref","unstructured":"F. Preparata, J. Vitter, and M. Yvinec. Output sensitive generation of the perspective view of isothetic parallelepipeds. In Proceedings of the 2nd Scandinavian Workshop on Algorithm Theory, number 447 in Lecture Notes in Computer Science, pages 71\u201384. Springer Verlag, 1990.","DOI":"10.1007\/3-540-52846-6_79"},{"key":"50_CR29","doi-asserted-by":"crossref","unstructured":"J. Reif and S. Sen. An efficient output-sensitive hidden-surface removal algorithm and its parallelization. In Proceedings of the 4th ACM Symposium on Computational Geometry, pages 193\u2013200, 1988.","DOI":"10.1145\/73393.73413"},{"key":"50_CR30","first-page":"27","volume":"2","author":"J. Snoeyink","year":"1991","unstructured":"J. Snoeyink. The number of views of axisparallel objects. Algorithmic Review, 2:27\u201332, 1991.","journal-title":"Algorithmic Review"},{"issue":"1","key":"50_CR31","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/356625.356626","volume":"6","author":"I. Sutherland","year":"1974","unstructured":"I. Sutherland, R. Sproul, and R. Schumaker. A characterization of ten hidden-surface algorithms. Computing Surveys, 6(1):1\u201355, 1974.","journal-title":"Computing Surveys"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Data Structures"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-57155-8_278.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,21]],"date-time":"2025-03-21T22:00:07Z","timestamp":1742594407000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-57155-8_278"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993]]},"ISBN":["9783540571551","9783540479185"],"references-count":31,"URL":"https:\/\/doi.org\/10.1007\/3-540-57155-8_278","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1993]]}}}