A Fast Incremental Convex Hull Algorithm for Higher Dimensions

Simple item page
dc.contributor.authorStewart, W. M.
dc.contributor.authorHorton, J. D.
dc.date.accessioned2023-03-01T18:29:47Z
dc.date.available2023-03-01T18:29:47Z
dc.date.issued1990
dc.description.abstractAn online algorithm is described which finds the facets of the convex hull of a set of points in d-dimensional space. For point sets chosen at random from some distribution, the algorithm is O(nl +F) for fixed d, where n is the number of points, l is the expected number of sides of a polygon defined by the intersection of a 2-flat with the polytope, and F is the expected number of facets.
dc.description.copyrightCopyright @ W. M.Stewart and J. D. Horton, 1990.
dc.identifier.urihttps://unbscholar.lib.unb.ca/handle/1882/14948
dc.rightshttp://purl.org/coar/access_right/c_abf2
dc.subject.disciplineComputer Science
dc.titleA Fast Incremental Convex Hull Algorithm for Higher Dimensions
dc.typetechnical report

Files

Original bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
item.pdf
Size:
293.25 KB
Format:
Adobe Portable Document Format
Download

Collections

Research Reports