{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,4]],"date-time":"2022-04-04T16:21:06Z","timestamp":1649089266848},"reference-count":16,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[1983,9,1]],"date-time":"1983-09-01T00:00:00Z","timestamp":431222400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Computing"],"published-print":{"date-parts":[[1983,9]]},"DOI":"10.1007\/bf02263430","type":"journal-article","created":{"date-parts":[[2005,12,8]],"date-time":"2005-12-08T17:38:23Z","timestamp":1134063503000},"page":"191-202","source":"Crossref","is-referenced-by-count":17,"title":["Applications of a two-dimensional hidden-line algorithm to other geometric problems"],"prefix":"10.1007","volume":"31","author":[{"given":"H.","family":"ElGindy","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"D.","family":"Avis","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"G.","family":"Toussaint","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"BF02263430_CR1","doi-asserted-by":"crossref","first-page":"910","DOI":"10.1109\/TC.1981.1675729","volume":"30","author":"D. Avis","year":"1981","unstructured":"(AT) Avis, D., Toussaint, G. T.: An optimal algorithm for determining the visibility of a polygon from an edge. IEEE Trans. on ComputersC-30, 910\u2013914 (1981).","journal-title":"IEEE Trans. on Computers C"},{"key":"BF02263430_CR2","unstructured":"(BE) Bhattacharya, B. K., ElGindy, H.: A new linear convex hull algorithm for simple polygons. School of Computer Science, McGill University, March 1981."},{"key":"BF02263430_CR3","unstructured":"(E) ElGindy, H.: Visibility in polygons with applications. Master thesis, McGill University, 1981."},{"key":"BF02263430_CR4","doi-asserted-by":"crossref","first-page":"186","DOI":"10.1016\/0196-6774(81)90019-5","volume":"2","author":"H. ElGindy","year":"1981","unstructured":"(EA) ElGindy, H., Avis, D.: An algorithm for computing the visibility polygon from a point. Journal of Algorithms2, 186\u2013197 (1981).","journal-title":"Journal of Algorithms"},{"key":"BF02263430_CR5","doi-asserted-by":"crossref","first-page":"175","DOI":"10.1016\/0020-0190(78)90062-5","volume":"7","author":"M. Garey","year":"1978","unstructured":"(G) Garey, M., et al.: Triangulating a simple polygon. Infor. Proc. Lett.7, 175\u2013179 (1978).","journal-title":"Infor. Proc. Lett."},{"key":"BF02263430_CR6","doi-asserted-by":"crossref","first-page":"132","DOI":"10.1016\/0020-0190(72)90045-2","volume":"1","author":"R. Graham","year":"1972","unstructured":"(GR) Graham, R.: An efficient algorithm for determining the convex hull of a planar set. Infor. Proc. Lett.1, 132\u2013133 (1972).","journal-title":"Infor. Proc. Lett."},{"key":"BF02263430_CR7","doi-asserted-by":"crossref","first-page":"131","DOI":"10.1215\/S0012-7094-49-01613-0","volume":"16","author":"A. Horn","year":"1949","unstructured":"(HV) Horn, A., Valentine, F. A.: Some properties ofL-sets in the plane. Duke Mathematics J.16, 131\u2013140 (1949).","journal-title":"Duke Mathematics J."},{"key":"BF02263430_CR8","unstructured":"(L) Lee, D. T.: On finding the convex hull of a simple polygon. Tech. Report No. 80-03-FC-01, Dept. Elec. Engr. and Computer Science, Northwestern University, 1980."},{"key":"BF02263430_CR9","doi-asserted-by":"crossref","first-page":"415","DOI":"10.1145\/322139.322142","volume":"26","author":"D. T. Lee","year":"1979","unstructured":"(LP) Lee, D. T., Preparata, F. P.: An optimal algorithm for finding the kernel of a polygon. Journal of ACM26, 415\u2013421 (1979).","journal-title":"Journal of ACM"},{"key":"BF02263430_CR10","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1016\/0020-0190(79)90069-3","volume":"9","author":"D. McCallum","year":"1979","unstructured":"(MA) McCallum, D., Avis, D.: A linear algorithm for finding the convex hull of a simple polygon. Infor. Proc. Lett.9, 201\u2013206 (1979).","journal-title":"Infor. Proc. Lett."},{"key":"BF02263430_CR11","doi-asserted-by":"crossref","first-page":"1355","DOI":"10.1109\/T-C.1972.223507","volume":"21","author":"J. Sklansky","year":"1972","unstructured":"(S1) Sklansky, J.: Measuring concavities on a rectangular mosaic. IEEE Trans. on ComputersC-21 1355\u20131364 (1972).","journal-title":"IEEE Trans. on Computers C"},{"key":"BF02263430_CR12","doi-asserted-by":"crossref","first-page":"79","DOI":"10.1016\/0167-8655(82)90016-2","volume":"1","author":"J. Sklansky","year":"1982","unstructured":"(S2) Sklansky, J.: Finding the convex hull of a simple polygon. Pattern Recognition Letters1, 79\u201383 (1982).","journal-title":"Pattern Recognition Letters"},{"key":"BF02263430_CR13","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1016\/0031-3203(82)90057-7","volume":"15","author":"G. T. Toussaint","year":"1982","unstructured":"(TA) Toussaint, G. T., Avis, D.: On a convex hull algorithm for polygons and its application to triangulation problems. Pattern Recognition15, 23\u201329 (1982).","journal-title":"Pattern Recognition"},{"key":"BF02263430_CR14","doi-asserted-by":"crossref","unstructured":"(TE) Toussaint, G. T., ElGindy, H.: A counterexample to an algorithm for computing monotone hulls of simple polygons. Tech. Rept. SOCS 83.1, January 1983, School of Computer Science, McGill University.","DOI":"10.1016\/0167-8655(83)90028-4"},{"key":"BF02263430_CR15","unstructured":"(T1) Toussaint, G. T.: Pattern recognition and geometrical complexity. Proc. 5th International Conf. on Pattern Recognition, Miami Beach, December 1980, pp. 1324\u20131347."},{"key":"BF02263430_CR16","doi-asserted-by":"crossref","unstructured":"(T2) Toussaint, G. T.: Computational geometric problems in pattern recognition. In: Pattern recognition theory and applications (Kittler, J., ed.) NATO ASI, Oxford University, April 1981.","DOI":"10.1007\/978-94-009-7772-3_7"}],"container-title":["Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02263430.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF02263430\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02263430","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,11]],"date-time":"2020-04-11T12:18:33Z","timestamp":1586607513000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF02263430"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1983,9]]},"references-count":16,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1983,9]]}},"alternative-id":["BF02263430"],"URL":"https:\/\/doi.org\/10.1007\/bf02263430","relation":{},"ISSN":["0010-485X","1436-5057"],"issn-type":[{"value":"0010-485X","type":"print"},{"value":"1436-5057","type":"electronic"}],"subject":[],"published":{"date-parts":[[1983,9]]}}}