Simple, efficient maxima-finding algorithms for multidimensional samples

Details Simple, efficient maxima-finding algorithms for multidimensional samples Simple, efficient maxima-finding algorithms for multidimensional samples

2009-10-08

arxiv.org/abs/0910.1392v1

Computer Science

Data Structures and Algorithms

Scientific paper

New algorithms are devised for finding the maxima of multidimensional point samples, one of the very first problems studied in computational geometry. The algorithms are very simple and easily coded and modified for practical needs. The expected complexity of some measures related to the performance of the algorithms is analyzed. We also compare the efficiency of the algorithms with a few major ones used in practice, and apply our algorithms to find the maximal layers and the longest common subsequences of multiple sequences.

Affiliated with

Also associated with

No associations

Rating

Simple, efficient maxima-finding algorithms for multidimensional samples does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Simple, efficient maxima-finding algorithms for multidimensional samples, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Simple, efficient maxima-finding algorithms for multidimensional samples will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-351965