Quickhull
id:
quickhull-202-2010238
title:
Quickhull
text:
Quickhull is a method of computing the convex hull of a finite set of points in n-dimensional space. It uses a divide and conquer approach similar to that of quicksort, from which its name derives. Its worst case time complexity for 2-dimensional and 3-dimensional space is O , but when the input precision is restricted to O bits, its worst case time complexity is conjectured to be O , where n is the number of input points and r is the number of processed points. N-dimensional Quickhull was inven
brand slug:
wiki
category slug:
encyclopedia
description:
original url:
https://en.wikipedia.org/wiki/Quickhull
date created:
date modified:
2023-04-25T03:24:44Z
main entity:
{"identifier":"Q2123073","url":"https://www.wikidata.org/entity/Q2123073"}
image:
{"content_url":"https://upload.wikimedia.org/wikipedia/commons/4/42/Animation_depicting_the_quickhull_algorithm.gif","width":400,"height":400}
fields total:
13
integrity:
14