Before revision: We study k nearest neighbor queries in the plane for general ( convex, pairwise disjoint ) sites of constant description complexity ( such as line segment , disks, quadrilaterals and so on) and with respect to a general family of distance functions including the L_p-norms and constant-size convex distance functions.
After revision: We study k nearest neighbor queries in the plane for general ( convex, pairwise disjoint ) sites of constant description complexity ( such as line segments , disks, quadrilaterals and so on) and with respect to a general family of distance functions including the L_p-norms and constant-size convex distance functions.