{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,3]],"date-time":"2022-04-03T10:05:36Z","timestamp":1648980336591},"reference-count":11,"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":[[2015,3]]},"abstract":" We study the aggregate\/group top-k nearest neighbor searching for the Max operator in the plane, where the distances are measured by the L1<\/jats:sub> metric. Let P be a set of n points in the plane. Given a query set Q of m points, for each point p \u2208 P, the aggregate-max distance from p to Q is defined to be the maximum distance from p to all points in Q. Given Q and an integer k with 1 \u2264 k \u2264 n, the query asks for the k points of P that have the smallest aggregate-max distances to Q. We build a data structure of O(n) size in O(n log n) time, such that each query can be answered in O(m+k log n) time and the k points are reported in sorted order by their aggregate-max distances to Q. Alternatively, we build a data structure of O(n log n) size in O(n log2<\/jats:sup> n) time that can answer each query in O(m + k + log3<\/jats:sup> n) time. <\/jats:p>","DOI":"10.1142\/s0218195915500053","type":"journal-article","created":{"date-parts":[[2015,6,8]],"date-time":"2015-06-08T05:30:29Z","timestamp":1433741429000},"page":"57-76","source":"Crossref","is-referenced-by-count":4,"title":["Aggregate-MAX Top-k<\/i> Nearest Neighbor Searching in the L<\/i>1<\/sub> Plane"],"prefix":"10.1142","volume":"25","author":[{"given":"Haitao","family":"Wang","sequence":"first","affiliation":[{"name":"Department of Computer Science, Utah State University, Logan, UT 84322, USA"}]}],"member":"219","published-online":{"date-parts":[[2015,6,8]]},"reference":[{"key":"p_2","doi-asserted-by":"publisher","DOI":"10.1145\/293347.293348"},{"key":"p_3","doi-asserted-by":"publisher","DOI":"10.1137\/0215051"},{"key":"p_4","doi-asserted-by":"publisher","DOI":"10.1007\/BF01762115"},{"key":"p_5","doi-asserted-by":"publisher","DOI":"10.1137\/0217026"},{"key":"p_6","doi-asserted-by":"publisher","DOI":"10.1007\/BF01840440"},{"key":"p_7","doi-asserted-by":"publisher","DOI":"10.1007\/BF01840441"},{"key":"p_10","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2010.181"},{"key":"p_13","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2008.41"},{"key":"p_15","doi-asserted-by":"publisher","DOI":"10.1007\/BF01758836"},{"key":"p_17","doi-asserted-by":"publisher","DOI":"10.1145\/1071610.1071616"},{"key":"p_21","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2005.87"}],"container-title":["International Journal of Computational Geometry & Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/s0218195915500053","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,7]],"date-time":"2019-08-07T09:20:40Z","timestamp":1565169640000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/s0218195915500053"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,3]]},"references-count":11,"journal-issue":{"issue":"01","published-online":{"date-parts":[[2015,6,8]]},"published-print":{"date-parts":[[2015,3]]}},"alternative-id":["10.1142\/s0218195915500053"],"URL":"https:\/\/doi.org\/10.1142\/s0218195915500053","relation":{},"ISSN":["0218-1959","1793-6357"],"issn-type":[{"value":"0218-1959","type":"print"},{"value":"1793-6357","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,3]]}}}