{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,31]],"date-time":"2022-03-31T23:06:38Z","timestamp":1648767998474},"reference-count":0,"publisher":"World Scientific Pub Co Pte Lt","issue":"03","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Int. J. Comput. Geom. Appl."],"published-print":{"date-parts":[[1993,9]]},"abstract":"<jats:p> In this paper we present an efficient algorithm for enumerating all the grid points in a convex polygon, where the enumeration is done by scanning the grid points with a set of parallel grid lines. Given a convex n-gon, enumeration can be done in [Formula: see text] time, where K is the number of the grid points reported, l is the diameter of the polygon and w is the length of the shorter sides of the rectangle enclosing the polygon with longer sides parallel to the line segment connecting the diametral pair of the polygon. We also show that the ratio of the number of the scanned grid lines to the minimal is less than some constant. <\/jats:p>","DOI":"10.1142\/s0218195993000191","type":"journal-article","created":{"date-parts":[[2004,11,23]],"date-time":"2004-11-23T03:29:30Z","timestamp":1101180570000},"page":"305-322","source":"Crossref","is-referenced-by-count":0,"title":["REGULAR ENUMERATION OF GRID POINTS IN A CONVEX POLYGON"],"prefix":"10.1142","volume":"03","author":[{"given":"HSUAN-SHIH","family":"LEE","sequence":"first","affiliation":[{"name":"Department of Information Management, Ming Chuang College, Taipei, Republic China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"RUEI CHUAN","family":"CHANG","sequence":"additional","affiliation":[{"name":"Institute of Computer and Information Science, National Chiao Tung University Taiwan, Republic of China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"219","published-online":{"date-parts":[[2011,11,20]]},"container-title":["International Journal of Computational Geometry &amp; Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S0218195993000191","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,7]],"date-time":"2019-08-07T00:31:04Z","timestamp":1565137864000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S0218195993000191"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993,9]]},"references-count":0,"journal-issue":{"issue":"03","published-online":{"date-parts":[[2011,11,20]]},"published-print":{"date-parts":[[1993,9]]}},"alternative-id":["10.1142\/S0218195993000191"],"URL":"https:\/\/doi.org\/10.1142\/s0218195993000191","relation":{},"ISSN":["0218-1959","1793-6357"],"issn-type":[{"value":"0218-1959","type":"print"},{"value":"1793-6357","type":"electronic"}],"subject":[],"published":{"date-parts":[[1993,9]]}}}