{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,14]],"date-time":"2025-10-14T11:14:08Z","timestamp":1760440448458},"reference-count":26,"publisher":"Springer Science and Business Media LLC","issue":"8","license":[{"start":{"date-parts":[[1994,8,1]],"date-time":"1994-08-01T00:00:00Z","timestamp":775699200000},"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":[[1994,8]]},"DOI":"10.1007\/bf01910636","type":"journal-article","created":{"date-parts":[[2005,7,30]],"date-time":"2005-07-30T01:32:55Z","timestamp":1122687175000},"page":"459-473","source":"Crossref","is-referenced-by-count":7,"title":["The Superman problem"],"prefix":"10.1007","volume":"10","author":[{"given":"Naji","family":"Mouawad","sequence":"first","affiliation":[]},{"given":"Thomas","family":"Shermer","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"BF01910636_CR1","doi-asserted-by":"crossref","unstructured":"Asano T, Asano T (1983) Minimum partition of polygonal regions into trapezoids. In: Proceedings of the 24th Annual Symposium on the Foundations of Computer Science, Tucson, pp 233\u2013241","DOI":"10.1109\/SFCS.1983.34"},{"key":"BF01910636_CR2","doi-asserted-by":"crossref","first-page":"910","DOI":"10.1109\/TC.1981.1675729","volume":"30","author":"D Avis","year":"1981","unstructured":"Avis D, Toussaint G (1981) An optimal algorithm for determining the visibility of a polygon from an edge. IEEE Transactions on Computers C-30, pp 910\u2013914","journal-title":"IEEE Transactions on Computers C"},{"key":"BF01910636_CR3","doi-asserted-by":"crossref","unstructured":"Baumgart B (1972) Winged edge polyhedron representation. Stanford Artificial Intelligence, Report No. CS-320","DOI":"10.21236\/AD0755141"},{"key":"BF01910636_CR4","doi-asserted-by":"crossref","first-page":"485","DOI":"10.1007\/BF00147785","volume":"6","author":"B Breen","year":"1977","unstructured":"Breen B (1977) L2 sets which are almost starshaped. Geom Dedic 6: 485\u2013494","journal-title":"Geom Dedic"},{"key":"BF01910636_CR5","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1007\/BF02759731","volume":"2","author":"A Bruckner","year":"1964","unstructured":"Bruckner A, Bruckner J (1964) Generalized convex kernels. Israel J Math 2: 27\u201332","journal-title":"Israel J Math"},{"key":"BF01910636_CR6","unstructured":"Brown KG (1979) Geometric transformations for fast geometric algorithm. PhD Thesis, Department of Computer Science, Carnegie Mellon University"},{"key":"BF01910636_CR7","unstructured":"Chazelle B (1990) Triangulating a simple polygon in linear time. CS-TR-264-90, Princeton Univ"},{"key":"BF01910636_CR8","first-page":"38","volume":"18","author":"V Chv\u00e1tal","year":"1975","unstructured":"Chv\u00e1tal V (1975) A combinatiorial theorem in plane geometry. J Combinat Theor Ser B 18: 38\u201341","journal-title":"J Combinat Theor Ser B"},{"key":"BF01910636_CR9","doi-asserted-by":"crossref","first-page":"344","DOI":"10.1007\/BF01901192","volume":"3","author":"J Dean","year":"1988","unstructured":"Dean, J, Lingas A, Sack J-R (1988) Recognizing polygons, or how to spy. Vis Comput 3: 344\u2013355","journal-title":"Vis Comput"},{"key":"BF01910636_CR10","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: 186\u2013197","journal-title":"J Algorithms"},{"key":"BF01910636_CR11","doi-asserted-by":"crossref","first-page":"153","DOI":"10.1145\/357337.357341","volume":"3","author":"A Fournier","year":"1984","unstructured":"Fournier A, Montuno D (1984) Triangulating simple polygons and equivalent problems. ACM Trans Graphics 3: 153\u2013174","journal-title":"ACM Trans Graphics"},{"key":"BF01910636_CR12","doi-asserted-by":"crossref","first-page":"74","DOI":"10.1145\/282918.282923","volume":"4","author":"L Guibas","year":"1985","unstructured":"Guibas L, Stolfi J (1985) Primitives for the manipulation of general subdivisions and the computations of Voronoi diagrans. ACM Trans on Graphics 4: 74\u2013123","journal-title":"ACM Trans on Graphics"},{"key":"BF01910636_CR13","unstructured":"Hanrahan P (1985) Topological shape models. PhD Thesis, University of Wisconsin-Madison"},{"key":"BF01910636_CR14","doi-asserted-by":"crossref","unstructured":"Hoffman K, Melhorn K, Rosenstiehl P, Tarjan R (1985) Sorting Jordan Sequences in linear time. In: Proc ACM symposium on Computational Geometry, Baltimore, pp 196\u2013199","DOI":"10.1145\/323233.323259"},{"key":"BF01910636_CR15","doi-asserted-by":"crossref","first-page":"131","DOI":"10.1215\/S0012-7094-49-01613-0","volume":"16","author":"A Horn","year":"1979","unstructured":"Horn A, Valentine F (1979) Some properties of L-sets in the plane. Duke Math J 16: 131\u2013140","journal-title":"Duke Math J"},{"key":"BF01910636_CR16","doi-asserted-by":"crossref","first-page":"39","DOI":"10.1007\/BF02771549","volume":"8","author":"D Kay","year":"1970","unstructured":"Kay D, Gnay M (1970) Convexity and a certain propertyP m. Israel J Math 8: 39\u201352.","journal-title":"Israel J Math"},{"key":"BF01910636_CR17","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1016\/0020-0190(84)90033-4","volume":"18","author":"C Lee","year":"1984","unstructured":"Lee C, Lee D (1984) On a circle-cover minimization problem. Inf Process Lett 18: 109\u2013115","journal-title":"Inf Process Lett"},{"key":"BF01910636_CR18","doi-asserted-by":"crossref","unstructured":"Lenhardt W, Pollack R, Sack J-R, Seidel R, Sharir, M, Suri S, Toussaint G, Whitesides S, Yap C (1987) Computing the link center of a simple polygon. In: Proceedings of the 3rd ACM Symposium on computational Geometry, Waterloo, pp 1\u201310","DOI":"10.1145\/41958.41959"},{"key":"BF01910636_CR19","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 algorithm for finding the convex hull of a simple polygon. Inf Process Lett 9: 201\u2013206","journal-title":"Inf Process Lett"},{"key":"BF01910636_CR20","doi-asserted-by":"crossref","unstructured":"Motwani R, Raghunathan A, Saran H (1988) Covering orthogonal polygons with star polygons: the perfect graph approach. In: Proceedings of the 4th Annal ACM Symposium on Computational Geometry, Urbana-Champaign, pp 211\u2013223","DOI":"10.1145\/73393.73415"},{"key":"BF01910636_CR21","volume-title":"Art gallery theorems and algorithms","author":"J O'Rourke","year":"1987","unstructured":"O'Rourke J (1987) Art gallery theorems and algorithms. Oxford University Press, Oxford"},{"key":"BF01910636_CR22","unstructured":"Sack J, Suri S (1986) An optimal algorithm for detecting weak visibility of a polygon. Carleton University TR SCS-TR-114"},{"key":"BF01910636_CR23","unstructured":"Shermer T (1988) Link guarding simple polygons. McGill University TR SOCS-88.12"},{"key":"BF01910636_CR24","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1016\/0734-189X(86)90127-1","volume":"35","author":"S Suri","year":"1986","unstructured":"Suri S (1986) A linear time algorithm for minimum link paths inside a simple polygon. Comput Graphics Vis Image Process 35: 99\u2013110","journal-title":"Comput Graphics Vis Image Process"},{"key":"BF01910636_CR25","doi-asserted-by":"crossref","first-page":"143","DOI":"10.1137\/0217010","volume":"17","author":"R Tarjan","year":"1988","unstructured":"Tarjan R, Wyk C van (1988) AnO (n log logn) algorithm for triangulating simple polygons. SIAM J Comput 17: 143\u2013178","journal-title":"SIAM J Comput"},{"key":"BF01910636_CR26","doi-asserted-by":"crossref","first-page":"917","DOI":"10.1090\/S0002-9939-1953-0058996-7","volume":"4","author":"F Valentine","year":"1953","unstructured":"Valentine F (1953) Minimal sets of Visibility Proceedings of the American Mathematical Soc 4: 917\u2013921","journal-title":"Proceedings of the American Mathematical Soc"}],"container-title":["The Visual Computer"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01910636.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01910636\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01910636","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,10]],"date-time":"2019-05-10T12:35:35Z","timestamp":1557491735000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01910636"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994,8]]},"references-count":26,"journal-issue":{"issue":"8","published-print":{"date-parts":[[1994,8]]}},"alternative-id":["BF01910636"],"URL":"https:\/\/doi.org\/10.1007\/bf01910636","relation":{},"ISSN":["0178-2789","1432-8726"],"issn-type":[{"value":"0178-2789","type":"print"},{"value":"1432-8726","type":"electronic"}],"subject":[],"published":{"date-parts":[[1994,8]]}}}