Sandip Das

We discuss in this paper a method of finding skyline or non-dominated points in a set P of n points with respect to a set S of m sites. A point pi∈ P is non-dominated if and only if for each pj∈ P, j ¹ ij\ not= i, there exists at least one point s∈ S that is closer to pi than p j. We reduce this problem of determining non-dominated points to the problem of finding sites that have non-empty cells in an additively weighted Voronoi diagram under convex distance function. The weights of the said Voronoi diagram are derived from the co-ordinates of the ...