{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,2]],"date-time":"2022-04-02T08:01:59Z","timestamp":1648886519572},"reference-count":24,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[1994,5,1]],"date-time":"1994-05-01T00:00:00Z","timestamp":767750400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Algorithmica"],"published-print":{"date-parts":[[1994,5]]},"DOI":"10.1007\/bf01293267","type":"journal-article","created":{"date-parts":[[2005,3,24]],"date-time":"2005-03-24T22:05:16Z","timestamp":1111701916000},"page":"469-484","source":"Crossref","is-referenced-by-count":3,"title":["An improved technique for output-sensitive hidden surface removal"],"prefix":"10.1007","volume":"11","author":[{"given":"M. H.","family":"Overmars","sequence":"first","affiliation":[]},{"given":"M.","family":"Sharir","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"CR1","doi-asserted-by":"crossref","first-page":"449","DOI":"10.1007\/BF02187805","volume":"5","author":"P. K. Agarwal","year":"1990","unstructured":"P. K. Agarwal, Partitioning arrangements of lines, I: An efficient deterministic algorithm,Discrete Comput. Geom. 5 (1990), 449?483.","journal-title":"Discrete Comput. Geom."},{"key":"CR2","doi-asserted-by":"crossref","unstructured":"P. K. Agarwal, Ray shooting and other applications of spanning trees with low stabbing number,Proc. 5th ACM Symp. on Computational Geometry, 1989, pp. 315?325.","DOI":"10.1145\/73833.73868"},{"key":"CR3","doi-asserted-by":"crossref","unstructured":"P. K. Agarwal and J. Matousek, Ray shooting and parametric search,Proc. 24th ACM Symp. on Theory of Computing, 1992, pp. 517?526.","DOI":"10.1145\/129712.129763"},{"key":"CR4","doi-asserted-by":"crossref","unstructured":"M. de Berg, D. Halperin, M. H. Overmars, J. Snoeyink, and M. van Kreveld, Efficient ray shooting and hidden surface removal,Algorithmica, 1994, to appear.","DOI":"10.1007\/BF01377182"},{"key":"CR5","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1016\/0022-0000(90)90018-G","volume":"40","author":"M. Bern","year":"1990","unstructured":"M. Bern, Hidden surface removal for rectangles,J. Comput. System Sci. 40 (1990), 49?69.","journal-title":"J. Comput. System Sci."},{"key":"CR6","doi-asserted-by":"crossref","first-page":"551","DOI":"10.1007\/BF02187747","volume":"4","author":"B. Chazelle","year":"1989","unstructured":"B. Chazelle and L. Guibas, Visibility and intersection problems in plane geometry,Discrete Comput. Geom. 4 (1989), 551?581.","journal-title":"Discrete Comput. Geom."},{"key":"CR7","doi-asserted-by":"crossref","unstructured":"F. D\u00e9vai, Quadratic bounds for hidden line elimination,Proc. 2nd ACM Symp. on Computational Geometry, 1986, pp. 269?275.","DOI":"10.1145\/10515.10544"},{"key":"CR8","doi-asserted-by":"crossref","first-page":"348","DOI":"10.1016\/0196-6774(87)90015-0","volume":"8","author":"D. Dobkin","year":"1987","unstructured":"D. Dobkin and H. Edelsbrunner, Space searching for intersecting objects,J. Algorithms 8 (1987), 348?361.","journal-title":"J. Algorithms"},{"key":"CR9","doi-asserted-by":"crossref","first-page":"161","DOI":"10.1007\/BF02187784","volume":"5","author":"H. Edelsbrunner","year":"1990","unstructured":"H. Edelsbrunner, L. Guibas, and M. Sharir, The complexity and construction of many faces in arrangements of lines and of segments,Discrete Comput. Geom. 5 (1990), 161?196.","journal-title":"Discrete Comput. Geom."},{"key":"CR10","unstructured":"M. T. Goodrich, A polygonal approach to hidden line elimination,Proc. 25th Allerton Conf. on Communication, Control, and Computing, 1987, pp. 849?858."},{"key":"CR11","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1006\/inco.1993.1059","volume":"107","author":"M. T. Goodrich","year":"1993","unstructured":"M. T. Goodrich, M. J. Atallah, and M. H. Overmars, Output-sensitive methods for rectilinear hidden surface removal,Inform. and Comput. 107 (1993), 1?24.","journal-title":"Inform. and Comput."},{"key":"CR12","series-title":"Lecture Notes in Computer Science, Vol. 318","doi-asserted-by":"crossref","first-page":"64","DOI":"10.1007\/3-540-19487-8_7","volume-title":"Proc. SWAT 88","author":"L. Guibas","year":"1988","unstructured":"L. Guibas, M. Overmars, and M. Sharir, Intersecting line segments, ray shooting, and other applications of geometric partitioning techniques,Proc. SWAT 88, Lecture Notes in Computer Science, Vol. 318, Springer-Verlag, 1988, Berlin, pp. 64?73."},{"key":"CR13","doi-asserted-by":"crossref","first-page":"188","DOI":"10.1016\/S0734-189X(87)80114-7","volume":"40","author":"R. H. G\u00fcting","year":"1987","unstructured":"R. H. G\u00fcting and T. Ottman, new algorithms for special cases of the hidden line elimination problem,Comput. Vision Graphics Image Process. 40 (1987), 188?204.","journal-title":"Comput. Vision Graphics Image Process."},{"key":"CR14","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1145\/27625.27627","volume":"6","author":"M. McKenna","year":"1987","unstructured":"M. McKenna, Worst-case optimal hidden surface removal,ACM Trans. Graphics 6 (1987), 19?28.","journal-title":"ACM Trans. Graphics"},{"key":"CR15","doi-asserted-by":"crossref","first-page":"379","DOI":"10.1145\/74334.74372","volume":"23","author":"K. Mulmuley","year":"1989","unstructured":"K. Mulmuley, An efficient algorithm for hidden surface removal,Comput. Graphics 23 (1989), 379?388.","journal-title":"Comput. Graphics"},{"key":"CR16","doi-asserted-by":"crossref","first-page":"466","DOI":"10.1007\/BF01935366","volume":"25","author":"O. Nurmi","year":"1985","unstructured":"O. Nurmi, A fast line-sweep algorithm for hidden line elimination,BIT 25 (1985), 466?472.","journal-title":"BIT"},{"key":"CR17","doi-asserted-by":"crossref","unstructured":"M. H. Overmars and M. Sharir, Output-sensitive hidden surface removal,Proc. 30th IEEE Symp. on Foundations of Computer Science, 1989, pp. 598?603.","DOI":"10.1109\/SFCS.1989.63541"},{"key":"CR18","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4612-1098-6","volume-title":"Computational Geometry, an Introduction","author":"F. P. Preparata","year":"1985","unstructured":"F. P. Preparata and M. I. Shamos,Computational Geometry, an Introduction, Springer-Verlag, New York, 1985."},{"key":"CR19","doi-asserted-by":"crossref","first-page":"278","DOI":"10.1145\/78964.78967","volume":"9","author":"F. P. Preparata","year":"1990","unstructured":"F. P. Preparata, J. S. Vitter, and M. Yvinec, Computation of the axial view of a set of isothetic parallelepipeds,ACM Trans. Graphics 9 (1990), 278?300.","journal-title":"ACM Trans. Graphics"},{"key":"CR20","doi-asserted-by":"crossref","unstructured":"J. Reif and S. Sen, An efficient output-sensitive hidden surface removal algorithm and its parallelization,Proc. 4th ACM Symp. on Computational Geometry, 1988, pp. 193?200.","DOI":"10.1145\/73393.73413"},{"key":"CR21","doi-asserted-by":"crossref","first-page":"421","DOI":"10.1007\/BF01933260","volume":"31","author":"H. Schipper","year":"1991","unstructured":"H. Schipper and M. H. Overmars, Dynamic partition trees,BIT 31 (1991), 421?436.","journal-title":"BIT"},{"key":"CR22","first-page":"43","volume":"81","author":"A. Schmitt","year":"1981","unstructured":"A. Schmitt, Time and space bounds for hidden line and hidden surface algorithms,Eurographics '81, 1981, pp. 43?56.","journal-title":"Eurographics"},{"key":"CR23","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/102377.112141","volume":"11","author":"M. Sharir","year":"1992","unstructured":"M. Sharir and M. H. Overmars, A simple output-sensitive algorithm for hidden surface removal,ACM Trans. Graphics 11 (1992), 1?11.","journal-title":"ACM Trans. Graphics"},{"key":"CR24","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/356625.356626","volume":"6","author":"I. E. Sutherland","year":"1974","unstructured":"I. E. Sutherland, R. F. Sproull, and R. A. Schumacker, A characterization of ten hidden-surface algorithms,Comput. Surveys 6 (1974), 1?25.","journal-title":"Comput. Surveys"}],"container-title":["Algorithmica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01293267.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01293267\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01293267","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,2]],"date-time":"2019-05-02T11:15:30Z","timestamp":1556795730000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01293267"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994,5]]},"references-count":24,"journal-issue":{"issue":"5","published-print":{"date-parts":[[1994,5]]}},"alternative-id":["BF01293267"],"URL":"https:\/\/doi.org\/10.1007\/bf01293267","relation":{},"ISSN":["0178-4617","1432-0541"],"issn-type":[{"value":"0178-4617","type":"print"},{"value":"1432-0541","type":"electronic"}],"subject":[],"published":{"date-parts":[[1994,5]]}}}