{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,1]],"date-time":"2022-04-01T13:27:04Z","timestamp":1648819624462},"reference-count":15,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[1986,1,1]],"date-time":"1986-01-01T00:00:00Z","timestamp":504921600000},"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":[[1986,1]]},"DOI":"10.1007\/bf01890987","type":"journal-article","created":{"date-parts":[[2005,7,5]],"date-time":"2005-07-05T14:23:06Z","timestamp":1120573386000},"page":"44-53","source":"Crossref","is-referenced-by-count":4,"title":["A linear algorithm for eliminating hidden-lines from a polygonal cylinder"],"prefix":"10.1007","volume":"2","author":[{"given":"David","family":"Rappaport","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"BF01890987_CR1","unstructured":"Aho A, Hopcroft J, Ullman J (1974) The Design and Analysis of Computer Algorithms, Addison Wesley"},{"key":"BF01890987_CR2","doi-asserted-by":"crossref","unstructured":"Avis D, Toussaint GT (1981) An Optimal Algorithm for Determining the Visibility of a Polygon from an Edge. IEEE Trans Comp, vol C-30, no 12","DOI":"10.1109\/TC.1981.1675729"},{"key":"BF01890987_CR3","doi-asserted-by":"crossref","first-page":"186","DOI":"10.1016\/0196-6774(81)90019-5","volume":"2","author":"H Gindy nEl","year":"1981","unstructured":"nEl Gindy H, Avis D (1981) A Linear Algorithm for Computing the Visibility Polygon from a Point. J Algorithms 2:186\u2013197","journal-title":"J Algorithms"},{"key":"BF01890987_CR4","doi-asserted-by":"crossref","unstructured":"Franklin WR (1978) 3-D Graphic Display of Discrete Spatial Data by Prism Maps. SIGGRAPH '78 Conference Proceedings","DOI":"10.1145\/800248.807373"},{"key":"BF01890987_CR5","doi-asserted-by":"crossref","first-page":"364","DOI":"10.1016\/S0146-664X(81)80017-2","volume":"15","author":"WR Franklin","year":"1981","unstructured":"Franklin WR (1981) An Exact Hidden Sphere Algorithm that Operates in Linear Time. Comput Graph Image Process 15:364\u2013379","journal-title":"Comput Graph Image Process"},{"key":"BF01890987_CR6","doi-asserted-by":"crossref","first-page":"324","DOI":"10.1016\/0196-6774(83)90013-5","volume":"4","author":"RL Graham","year":"1984","unstructured":"Graham RL, Yao FF (1984) Finding the Convex Hull of a Simple Polygon. J Algorithms 4:324\u2013331","journal-title":"J Algorithms"},{"key":"BF01890987_CR7","volume-title":"Elementary Mathematics From an Advanced Standpoint, Geometry","author":"F Klein","year":"1939","unstructured":"Klein F (1939) Elementary Mathematics From an Advanced Standpoint, Geometry. Dover, New York"},{"key":"BF01890987_CR8","unstructured":"Lee DT (1980) On Finding the Convex Hull of a Simple Polygon. Tech Rep, no. 80-03-FC-01, Northwestern University"},{"key":"BF01890987_CR9","first-page":"3","volume":"19","author":"PP Loutrel","year":"1970","unstructured":"Loutrel PP (1970) A Solution to the Hidden-Line Problem for Computer-Drawn Polyhedra. IEEE Trans Comp, vol C-19 3","journal-title":"IEEE Trans Comp"},{"key":"BF01890987_CR10","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1016\/0020-0190(79)90069-3","volume":"9","author":"D McCallum","year":"1979","unstructured":"McCallum D, Avis D (1979) A Linear Time Algorithm for Finding the Convex Hull of a Simple Polygon. Inf Process Lett, 9:201\u2013207","journal-title":"Inf Process Lett"},{"key":"BF01890987_CR11","series-title":"Comput Sci Tech Rep CS-82-33","volume-title":"A Worst-Case Efficient Algorithm for Hidden-Line Elimination","author":"Th Ottmann","year":"1982","unstructured":"Ottmann Th, Widmayer P, Wood D (1982) A Worst-Case Efficient Algorithm for Hidden-Line Elimination. Comput Sci Tech Rep CS-82-33, University of Waterloo, Waterloo"},{"key":"BF01890987_CR12","doi-asserted-by":"crossref","unstructured":"Preparata FP, Supowit KJ (1981) Testing a Simple Polygon for Monotonicity. Inf Process Lett, vol 12, no 4","DOI":"10.1016\/0020-0190(81)90091-0"},{"key":"BF01890987_CR13","unstructured":"Rappaport D (1982) Visibility in Restricted Classes of Polyhedra. Master's Thesis, McGill University"},{"key":"BF01890987_CR14","doi-asserted-by":"crossref","unstructured":"Sutherland IE, Sproull RF, Schumacker RA (1974) A Characterization of Ten-Hidden Surface-Algorithms. Comput Surv ACM, vol 6, no 1","DOI":"10.1145\/356625.356626"},{"key":"BF01890987_CR15","doi-asserted-by":"crossref","unstructured":"Yao FF (1980) On the Priority Approach to Hidden-Surface Algorithms. Proc 21st Ann Symp Found Comput Sci","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\/BF01890987.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01890987\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01890987","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,8]],"date-time":"2020-04-08T04:32:08Z","timestamp":1586320328000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01890987"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1986,1]]},"references-count":15,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1986,1]]}},"alternative-id":["BF01890987"],"URL":"https:\/\/doi.org\/10.1007\/bf01890987","relation":{},"ISSN":["0178-2789","1432-8726"],"issn-type":[{"value":"0178-2789","type":"print"},{"value":"1432-8726","type":"electronic"}],"subject":[],"published":{"date-parts":[[1986,1]]}}}