Bucketing algorithms for sorting selection and computational geometry

Free Download

Authors:

Edition: Dissertation

Size: 1 MB (1415111 bytes)

Pages: 102/102

File format:

Language:

Publishing Year:

Category:

Hyslop G.A.

In this dissertation we study bucketing algorithms for sorting, selection, Voronoi diagram construction and the closest pair problem. Mathematical analyses of several algorithms are presented.The algorithms are implemented to verify these analyses and to gain insight into their performance on actual machines.

Reviews

There are no reviews yet.

Be the first to review “Bucketing algorithms for sorting selection and computational geometry”
Shopping Cart
Scroll to Top