A volume first maxima-finding algorithm

DOI10.1016/J.TCS.2011.08.013MaRDI QIDQ653324zbMATH OpenOpenAlexFDO

Authors Xiangquan Gui, Yuanping Zhang, Xiao-hong Hao, Xuerong Yong

Publication date 9 January 2012

Published in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.tcs.2011.08.013

zbMATH Keywords

computational geometrymaximaprobabilistic analysisskyline point

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Recommendations

• scientific article; zbMATH DE number 2038886
• LATIN 2004: Theoretical Informatics
• A provably fast linear-expected-time maxima-finding algorithm
• Fast computation of output-sensitive maxima in a word RAM
• Maxima-finding algorithms for multidimensional samples: A two-phase approach

Cites work

• scientific article; zbMATH DE number 432763 (Why is no real title available?)
• scientific article; zbMATH DE number 3919830 (Why is no real title available?)
• scientific article; zbMATH DE number 2038886 (Why is no real title available?)
• A provably fast linear-expected-time maxima-finding algorithm
• On Finding the Maxima of a Set of Vectors
• On the Average Number of Maxima in a Set of Vectors and Applications

Cited in

(4)

• scientific article; zbMATH DE number 1444320 (Why is no real title available?)
• Maxima-finding algorithms for multidimensional samples: A two-phase approach
• LATIN 2004: Theoretical Informatics
• The volume algorithm: Producing primal solutions with a subgradient method

This page was built for publication: A volume first maxima-finding algorithm

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q653324)