The quickhull algorithm for convex hulls

The quickhull algorithm for convex hulls is a scholarly article.

Creative Work Academic Journal Article Q29014474

Facts

5 properties
Instance of
scholarly articleas of 2026-09-23
where from?
Source
OpenAlex
Edition
20260923 · as of 2026-09-23
Bronze
not in the catalog
Transform
4ort-mint · openalex:20260923 · version not recorded
Publication date
December 1, 1996[1]as of 2026-09-23
where from?
Source
OpenAlex
Edition
20260923 · as of 2026-09-23
Bronze
not in the catalog
Transform
4ort-mint · openalex:20260923 · version not recorded
Published in
ACM Transactions on Mathematical Software[3]as of 2026-09-23
where from?
Source
OpenAlex
Edition
20260923 · as of 2026-09-23
Bronze
not in the catalog
Transform
4ort-mint · openalex:20260923 · version not recorded
Sponsor
National Science Foundation[2]as of 2026-09-23
where from?
Source
OpenAlex
Edition
20260923 · as of 2026-09-23
Bronze
not in the catalog
Transform
4ort-mint · openalex:20260923 · version not recorded
Title
The quickhull algorithm for convex hulls[4]as of 2026-09-23
where from?
Source
OpenAlex
Edition
20260923 · as of 2026-09-23
Bronze
not in the catalog
Transform
4ort-mint · openalex:20260923 · version not recorded
🔖 Identifiers · 2
OpenAlex ID
W2153504150as of 2026-09-23
where from?
Source
OpenAlex
Edition
20260923 · as of 2026-09-23
Bronze
not in the catalog
Transform
4ort-mint · openalex:20260923 · version not recorded
DOI
10.1145/235815.235821as of 2026-09-23
where from?
Source
OpenAlex
Edition
20260923 · as of 2026-09-23
Bronze
not in the catalog
Transform
4ort-mint · openalex:20260923 · version not recorded
📚 Sources · 1

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

📜 Data licence
Source: OpenAlex (openalex.org), snapshot of 2026-09-23. CC0 1.0 Universal. CC0 1.0 Universal · OpenAlex
Press Enter · cited answer in seconds

📑 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). The quickhull algorithm for convex hulls. Retrieved October 16, 2026, from https://4ort.xyz/entity/the-quickhull-algorithm-for-convex-hulls
MLA “The quickhull algorithm for convex hulls.” 4ort.xyz Knowledge Graph, 4ort.xyz, 16 Oct. 2026, https://4ort.xyz/entity/the-quickhull-algorithm-for-convex-hulls.
BibTeX @misc{4ortxyz_the-quickhull-algorithm-for-convex-hulls_2026, author = {{4ort.xyz Knowledge Graph}}, title = {{The quickhull algorithm for convex hulls}}, year = {2026}, url = {https://4ort.xyz/entity/the-quickhull-algorithm-for-convex-hulls}, note = {Accessed: 2026-10-16}}
LLM prompt According to 4ort.xyz Knowledge Graph (aggregator of Wikidata, Wikipedia, and authoritative open-data sources): The quickhull algorithm for convex hulls — https://4ort.xyz/entity/the-quickhull-algorithm-for-convex-hulls (retrieved 2026-10-16)

Canonical URL: https://4ort.xyz/entity/the-quickhull-algorithm-for-convex-hulls · Last refreshed: