{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,1,10]],"date-time":"2023-01-10T14:31:29Z","timestamp":1673361089869},"reference-count":0,"publisher":"World Scientific Pub Co Pte Lt","issue":"01","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Int. J. Comput. Geom. Appl."],"published-print":{"date-parts":[[1993,3]]},"abstract":" In this paper we define the notion of circular visibility, and present an O (n log n) time algorithm to compute the portion of a given simple polygon [Formula: see text] circularly visible from a fixed point lying inside [Formula: see text]. The second problem that we study is the circle shooting from a fixed-point, which can be formulated as follows: Given a simple polygon [Formula: see text] and a point s inside [Formula: see text], preprocess [Formula: see text] so that given a circle \u03c0 passing through s, one can quickly compute the first point of [Formula: see text] intersected by \u03c0 as we follow \u03c0 from s in a clockwise direction. We show that [Formula: see text] can be preprocessed, in time O (n log n), into a data structure of linear size, so that a query can be answered in logarithmic time. <\/jats:p>","DOI":"10.1142\/s0218195993000026","type":"journal-article","created":{"date-parts":[[2004,11,23]],"date-time":"2004-11-23T03:29:30Z","timestamp":1101180570000},"page":"1-25","source":"Crossref","is-referenced-by-count":6,"title":["CIRCULAR VISIBILITY FROM A POINT IN A SIMPLE POLYGON"],"prefix":"10.1142","volume":"03","author":[{"given":"PANKAJ K.","family":"AGARWAL","sequence":"first","affiliation":[{"name":"Computer Science Department, Duke University, Durham, NC 27706, USA"}]},{"given":"MICHA","family":"SHARIR","sequence":"additional","affiliation":[{"name":"School of Mathematical Sciences, Tel Aviv University, Tel Aviv, Israel"}]}],"member":"219","published-online":{"date-parts":[[2011,11,20]]},"container-title":["International Journal of Computational Geometry & Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S0218195993000026","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,6]],"date-time":"2019-08-06T23:57:34Z","timestamp":1565135854000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S0218195993000026"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993,3]]},"references-count":0,"journal-issue":{"issue":"01","published-online":{"date-parts":[[2011,11,20]]},"published-print":{"date-parts":[[1993,3]]}},"alternative-id":["10.1142\/S0218195993000026"],"URL":"http:\/\/dx.doi.org\/10.1142\/s0218195993000026","relation":{},"ISSN":["0218-1959","1793-6357"],"issn-type":[{"value":"0218-1959","type":"print"},{"value":"1793-6357","type":"electronic"}],"subject":["Applied Mathematics","Computational Mathematics","Computational Theory and Mathematics","Geometry and Topology","Theoretical Computer Science"],"published":{"date-parts":[[1993,3]]}}}