Hostname: page-component-7b7567c8c-fvjsw Total loading time: 0 Render date: 2026-11-16T10:38:14.168Z Has data issue: false hasContentIssue false

On the convex hull of random points in a polytope

Published online by Cambridge University Press:  14 July 2016

Rex A. Dwyer*
Affiliation:
Carnegie-Mellon University
*
∗ Present address: Computer Science Department, North Carolina State University, Raleigh, NC 27695–8206, USA.

Abstract

The convex hull of n points drawn independently from a uniform distribution on the interior of a d-dimensional polytope is investigated. It is shown that the expected number of vertices is O(logd–1n) for any polytope, the expected number of vertices is Ω(logd–1n) for any simple polytope, and the expected number of facets is O(logd–1n) for any simple polytope. An algorithm is presented for constructing the convex hull of such sets of points in linear average time.

Information

Type
Research Papers
Copyright
Copyright © Applied Probability Trust 1988 

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Article purchase

Temporarily unavailable