The average performance analysis of a closest-pair algorithm

Bentley proposed a divide-and-conquer approach to solve the planar closest pair problem. In this paper, we shall show that the average case performance of this algorithm is proportional to the number of poins being examined.

Uloženo v:

Podrobná bibliografie
Vydáno v:	International journal of computer mathematics Ročník 16; číslo 2; s. 125 - 130
Hlavní autoři:	Chang, R. C., Lee, R. C. T.
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	Abingdon Gordon and Breach Science Publishers 01.01.1984 Taylor and Francis
Témata:	Algorithmics. Computability. Computer arithmetics Analysis of algorithm Applied sciences closest-pair problems computational geometry Computer science; control theory; systems Exact sciences and technology F.2.2. [Analysis of Algorithms and Problem Complexity] geometric probability Nonnumerical Algorithms and Problems probabilistic analysis of algorithms Theoretical computing Performance evaluation Probabilistic approach Algorithm analysis
ISSN:	0020-7160, 1029-0265
On-line přístup:	Získat plný text
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!

Popis
Shrnutí:	Bentley proposed a divide-and-conquer approach to solve the planar closest pair problem. In this paper, we shall show that the average case performance of this algorithm is proportional to the number of poins being examined.
ISSN:	0020-7160 1029-0265
DOI:	10.1080/00207168408803430