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

DOI10.1142/S0218195919500055zbMath1493.68378arXiv1211.5084OpenAlexW2981518383MaRDI QIDQ5241377

Wuzhou Zhang, Haitao Wang

Publication date: 31 October 2019

Published in: International Journal of Computational Geometry & Applications (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1211.5084

zbMATH Keywords

uncertain datanearest neighborstop-\(k\) queriesaggregatefarthest neighbors

Mathematics Subject Classification ID

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

Related Items (1)

Nearest-neighbor searching under uncertainty. I

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Group nearest-neighbor queries in the \(L_1\) plane
• Geometrical properties of the Fermat-Weber problem
• Maintenance of configurations in the plane
• Nearest-neighbor searching under uncertainty. I
• Aggregate-MAX Top-k Nearest Neighbor Searching in the L₁ Plane
• COMPACT INTERVAL TREES: A DATA STRUCTURE FOR CONVEX HULLS
• Nearest-Neighbor Searching Under Uncertainty II

This page was built for publication: On Top-k Weighted<scp>Sum</scp>Aggregate Nearest and Farthest Neighbors in the L1 Plane