{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,2]],"date-time":"2022-04-02T22:22:34Z","timestamp":1648938154240},"reference-count":27,"publisher":"Elsevier BV","issue":"5","license":[{"start":{"date-parts":[[1992,5,1]],"date-time":"1992-05-01T00:00:00Z","timestamp":704678400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":7747,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Computational Geometry"],"published-print":{"date-parts":[[1992,5]]},"DOI":"10.1016\/0925-7721(92)90007-f","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T23:41:31Z","timestamp":1027640491000},"page":"247-268","source":"Crossref","is-referenced-by-count":9,"title":["Hidden surface removal for c-oriented polyhedra"],"prefix":"10.1016","volume":"1","author":[{"given":"Mark de","family":"Berg","sequence":"first","affiliation":[]},{"given":"Mark H.","family":"Overmars","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0925-7721(92)90007-F_BIB1","doi-asserted-by":"crossref","first-page":"379","DOI":"10.1007\/BFb0028277","article-title":"Applications of a new space partitioning scheme","author":"Agarwal","year":"1991","journal-title":"Proc. Workshop on Algorithms and Data Structures"},{"key":"10.1016\/0925-7721(92)90007-F_BIB2","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1007\/BF01840436","article-title":"Visibility of disjoint polygons","volume":"1","author":"Asano","year":"1986","journal-title":"Algorithmica"},{"key":"10.1016\/0925-7721(92)90007-F_BIB3","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1016\/0022-0000(90)90018-G","article-title":"Hidden surface removal for rectangles","volume":"40","author":"Bern","year":"1990","journal-title":"J. Comp. Syst. Sci."},{"key":"10.1016\/0925-7721(92)90007-F_BIB4","doi-asserted-by":"crossref","first-page":"220","DOI":"10.1109\/FSCS.1990.89541","article-title":"Triangulating a simple polygon in linear time","author":"Chazelle","year":"1990","journal-title":"Proc. 31st IEEE Symp. on Foundations of Computer Science"},{"key":"10.1016\/0925-7721(92)90007-F_BIB5","doi-asserted-by":"crossref","first-page":"11","DOI":"10.1007\/BF01840440","article-title":"Fractional cascading I: a data structuring technique","volume":"1","author":"Chazelle","year":"1986","journal-title":"Algorithmica"},{"key":"10.1016\/0925-7721(92)90007-F_BIB6","doi-asserted-by":"crossref","first-page":"11","DOI":"10.1016\/S0747-7171(89)80003-3","article-title":"Visibility problems for polyhedral terrains","volume":"7","author":"Cole","year":"1989","journal-title":"J. Symbolic Comput."},{"key":"10.1016\/0925-7721(92)90007-F_BIB7","first-page":"21","article-title":"Efficient ray shooting and hidden surface removal","author":"Berg","year":"1991","journal-title":"Proc. 7th ACM Symp. on Computational Geometry"},{"key":"10.1016\/0925-7721(92)90007-F_BIB8","first-page":"269","article-title":"Quadratic bounds for hidden line elimination","author":"D\u00e9vai","year":"1986","journal-title":"Proc. 2nd ACM Symp. on Computational Geometry"},{"key":"10.1016\/0925-7721(92)90007-F_BIB9","first-page":"135","article-title":"Scaling and related techniques for geometry problems","author":"Gabow","year":"1984","journal-title":"Proc. 16th ACM Symp. on Theory of Computing"},{"key":"10.1016\/0925-7721(92)90007-F_BIB10","first-page":"849","article-title":"A polygonal approach to hidden line elimination","author":"Goodrich","year":"1987","journal-title":"Proc. 25th Allerton Conf. on Communication, Control and Computing"},{"key":"10.1016\/0925-7721(92)90007-F_BIB11","first-page":"689","article-title":"An input-size\/output-size trade-off in the time-complexity of rectilinear hidden surface removal","volume":"443","author":"Goodrich","year":"1990","journal-title":"Proc. 17th Int. Coll. on Automata, Languages and Programming"},{"key":"10.1016\/0925-7721(92)90007-F_BIB12","doi-asserted-by":"crossref","first-page":"35","DOI":"10.1016\/0020-0190(83)90010-8","article-title":"Stabbing c-oriented polygons","volume":"16","author":"G\u00fcting","year":"1983","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/0925-7721(92)90007-F_BIB13","doi-asserted-by":"crossref","first-page":"188","DOI":"10.1016\/S0734-189X(87)80114-7","article-title":"New algorithms for special cases of the hidden line elimination problem","volume":"40","author":"G\u00fcting","year":"1987","journal-title":"Comp. Vision, Graphics and Image Processing"},{"key":"10.1016\/0925-7721(92)90007-F_BIB14","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1145\/27625.27627","article-title":"Worst-case optimal hidden surface removal","volume":"6","author":"McKenna","year":"1987","journal-title":"ACM Trans. Graphics"},{"key":"10.1016\/0925-7721(92)90007-F_BIB15","author":"Mehlhorn","year":"1984"},{"key":"10.1016\/0925-7721(92)90007-F_BIB16","doi-asserted-by":"crossref","first-page":"379","DOI":"10.1145\/74334.74372","article-title":"An efficient algorithm for hidden surface removal, I","volume":"23","author":"Mulmuley","year":"1989","journal-title":"Computer Graphics"},{"key":"10.1016\/0925-7721(92)90007-F_BIB17","doi-asserted-by":"crossref","first-page":"466","DOI":"10.1007\/BF01935366","article-title":"A fast line-sweep algorithm for hidden line elimination","volume":"25","author":"Nurmi","year":"1985","journal-title":"BIT"},{"key":"10.1016\/0925-7721(92)90007-F_BIB18","doi-asserted-by":"crossref","first-page":"598","DOI":"10.1109\/SFCS.1989.63541","article-title":"Output-sensitive hidden surface removal","author":"Overmars","year":"1989","journal-title":"Proc. 30th IEEE Symp. on Foundations of Computer Science"},{"key":"10.1016\/0925-7721(92)90007-F_BIB19","doi-asserted-by":"crossref","DOI":"10.1007\/BF01293267","article-title":"An improved technique for output-sensitive hidden surface removal","author":"Overmars","year":"1989"},{"key":"10.1016\/0925-7721(92)90007-F_BIB20","doi-asserted-by":"crossref","first-page":"278","DOI":"10.1145\/78964.78967","article-title":"Computation of the axial view of a set of isothetic parallelepipeds","volume":"9","author":"Preparata","year":"1990","journal-title":"ACM Trans. on Graphics"},{"key":"10.1016\/0925-7721(92)90007-F_BIB21","first-page":"71","article-title":"Output-sensitive generation of the perspective view of isothetic parallepipeds","volume":"447","author":"Preparata","year":"1990","journal-title":"Proc. 2nd Scandinavian Workshop on Algorithm Theory"},{"key":"10.1016\/0925-7721(92)90007-F_BIB22","author":"Preparata","year":"1985"},{"key":"10.1016\/0925-7721(92)90007-F_BIB23","first-page":"193","article-title":"An efficient output-sensitive hidden surface removal algorithm and its parallelization","author":"Reif","year":"1988","journal-title":"Proc. 4th ACM Symp. on Computational Geometry"},{"key":"10.1016\/0925-7721(92)90007-F_BIB24","unstructured":"A. Schmitt, Time and space bounds for hidden line and hidden surface algorithms, Eurographics '81, 43-56."},{"key":"10.1016\/0925-7721(92)90007-F_BIB25","doi-asserted-by":"crossref","DOI":"10.1145\/102377.112141","article-title":"A simple method for output-sensitive hidden surface removal","author":"Sharir","year":"1992","journal-title":"ACM Trans. on Graphics"},{"key":"10.1016\/0925-7721(92)90007-F_BIB26","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":"Computing Surveys"},{"key":"10.1016\/0925-7721(92)90007-F_BIB27","doi-asserted-by":"crossref","first-page":"597","DOI":"10.1145\/3828.3839","article-title":"Adding range restriction capability to dynamic data structures","volume":"32","author":"Willard","year":"1985","journal-title":"J. ACM"}],"container-title":["Computational Geometry"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:092577219290007F?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:092577219290007F?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,2,5]],"date-time":"2020-02-05T05:56:58Z","timestamp":1580882218000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/092577219290007F"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1992,5]]},"references-count":27,"journal-issue":{"issue":"5","published-print":{"date-parts":[[1992,5]]}},"alternative-id":["092577219290007F"],"URL":"https:\/\/doi.org\/10.1016\/0925-7721(92)90007-f","relation":{},"ISSN":["0925-7721"],"issn-type":[{"value":"0925-7721","type":"print"}],"subject":[],"published":{"date-parts":[[1992,5]]}}}