{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,10,12]],"date-time":"2023-10-12T05:50:02Z","timestamp":1697089802045},"reference-count":21,"publisher":"Elsevier BV","issue":"5","license":[{"start":{"date-parts":[[1996,1,1]],"date-time":"1996-01-01T00:00:00Z","timestamp":820454400000},"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":6407,"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":[[1996,1]]},"DOI":"10.1016\/0925-7721(95)00008-9","type":"journal-article","created":{"date-parts":[[2002,10,16]],"date-time":"2002-10-16T13:46:55Z","timestamp":1034776015000},"page":"249-276","source":"Crossref","is-referenced-by-count":4,"title":["Generalized hidden surface removal"],"prefix":"10.1016","volume":"5","author":[{"given":"Mark","family":"de Berg","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0925-7721(95)00008-9_BIB1","series-title":"Proc. 24th ACM Symp. on Theory of Computing","first-page":"517","article-title":"Ray shooting and parametric search","author":"Agarwal","year":"1992"},{"key":"10.1016\/0925-7721(95)00008-9_BIB2","article-title":"Ray shooting, depth orders and hidden surface removal","volume":"703","author":"de Berg","year":"1993"},{"key":"10.1016\/0925-7721(95)00008-9_BIB3","doi-asserted-by":"crossref","first-page":"30","DOI":"10.1007\/BF01377182","article-title":"Efficient ray shooting and hidden surface removal","volume":"12","author":"de Berg","year":"1994","journal-title":"Algorithmica"},{"key":"10.1016\/0925-7721(95)00008-9_BIB4","doi-asserted-by":"crossref","first-page":"247","DOI":"10.1016\/0925-7721(92)90007-F","article-title":"Hidden surface removal for c-oriented polyhedra","volume":"1","author":"de Berg","year":"1992","journal-title":"Comput. Geom. Theory Appl."},{"key":"10.1016\/0925-7721(95)00008-9_BIB5","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. Sciences"},{"key":"10.1016\/0925-7721(95)00008-9_BIB6","doi-asserted-by":"crossref","first-page":"485","DOI":"10.1007\/BF02574703","article-title":"Triangulating a simple polygon in linear time","volume":"6","author":"Chazelle","year":"1991","journal-title":"Discr. Comp. Geometry"},{"key":"10.1016\/0925-7721(95)00008-9_BIB7","series-title":"Proc. 21st ACM Symp. on Theory of Computing","first-page":"382","article-title":"Lines in space\u2014combinatorics, algorithms and applications","author":"Chazelle","year":"1989"},{"key":"10.1016\/0925-7721(95)00008-9_BIB8","doi-asserted-by":"crossref","first-page":"551","DOI":"10.1007\/BF02187747","article-title":"Visibility and intersection problems in plane geometry","volume":"4","author":"Chazelle","year":"1989","journal-title":"Discr. Comp. Geometry"},{"key":"10.1016\/0925-7721(95)00008-9_BIB9","series-title":"Algorithms in Combinatorial Geometry","author":"Edelsbrunner","year":"1987"},{"key":"10.1016\/0925-7721(95)00008-9_BIB10","series-title":"Proc. 34th IEEE Symp. on Foundations of Computer Science","first-page":"528","article-title":"Better Lower Bounds on Detecting Affine and Spherical Degeneracies","author":"Erickson","year":"1993"},{"key":"10.1016\/0925-7721(95)00008-9_BIB11","doi-asserted-by":"crossref","unstructured":"A. Gajentaan and M.H. Overmars, On a class of O(n2) problems in computational geometry, Comput. Geom. Theory Appl., to appear.","DOI":"10.1016\/0925-7721(95)00022-2"},{"key":"10.1016\/0925-7721(95)00008-9_BIB12","series-title":"Proc. 17th Int. Coll. on Automata, Languages and Programming","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"},{"key":"10.1016\/0925-7721(95)00008-9_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 Image Processing"},{"key":"10.1016\/0925-7721(95)00008-9_BIB14","doi-asserted-by":"crossref","first-page":"209","DOI":"10.1007\/BF01840360","article-title":"Linear-time algorithms for visibility and shortest path problems inside triangulated simple polygons","volume":"2","author":"Guibas","year":"1987","journal-title":"Algorithmica"},{"key":"10.1016\/0925-7721(95)00008-9_BIB15","doi-asserted-by":"crossref","first-page":"151","DOI":"10.1007\/BF02579170","article-title":"Non-linearity of Davenport-Schinzel sequences and of generalized path compression schemes","volume":"6","author":"Hart","year":"1986","journal-title":"Combinatorica"},{"key":"10.1016\/0925-7721(95)00008-9_BIB16","doi-asserted-by":"crossref","first-page":"223","DOI":"10.1016\/0925-7721(92)90024-M","article-title":"Efficient hidden surface removal for objects with small union size","volume":"2","author":"Katz","year":"1992","journal-title":"Comput. Geom. Theory Appl."},{"key":"10.1016\/0925-7721(95)00008-9_BIB17","series-title":"Theoretical Foundations of Computer Science and CAD","first-page":"307","article-title":"Reporting and counting intersections between two sets of line segments","volume":"Vol. F-40","author":"Mairson","year":"1988"},{"key":"10.1016\/0925-7721(95)00008-9_BIB18","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(95)00008-9_BIB19","unstructured":"M.H. Overmars, personal communication."},{"key":"10.1016\/0925-7721(95)00008-9_BIB20","doi-asserted-by":"crossref","first-page":"1034","DOI":"10.1137\/0220065","article-title":"New upper bounds in Klee's measure problem","volume":"20","author":"Overmars","year":"1991","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0925-7721(95)00008-9_BIB21","series-title":"Proc. 4th ACM Symp. on Computational Geometry","first-page":"193","article-title":"An efficient output-sensitive hidden surface removal algorithm and its parallelization","author":"Reif","year":"1988"}],"container-title":["Computational Geometry"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0925772195000089?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0925772195000089?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,8]],"date-time":"2019-04-08T08:21:29Z","timestamp":1554711689000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0925772195000089"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996,1]]},"references-count":21,"journal-issue":{"issue":"5","published-print":{"date-parts":[[1996,1]]}},"alternative-id":["0925772195000089"],"URL":"https:\/\/doi.org\/10.1016\/0925-7721(95)00008-9","relation":{},"ISSN":["0925-7721"],"issn-type":[{"value":"0925-7721","type":"print"}],"subject":[],"published":{"date-parts":[[1996,1]]}}}