{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T06:43:40Z","timestamp":1740120220941,"version":"3.37.3"},"reference-count":6,"publisher":"World Scientific Pub Co Pte Ltd","issue":"01","funder":[{"DOI":"10.13039\/501100002790","name":"Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100002790","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Int. J. Comput. Geom. Appl."],"published-print":{"date-parts":[[2019,3]]},"abstract":"<jats:p> A new type of range searching problem, called the partial enclosure range searching problem, is introduced in this paper. Given a set of geometric objects [Formula: see text] and a query region [Formula: see text], our goal is to identify those objects in [Formula: see text] which intersect the query region [Formula: see text] by at least a fixed proportion of their original size. Two variations of this problem are studied. In the first variation, the objects in [Formula: see text] are axis-parallel line segments and the goal is to count the total number of members of [Formula: see text] so that their intersection with [Formula: see text] is at least a given proportion of their size. Here, [Formula: see text] can be an axis-parallel rectangle or a parallelogram of arbitrary orientation. In the second variation, [Formula: see text] is a polygon and [Formula: see text] is an axis-parallel rectangle. The problem is to report the area of the intersection between the polygon [Formula: see text] and a query rectangle [Formula: see text]. <\/jats:p>","DOI":"10.1142\/s0218195919500018","type":"journal-article","created":{"date-parts":[[2019,8,20]],"date-time":"2019-08-20T03:31:31Z","timestamp":1566271891000},"page":"73-93","source":"Crossref","is-referenced-by-count":0,"title":["Partial Enclosure Range Searching"],"prefix":"10.1142","volume":"29","author":[{"given":"Gregory","family":"Bint","sequence":"first","affiliation":[{"name":"School of Computer Science, Carleton University, Canada"}]},{"given":"Anil","family":"Maheshwari","sequence":"additional","affiliation":[{"name":"School of Computer Science, Carleton University, Canada"}]},{"given":"Michiel","family":"Smid","sequence":"additional","affiliation":[{"name":"School of Computer Science, Carleton University, Canada"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0330-2891","authenticated-orcid":false,"given":"Subhas C.","family":"Nandy","sequence":"additional","affiliation":[{"name":"Indian Statistical Institute, Kolkata, India"}]}],"member":"219","published-online":{"date-parts":[[2019,8,20]]},"reference":[{"key":"S0218195919500018BIB002","doi-asserted-by":"publisher","DOI":"10.1007\/s00454-012-9410-z"},{"key":"S0218195919500018BIB003","doi-asserted-by":"publisher","DOI":"10.1007\/BF01840440"},{"key":"S0218195919500018BIB004","doi-asserted-by":"publisher","DOI":"10.1007\/BF01840441"},{"key":"S0218195919500018BIB005","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-77974-2"},{"key":"S0218195919500018BIB007","first-page":"558-568","volume-title":"Proc. ISAAC","author":"Jaja J.","year":"2004"},{"key":"S0218195919500018BIB008","doi-asserted-by":"publisher","DOI":"10.1007\/BF02293051"}],"container-title":["International Journal of Computational Geometry &amp; Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S0218195919500018","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,21]],"date-time":"2019-09-21T04:41:12Z","timestamp":1569040872000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S0218195919500018"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,3]]},"references-count":6,"journal-issue":{"issue":"01","published-online":{"date-parts":[[2019,8,20]]},"published-print":{"date-parts":[[2019,3]]}},"alternative-id":["10.1142\/S0218195919500018"],"URL":"https:\/\/doi.org\/10.1142\/s0218195919500018","relation":{},"ISSN":["0218-1959","1793-6357"],"issn-type":[{"type":"print","value":"0218-1959"},{"type":"electronic","value":"1793-6357"}],"subject":[],"published":{"date-parts":[[2019,3]]}}}