Name
Abstract | ||
|---|---|---|
We collect major known algorithms in the literature for finding the maxima of multi-dimensional points and provide a simple classification. Several new algorithms are proposed. In particular, we give a new maxima-finding algorithm with expected complexity n + O( p n log n) when the input is a sequence of points uniformly chosen at random from general planar regions. We also give a sequential algorithm, very efficient for practical purposes. |
Year | Venue | Keywords |
|---|---|---|
2003 | DISCRETE MATHEMATICS AND THEORETICAL COMPUTER SCIENCE | maximal points, computational geometry, probabilistic analysis of algorithms, Pareto optimality, sieve algorithms, dominance |
Field | DocType | Volume |
Discrete mathematics,Binary logarithm,Combinatorics,Algorithm,Probabilistic analysis of algorithms,Planar,Sequential algorithm,Maxima,Mathematics | Journal | 6 |
Issue | ISSN | Citations |
1 | 1365-8050 | 8 |
PageRank | References | Authors |
0.60 | 44 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Wei‐Mei Chen | 1 | 57 | 9.26 |
| Hsien-Kuei Hwang | 2 | 365 | 38.02 |
| Tsung-Hsi Tsai | 3 | 81 | 8.20 |