(Approximate) uncertain skylines

DOI10.1007/s00224-012-9382-7zbMath1270.68383OpenAlexW1973664142MaRDI QIDQ359874

Lars Arge, Peyman Afshani, Pankaj K. Agarwal, Kasper Green Larsen, Jeff M. Phillips

Publication date: 23 August 2013

Published in: Theory of Computing Systems (Search for Journal in Brave)

Full work available at URL: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.294.7652

zbMATH Keywords

data structurescomputational geometryapproximation algorithms

Mathematics Subject Classification ID

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

Related Items (7)

Skyline Computation with Noisy Comparisons ⋮ Approximating the Expected Values for Combinatorial Optimization Problems over Stochastic Points ⋮ Convex hulls under uncertainty ⋮ Closest pair and the post office problem for stochastic points ⋮ The Most Likely Object to be Seen Through a Window ⋮ Efficient computation for probabilistic skyline over uncertain preferences ⋮ Expected computations on color spanning sets

Uses Software

• Trio

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Approximately dominating representatives
• Voronoi diagrams in higher dimensions under certain polyhedral distance functions
• Delaunay triangulations of imprecise pointsin linear time after preprocessing
• Shape Fitting on Point Sets with Probability Distributions
• New Data Structures for Orthogonal Range Queries
• Optimal Point Location in a Monotone Subdivision
• Multidimensional binary search trees used for associative searching
• On Finding the Maxima of a Set of Vectors

This page was built for publication: (Approximate) uncertain skylines