{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,1]],"date-time":"2026-02-01T21:03:44Z","timestamp":1769979824818,"version":"3.49.0"},"reference-count":27,"publisher":"Elsevier BV","issue":"4","license":[{"start":{"date-parts":[[1993,9,1]],"date-time":"1993-09-01T00:00:00Z","timestamp":746841600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":7259,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Computational Geometry"],"published-print":{"date-parts":[[1993,9]]},"DOI":"10.1016\/0925-7721(93)90010-4","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T03:41:31Z","timestamp":1027654891000},"page":"213-233","source":"Crossref","is-referenced-by-count":20,"title":["Characterizing and recognizing weak visibility polygons"],"prefix":"10.1016","volume":"3","author":[{"given":"Subir Kumar","family":"Ghosh","sequence":"first","affiliation":[]},{"given":"Anil","family":"Maheshwari","sequence":"additional","affiliation":[]},{"given":"Sudebkumar Prasant","family":"Pal","sequence":"additional","affiliation":[]},{"given":"Sanjeev","family":"Saluja","sequence":"additional","affiliation":[]},{"given":"C.E.","family":"Veni Madhavan","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0925-7721(93)90010-4_BIB1","doi-asserted-by":"crossref","first-page":"148","DOI":"10.1109\/TIT.1983.1056600","article-title":"A combinatorial approach to polygon similarity","volume":"29","author":"Avis","year":"1983","journal-title":"IEEE Trans. Inform. Theory"},{"key":"10.1016\/0925-7721(93)90010-4_BIB2","doi-asserted-by":"crossref","first-page":"910","DOI":"10.1109\/TC.1981.1675729","article-title":"An optimal algorithm for determining the visibility of a polygon from an edge","volume":"30","author":"Avis","year":"1981","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/0925-7721(93)90010-4_BIB3","doi-asserted-by":"crossref","first-page":"416","DOI":"10.1016\/0010-4485(88)90218-7","article-title":"Boundary evaluation and direct display of CSG models","volume":"20","author":"Bronsvoort","year":"1988","journal-title":"Computer-Aided Design"},{"key":"10.1016\/0925-7721(93)90010-4_BIB4","doi-asserted-by":"crossref","first-page":"135","DOI":"10.1145\/357337.357340","article-title":"Triangulation and shape-complexity","volume":"3","author":"Chazelle","year":"1984","journal-title":"ACM Trans. Graph."},{"key":"10.1016\/0925-7721(93)90010-4_BIB5","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1016\/0146-664X(79)90076-5","article-title":"Computational Models of space: isovists and isovist fields","volume":"11","author":"David","year":"1979","journal-title":"Comput. Graph. Image Process."},{"key":"10.1016\/0925-7721(93)90010-4_BIB6","doi-asserted-by":"crossref","first-page":"38","DOI":"10.1016\/0010-4485(89)90115-2","article-title":"Hybrid shadow testing scheme for any tracing","volume":"21","author":"Eo","year":"1989","journal-title":"Computer-Aided Design"},{"key":"10.1016\/0925-7721(93)90010-4_BIB7","series-title":"Ph.D. Thesis","article-title":"Visibility graph recognition","author":"Everett","year":"1989"},{"key":"10.1016\/0925-7721(93)90010-4_BIB8","doi-asserted-by":"crossref","first-page":"75","DOI":"10.1016\/0196-6774(91)90024-S","article-title":"Computing the visibility polygon from a convex set and related problems","volume":"12","author":"Ghosh","year":"1991","journal-title":"J. Algorithms"},{"key":"10.1016\/0925-7721(93)90010-4_BIB9","first-page":"369","article-title":"Lecture Notes in Comput. Sci.","volume":"Vol. 560","author":"Ghosh","year":"1991"},{"key":"10.1016\/0925-7721(93)90010-4_BIB10","first-page":"246","article-title":"An algorithm for recognizing palm polygons","author":"Ghosh","year":"1990","journal-title":"Proceedings of the Second Canadian Conference in Computational Geometry"},{"key":"10.1016\/0925-7721(93)90010-4_BIB11","doi-asserted-by":"crossref","first-page":"209","DOI":"10.1007\/BF01840360","article-title":"Linear time algorithms for visibility and shortest path problems inside triangulated simple polygons","volume":"2","author":"Guibas","year":"1987","journal-title":"Algorithmica"},{"key":"10.1016\/0925-7721(93)90010-4_BIB12","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1007\/BF01553883","article-title":"An optimal visibility graph algorithm for triangulated simple polygons","volume":"4","author":"Hershberger","year":"1989","journal-title":"Algorithmica"},{"key":"10.1016\/0925-7721(93)90010-4_BIB13","series-title":"Technical Report JHU-88\/17","article-title":"Detecting the weak visibility of a simple polygon and related problems","author":"Ke","year":"1988"},{"key":"10.1016\/0925-7721(93)90010-4_BIB14","first-page":"1916","article-title":"Efficient representation of reflecting structures for a sonar navigation model","author":"Kuc","year":"1987","journal-title":"Proceeding of IEEE International Conference on Robotics and Automation"},{"key":"10.1016\/0925-7721(93)90010-4_BIB15","doi-asserted-by":"crossref","first-page":"560","DOI":"10.1145\/359156.359164","article-title":"An optimal for planning collision-free paths among polyhedral obstacles","volume":"22","author":"Lozano-Perez","year":"1979","journal-title":"Communications of the ACM"},{"key":"10.1016\/0925-7721(93)90010-4_BIB16","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1145\/27625.27627","article-title":"Worst-case optimal hidden-surface removals","volume":"6","author":"McKenna","year":"1987","journal-title":"ACM Trans. Graph."},{"key":"10.1016\/0925-7721(93)90010-4_BIB17","series-title":"Geometric Reasoning","article-title":"An algorithmic approach to some problems in terrain navigation","author":"Mitchell","year":"1988"},{"key":"10.1016\/0925-7721(93)90010-4_BIB18","first-page":"312","article-title":"An optimal algorithm for detecting weak visibility of a polygon","author":"Sack","year":"1988","journal-title":"Proceedings of the 5th Symposium on Theoretical Aspects of Computer Science"},{"key":"10.1016\/0925-7721(93)90010-4_BIB19","series-title":"Ph.D. Thesis","article-title":"Weak visibility and related problems on simple polygons","author":"Pal","year":"1990"},{"key":"10.1016\/0925-7721(93)90010-4_BIB20","doi-asserted-by":"crossref","first-page":"497","DOI":"10.1016\/0010-4485(89)90057-2","article-title":"SR: a PC-based CAD system for shadow and reflection studies in the built environment","volume":"21","author":"Roy","year":"1989","journal-title":"Computer-Aided Design"},{"key":"10.1016\/0925-7721(93)90010-4_BIB21","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1007\/BF02239742","article-title":"Hiding people in polygons","volume":"42","author":"Shermer","year":"1989","journal-title":"Computing"},{"key":"10.1016\/0925-7721(93)90010-4_BIB22","doi-asserted-by":"crossref","first-page":"202","DOI":"10.1109\/70.88040","article-title":"An optimal algorithm for finding all visible edges in a simple polygon","volume":"5","author":"Shin","year":"1989","journal-title":"IEEE Trans. Robot. and Automat."},{"key":"10.1016\/0925-7721(93)90010-4_BIB23","first-page":"615","article-title":"Building wire frames for multiple range views","author":"Stenstrom","year":"1988","journal-title":"Proceedings of IEEE International Conference on Robotics and Automation"},{"key":"10.1016\/0925-7721(93)90010-4_BIB24","first-page":"1324","article-title":"Pattern recognition and geometric complexity","author":"Toussaint","year":"1980","journal-title":"Proceedings of the 5th International Conference on Pattern Recognition"},{"key":"10.1016\/0925-7721(93)90010-4_BIB25","doi-asserted-by":"crossref","first-page":"165","DOI":"10.1016\/0167-8655(86)90015-2","article-title":"Shortest path solves edge-to-edge visibility in a polygon","volume":"4","author":"Toussaint","year":"1986","journal-title":"Pattern Recognition Lett."},{"key":"10.1016\/0925-7721(93)90010-4_BIB26","first-page":"154","article-title":"Planning views for the incremental construction of body models","author":"Xie","year":"1986","journal-title":"Proceedings of the International Conference on Pattern Recognition"},{"key":"10.1016\/0925-7721(93)90010-4_BIB27","series-title":"Robotics Research: International Symposium","first-page":"11","article-title":"3-D data acquisition my multiple views","author":"Yachida","year":"1986"}],"container-title":["Computational Geometry"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0925772193900104?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0925772193900104?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T06:55:56Z","timestamp":1555138556000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0925772193900104"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993,9]]},"references-count":27,"journal-issue":{"issue":"4","published-print":{"date-parts":[[1993,9]]}},"alternative-id":["0925772193900104"],"URL":"https:\/\/doi.org\/10.1016\/0925-7721(93)90010-4","relation":{},"ISSN":["0925-7721"],"issn-type":[{"value":"0925-7721","type":"print"}],"subject":[],"published":{"date-parts":[[1993,9]]}}}