{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,5]],"date-time":"2022-04-05T11:09:41Z","timestamp":1649156981814},"reference-count":18,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[1988,11,1]],"date-time":"1988-11-01T00:00:00Z","timestamp":594345600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["The Visual Computer"],"published-print":{"date-parts":[[1988,11]]},"DOI":"10.1007\/bf01901191","type":"journal-article","created":{"date-parts":[[2005,7,7]],"date-time":"2005-07-07T11:11:23Z","timestamp":1120734683000},"page":"329-343","source":"Crossref","is-referenced-by-count":1,"title":["Hidden-surface removal in polyhedral cross-sections"],"prefix":"10.1007","volume":"3","author":[{"given":"Peter","family":"Egyed","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"BF01901191_CR1","first-page":"88","volume-title":"Data structures and algorithms","author":"AV Aho","year":"1983","unstructured":"Aho AV, Hopcroft JH, Ullmann JD (1983) Data structures and algorithms. Addison-Wesley, Reading, pp 88\u201393"},{"key":"BF01901191_CR2","doi-asserted-by":"crossref","unstructured":"Chazelle B (1982) A theorem on polygon cutting with applications. Proc 23rd Ann IEEE Symp Foundat Comput Sci, pp 339\u2013349","DOI":"10.1109\/SFCS.1982.58"},{"key":"BF01901191_CR3","unstructured":"Chazelle B, Incerpi J (1983) Triangulating a polygon by divide-and-comquer. Proc 21st Ann Allerton Conf Commun Control Comput, pp 447\u2013456"},{"key":"BF01901191_CR4","doi-asserted-by":"crossref","unstructured":"Devai F (1986) Quadratic bounds for hidden-line elimination. Proc ACM Symp Comput Geom, pp 269\u2013275","DOI":"10.1145\/10515.10544"},{"key":"BF01901191_CR5","doi-asserted-by":"crossref","first-page":"175","DOI":"10.1016\/0020-0190(78)90062-5","volume":"7","author":"MR Garey","year":"1978","unstructured":"Garey MR, Johnson DS, Preparata FP, Tarjan RE (1978) Triangulating a simple polygon. Inf Proc Lett 7:175\u2013179","journal-title":"Inf Proc Lett"},{"key":"BF01901191_CR6","doi-asserted-by":"crossref","unstructured":"Guibas LJ, Yao FF (1980) On translating a set of rectangles. Proc 12th Ann ACM Symp Theor Comput, pp 154\u2013157","DOI":"10.1145\/800141.804663"},{"key":"BF01901191_CR7","unstructured":"Guting RH, Ottmann T (1984) New algorithms for special cases of the hidden-line elimination problem. Tech Rep 184, Univ Dortmund"},{"key":"BF01901191_CR8","doi-asserted-by":"crossref","unstructured":"Hertel S, Mehlhorn K (1983) Fast triangulation of simple polygons. Proc Conf Foundat Comput Theor, pp 207\u2013218","DOI":"10.1007\/3-540-12689-9_105"},{"issue":"1","key":"BF01901191_CR9","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1145\/27625.27627","volume":"6","author":"M McKenna","year":"1987","unstructured":"McKenna M (1987) Worst-case optimal hidden-surface removal. ACM Trans Graph 6(1):19\u201328","journal-title":"ACM Trans Graph"},{"issue":"2","key":"BF01901191_CR10","doi-asserted-by":"crossref","first-page":"217","DOI":"10.1016\/0304-3975(78)90051-8","volume":"7","author":"DE Muller","year":"1978","unstructured":"Muller DE, Preparata FP (1978) Finding the intersection of two convex polyhedra. Theor Comput Sci 7(2):217\u2013236","journal-title":"Theor Comput Sci"},{"issue":"3","key":"BF01901191_CR11","doi-asserted-by":"crossref","first-page":"466","DOI":"10.1007\/BF01935366","volume":"25","author":"O Nurmi","year":"1985","unstructured":"Nurmi O (1985) A fast line-sweep algorithm for hidden-line elimination. BIT 25(3):466\u2013472","journal-title":"BIT"},{"issue":"3","key":"BF01901191_CR12","doi-asserted-by":"crossref","first-page":"382","DOI":"10.1016\/0734-189X(83)90062-2","volume":"24","author":"T Ottmann","year":"1983","unstructured":"Ottmann T, Widmayer P (1983) On translating a set of line segments. Comput Vision Graph Image Process 24(3):382\u2013389","journal-title":"Comput Vision Graph Image Process"},{"issue":"2","key":"BF01901191_CR13","doi-asserted-by":"crossref","first-page":"93","DOI":"10.1080\/00207168508803482","volume":"18","author":"T Ottmann","year":"1985","unstructured":"Ottmann T, Widmayer P, Wood D (1985) A worst-case efficient algorithm for hidden-line elimination. Int J Comput Math 18(2):93\u2013119","journal-title":"Int J Comput Math"},{"key":"BF01901191_CR14","doi-asserted-by":"crossref","first-page":"44","DOI":"10.1007\/BF01890987","volume":"2","author":"D Rappaport","year":"1986","unstructured":"Rappaport D (1986) A linear algorithm for eliminating hidden lines from a polygonal cylinder. The Visual Computer 2:44\u201353","journal-title":"The Visual Computer"},{"key":"BF01901191_CR15","unstructured":"Schmitt A (1981) Time and space bounds for hidden-line and hidden-surface algorithms. Proc Eurographics '81, pp 43\u201356"},{"key":"BF01901191_CR16","doi-asserted-by":"crossref","unstructured":"Shamos MI, Hoey D (1976) Geometric intersection problems. Proc 17th Ann IEEE Symp Foundat Comput Sci, pp 208\u2013215","DOI":"10.1109\/SFCS.1976.16"},{"key":"BF01901191_CR17","unstructured":"Shamos MI (1977) Computational Geometry. PhD Thesis, Yale Univ"},{"key":"BF01901191_CR18","doi-asserted-by":"crossref","unstructured":"Yao FF (1980) On the priority approach to hidden-surface algorithms. Proc 21st Ann IEEE Symp Foundat Comput Sci, pp 301\u2013307","DOI":"10.1109\/SFCS.1980.32"}],"container-title":["The Visual Computer"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01901191.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01901191\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01901191","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,10]],"date-time":"2019-05-10T16:14:41Z","timestamp":1557504881000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01901191"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1988,11]]},"references-count":18,"journal-issue":{"issue":"6","published-print":{"date-parts":[[1988,11]]}},"alternative-id":["BF01901191"],"URL":"https:\/\/doi.org\/10.1007\/bf01901191","relation":{},"ISSN":["0178-2789","1432-8726"],"issn-type":[{"value":"0178-2789","type":"print"},{"value":"1432-8726","type":"electronic"}],"subject":[],"published":{"date-parts":[[1988,11]]}}}