Kirkpatrick–Seidel algorithm
algorithm for computing the convex hull of a set of points in the plane in 𝒪(𝑛 log ℎ) time, where 𝑛 is the number of input points and ℎ is the number of points in the hull
Press Enter · cited answer in seconds
0 sources
Kirkpatrick–Seidel algorithm
Summary
Kirkpatrick–Seidel algorithm is a convex hull algorithm[1]. It draws 8 Wikipedia views per month (convex_hull_algorithm category, ranking #5 of 5).[2]
Key Facts
- Kirkpatrick–Seidel algorithm's instance of is recorded as convex hull algorithm[3].
- David G. Kirkpatrick is named after Kirkpatrick–Seidel algorithm[4].
- Raimund Seidel is named after Kirkpatrick–Seidel algorithm[5].
- Kirkpatrick–Seidel algorithm's Freebase ID is recorded as /m/02rpd9x[6].
- Kirkpatrick–Seidel algorithm's average time complexity is recorded as O(n \log h)[7].
- Kirkpatrick–Seidel algorithm's Microsoft Academic ID is recorded as 2775838227[8].
Body
Designation and Status
Kirkpatrick–Seidel algorithm's instance of is recorded as convex hull algorithm[3].
History and Context
Things named after include David G. Kirkpatrick[4], a computer scientist[9], b. 1953[10], of Canada[11], awarded the Fellow of the Royal Society of Canada[12] and Raimund Seidel[5], a computer scientist[13], b. 1957[14], specialised in computational geometry[15].
Why It Matters
Kirkpatrick–Seidel algorithm draws 8 Wikipedia views per month (convex_hull_algorithm category, ranking #5 of 5).[2] It is known by 3 alternative names across languages and contexts.[16]