{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,14]],"date-time":"2025-10-14T11:14:07Z","timestamp":1760440447977},"reference-count":15,"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\/bf01901192","type":"journal-article","created":{"date-parts":[[2005,7,7]],"date-time":"2005-07-07T11:11:23Z","timestamp":1120734683000},"page":"344-355","source":"Crossref","is-referenced-by-count":15,"title":["Recognizing polygons, or how to spy"],"prefix":"10.1007","volume":"3","author":[{"given":"James A.","family":"Dean","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Andrzej","family":"Lingas","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"J\u00f6rg-R\u00fcdiger","family":"Sack","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"BF01901192_CR1","volume-title":"Structural properties of polygons","author":"JA Dean","year":"1985","unstructured":"Dean JA (1985) Structural properties of polygons. Master's Thesis, Carleton Univ Ottawa, Canada"},{"key":"BF01901192_CR2","unstructured":"Dean JA, Sack J-R (1985) Efficient hidden-line elimination by capturing winding information. Proc 23rd Allerton Conf Commun Control Comput, Monticello, Ill, pp 496\u2013505"},{"issue":"2","key":"BF01901192_CR3","doi-asserted-by":"crossref","first-page":"186","DOI":"10.1016\/0196-6774(81)90019-5","volume":"2","author":"H ElGindy","year":"1981","unstructured":"ElGindy H, Avis D (1981) A linear algorithm for computing the visibility polygon from a point. J Algorithms 2(2):186\u2013197","journal-title":"J Algorithms"},{"key":"BF01901192_CR4","doi-asserted-by":"crossref","first-page":"799","DOI":"10.1137\/0214056","volume":"14","author":"JM Keil","year":"1985","unstructured":"Keil JM (1985) Decompositions of polygons into simpler components. SIAM J Comput 14:799\u2013817","journal-title":"SIAM J Comput"},{"key":"BF01901192_CR5","doi-asserted-by":"crossref","first-page":"207","DOI":"10.1016\/0734-189X(83)90065-8","volume":"22","author":"DT Lee","year":"1983","unstructured":"Lee DT (1983) Visibility of a simple polygon. Comput Vision, Graph Image Proc 22:207\u2013221","journal-title":"Comput Vision, Graph Image Proc"},{"issue":"3","key":"BF01901192_CR6","doi-asserted-by":"crossref","first-page":"415","DOI":"10.1145\/322139.322142","volume":"26","author":"DT Lee","year":"1979","unstructured":"Lee DT, Preparata FP (1979) An optimal algorithm for finding the kernel of a simple polygon. J ACM 26(3):415\u2013421","journal-title":"J ACM"},{"key":"BF01901192_CR7","volume-title":"Principles of interactive computer graphics","author":"W Newman","year":"1978","unstructured":"Newman W, Sproull R (1978) Principles of interactive computer graphics, Mcgraw Hill, New York"},{"key":"BF01901192_CR8","volume-title":"Art Gallery Theorems and Algorithms","author":"J O'Rourke","year":"1987","unstructured":"O'Rourke J (1987) Art Gallery Theorems and Algorithms. Oxford Univ Press, New York Oxford"},{"key":"BF01901192_CR9","doi-asserted-by":"crossref","first-page":"161","DOI":"10.1016\/0020-0190(81)90091-0","volume":"12","author":"FP Preparata","year":"1981","unstructured":"Preparata FP, Supowit KJ (1981) Testing a simple polygon for monotonicity. Inf Proc Lett 12:161\u2013164","journal-title":"Inf Proc Lett"},{"key":"BF01901192_CR10","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4612-1098-6","volume-title":"Computational geometry: an introduction","author":"FP Preparata","year":"1985","unstructured":"Preparata FP, Shamos MI (1985) Computational geometry: an introduction. Springer, Berlin Heidelberg New York Tokyo"},{"key":"BF01901192_CR11","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"310","DOI":"10.1007\/BFb0024019","volume-title":"Translating polygons in the plane. Proc STACS85, Saarbr\u00fccken FRG","author":"J-R Sack","year":"1985","unstructured":"Sack, J-R, Toussaint GT (1985) Translating polygons in the plane. Proc STACS85, Saarbr\u00fccken FRG, Lect Notes Comput Sci 182, Springer, Berlin Heidelberg New York Tokyo, pp 310\u2013321; also (1987) Robotica 5:55\u201363"},{"key":"BF01901192_CR12","doi-asserted-by":"crossref","first-page":"335","DOI":"10.1016\/B978-0-444-87806-9.50018-9","volume-title":"Computational geometry","author":"GT Toussaint","year":"1985","unstructured":"Toussaint GT (1985a) Movable separability of sets. In: Toussaint GT (ed) Computational geometry, North-Holland, Amsterdam New York Oxford, pp 335\u2013376"},{"key":"BF01901192_CR13","series-title":"Tech Rep SOCS-85.27","volume-title":"Shortest path solves translation separability of polygons","author":"GT Toussaint","year":"1985","unstructured":"Toussaint GT (1985b) Shortest path solves translation separability of polygons. Tech Rep SOCS-85.27, School Comput Sci, McGill Univ, Montr\u00e9al, Canada"},{"key":"BF01901192_CR14","series-title":"Tech Rep SOCS-83.9","volume-title":"A new linear algorithm for triangulating monotone polygons","author":"GT Toussaint","year":"1983","unstructured":"Toussaint GT (1983) A new linear algorithm for triangulating monotone polygons. Tech Rep SOCS-83.9, School Comput Sci, McGill Univ, Montr\u00e9al, Canada"},{"issue":"1","key":"BF01901192_CR15","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1016\/0031-3203(82)90057-7","volume":"15","author":"GT Toussaint","year":"1982","unstructured":"Toussaint GT, Avis D (1982) On a convex hull algorithm for polygons and its applications to triangulation. Pattern Recognition 15(1):23\u201329","journal-title":"Pattern Recognition"}],"container-title":["The Visual Computer"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01901192.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01901192\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01901192","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\/BF01901192"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1988,11]]},"references-count":15,"journal-issue":{"issue":"6","published-print":{"date-parts":[[1988,11]]}},"alternative-id":["BF01901192"],"URL":"https:\/\/doi.org\/10.1007\/bf01901192","relation":{},"ISSN":["0178-2789","1432-8726"],"issn-type":[{"value":"0178-2789","type":"print"},{"value":"1432-8726","type":"electronic"}],"subject":[],"published":{"date-parts":[[1988,11]]}}}