QuickHull

algorithm for finding the convex hull of a set of points in the plane
Intangible Convex Hull Algorithm Q2123073

Facts

8 properties
Publication date
1995[3]
Based on
quicksort[2]
Average time complexity
O(n \log n)[8]
Point in time
1995[4]
Worst-case time complexity
O(n^2)[7]
🏷️ Also known as
en QuickHull ja クイックハル ru Алгоритм быстрой оболочки uk Алгоритм швидкої оболонки
🔖 Identifiers · 2
Freebase ID
/m/0j2b1h6
Microsoft Academic ID (discontinued)
2776693088

Report an error or request removal Lineage (PROV-JSON)

🔗 Connections
Based on 1
Instance of 1
Press Enter · cited answer in seconds

Summary

QuickHull is a convex hull algorithm[1].

📑 Cite this page

Use these citations when quoting this entity in research, articles, AI prompts, or wherever provenance matters. We aggregate Wikidata + Wikipedia + authoritative open-data sources; the stitched, scored, cross-referenced view is what 4ort.xyz contributes.

APA 4ort.xyz Knowledge Graph. (2026). QuickHull. Retrieved November 18, 2026, from https://4ort.xyz/entity/quickhull
MLA “QuickHull.” 4ort.xyz Knowledge Graph, 4ort.xyz, 18 Nov. 2026, https://4ort.xyz/entity/quickhull.
BibTeX @misc{4ortxyz_quickhull_2026, author = {{4ort.xyz Knowledge Graph}}, title = {{QuickHull}}, year = {2026}, url = {https://4ort.xyz/entity/quickhull}, note = {Accessed: 2026-11-18}}
LLM prompt According to 4ort.xyz Knowledge Graph (aggregator of Wikidata, Wikipedia, and authoritative open-data sources): QuickHull — https://4ort.xyz/entity/quickhull (retrieved 2026-11-18)

Canonical URL: https://4ort.xyz/entity/quickhull · Last refreshed: