Group nearest-neighbor queries in the \(L_1\) plane

DOI10.1016/j.tcs.2015.05.011zbMath1330.68318OpenAlexW2175280589MaRDI QIDQ500965

Hee-Kap Ahn, Wanbin Son, Sang Won Bae

Publication date: 8 October 2015

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2015.05.011

zbMATH Keywords

plane sweep algorithmgeometric data structure\(k\)-nearest-neighbor queryorthogonal range searchingsegment dragging query

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Data structures (68P05)

Related Items (1)

On Top-k Weighted<scp>Sum</scp>Aggregate Nearest and Farthest Neighbors in the L1 Plane

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Refinements to nearest-neighbor searching in k-dimensional trees
• Geometrical properties of the Fermat-Weber problem
• \(L_ 1\) shortest paths among polygonal obstacles in the plane
• Farthest neighbors, maximum spanning trees and related problems in higher dimensions
• Computing farthest neighbors on a convex polytope.
• Efficient Top-k Queries for Orthogonal Ranges
• An optimal algorithm for approximate nearest neighbor searching fixed dimensions
• All Farthest Neighbors in the Presence of Highways and Obstacles
• Multidimensional binary search trees used for associative searching
• FINDING k FARTHEST PAIRS AND k CLOSEST/FARTHEST BICHROMATIC PAIRS FOR POINTS IN THE PLANE
• Characterizations of Strong Regularity for Variational Inequalities over Polyhedral Convex Sets
• Performance planning
• Orthogonal range searching on the RAM, revisited

This page was built for publication: Group nearest-neighbor queries in the \(L_1\) plane