Name
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. |
Year | DOI | Venue |
|---|---|---|
2011 | 10.1016/j.tcs.2011.08.013 | Theor. Comput. Sci. |
Keywords | DocType | Volume |
computational geometry,dimensional space,CI distribution,fundamental problem,Move-To-Front maxima-finding algorithm,theoretical analysis,experimental result,new theoretical result,maxima-finding algorithm | Journal | 412 |
Issue | ISSN | Citations |
45 | 0304-3975 | 0 |
PageRank | References | Authors |
0.34 | 6 | 4 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Xiangquan Gui | 1 | 9 | 2.40 |
| Xiaohong Hao | 2 | 70 | 9.23 |
| Yuanping Zhang | 3 | 83 | 10.45 |
| Xuerong Yong | 4 | 88 | 13.77 |