Top-k Manhattan spatial skyline queries
From MaRDI portal
Publication:522965
DOI10.1016/J.IPL.2017.03.003zbMATH Open1405.68100OpenAlexW16191149MaRDI QIDQ522965FDOQ522965
Authors: Wanbin Son, Fabian Stehn, Christian Knauer, Hee-Kap Ahn
Publication date: 20 April 2017
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ipl.2017.03.003
Recommendations
Data structures (68P05) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Computational geometry. Algorithms and applications.
- On Finding the Maxima of a Set of Vectors
- Characterizations of Strong Regularity for Variational Inequalities over Polyhedral Convex Sets
- Title not available (Why is that?)
- Performance planning
- Aggregate-\textsc{Max} top-\(k\) nearest neighbor searching in the \(L_{1}\) plane
- MSSQ: Manhattan spatial skyline queries
- Computation of non-dominated points using compact Voronoi diagrams
Cited In (3)
This page was built for publication: Top-\(k\) Manhattan spatial skyline queries
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q522965)