Computation of spatial skyline points

  title={Computation of spatial skyline points},
  author={Binay K. Bhattacharya and Arijit Bishnu and Otfried Cheong and Sandip Das and Arindam Karmakar and Jack Snoeyink},
  journal={Comput. Geom.},
Skyline-Like Query in Three-Dimensional Obstacle Space
A skyline-like query was proposed in three-dimensional obstacle space based on the traditional skyline query to solve typical multiobjective optimization problems and it was shown that the algorithm had a great performance.


The spatial skyline queries
The main intuition and novelty behind the approaches is that they exploit the geometric properties of the SSQ problem space to avoid the exhaustive examination of all the point pairs in P and Q and reduce the complexity of SSQ search from O(P) to O(Q) .
The Skyline operator
This work shows how SSL can be extended to pose Skyline queries, present and evaluate alternative algorithms to implement the Skyline operation, and shows how this operation can be combined with other database operations, e.g., join.
Computational geometry: an introduction
This book offers a coherent treatment, at the graduate textbook level, of the field that has come to be known in the last decade or so as computational geometry.
Handbook of computational geometry
The Davenport-Schinzel sequences and their geometric applications, as well as randomizedalgorithms in computaional geometry, are described.
On the Minimum Consistent Subset Problem
This paper presents the first subexponential-time algorithm for the consistent subset problem, and combines tools from planar separators, additively-weighted Voronoi diagrams with respect to convex distance functions, point location in farthest-point Voronoa diagrams, range trees, paraboloid lifting, minimum covering of a circle with arcs, and several geometric transformations.
A compact piecewise-linear voronoi diagram for convex sites in the plane
In the plane the post-office problem, which asks for the closest site to a query site, and retraction motion planning, are both classically solved by computing a Voronoi diagram, which is sufficient for logarithmic time post- office location queries and motion planning.
Spatial skyline queries: exact and approximation algorithms
This work presents a simple and efficient algorithm that computes the correct results, and proposes a fast approximation algorithm that returns a desirable subset of the skyline results.
Computation of Non-dominated Points Using Compact Voronoi Diagrams
This paper reduces 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 and gives a O((m+n)logm+ n logn)-time randomized incremental algorithm to find the non- dominated points.