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
Facts
3 properties- Instance of
- convex hull algorithm
- Average time complexity
- O(n \log h)[4]
- Named after
- David G. Kirkpatrick, Raimund Seidel[2][3]
🏷️ Also known as
en Kirkpatrick–Seidel algorithm
de Kirkpatrick-Seidel-Algorithmus
fr algorithme de Kirkpatrick-Seidel
ja カークパトリック-サイデルアルゴリズム
ja 究極の凸包アルゴリズム
ru Алгоритм Киркпатрика
ru Построение выпуклой оболочки методом разделяй и властвуй
th ขั้นตอนวิธีเคิร์กแพทริก-ไซเดิล
th อัลกอริทึม Kirkpatrick–Seidel
uk Алгоритм Кирпатрика-Зейделя
🔖 Identifiers · 2
- Freebase ID
- /m/02rpd9x
- Microsoft Academic ID (discontinued)
- 2775838227
🔗 Connections
Created notable works 2
Named after 2
Instance of 1
Press Enter · cited answer in seconds
0 sources
Summary
Kirkpatrick–Seidel algorithm is a convex hull algorithm[1].
Body
History and Context
Things named after include David G. Kirkpatrick[2], a computer scientist[5], b. 1953[6], of Canada[7], awarded the Fellow of the Royal Society of Canada[8] and Raimund Seidel[3], a computer scientist[9], b. 1957[10], specialised in computational geometry[11].