A volume first maxima-finding algorithm

Authors:
Xiangquan Gui;Xiaohong Hao;Yuanping Zhang;Xuerong Yong
Affiliations:
College of Computer and Communication, Lanzhou University of Technology, Lanzhou, 730050, PR China and College of Electrical and Information Engineering, Lanzhou University of Technology, Lanzhou, ...;College of Electrical and Information Engineering, Lanzhou University of Technology, Lanzhou, PR China;College of Computer and Educational Software, Guangzhou University, Guangzhou, 510006, PR China;Department of Mathematical Sciences, University of Puerto Rico at Mayaguez, P.O. Box 9018, PR 00681, USA
Venue:
Theoretical Computer Science
Year:
2011

Citing 6
Cited 0

Computational geometry: an introduction

Computational geometry: an introduction
Fast linear expected-time alogorithms for computing maxima and convex hulls

SODA '90 Proceedings of the first annual ACM-SIAM symposium on Discrete algorithms
On Finding the Maxima of a Set of Vectors

Journal of the ACM (JACM)
On the Average Number of Maxima in a Set of Vectors and Applications

Journal of the ACM (JACM)
The Skyline Operator

Proceedings of the 17th International Conference on Data Engineering
Maximal vector computation in large data sets

VLDB '05 Proceedings of the 31st international conference on Very large data bases

Quantified Score

Hi-index	5.23

Visualization

Abstract

The maxima-finding is a fundamental problem in computational geometry with many applications. In this paper, a volume first maxima-finding algorithm is proposed. It is proved that the expected running time of the algorithm is N+o(N) when choosing points from CI distribution, which is a new theoretical result when the points belong to d(2) dimensional space. Experimental results and theoretical analysis indicate that the algorithm runs faster than the Move-To-Front maxima-finding algorithm.