M. Kallay. Convex hull made easy. Information Processing Letters, 22:161-163, 1986. Home/Search Document Not in Database Summary Related Articles |
This paper is cited in the following contexts:
Enumerating Extreme Points in Higher Dimensions - Ottmann, Schuierer.. (1995) (10 citations) (Correct)
....two and three the problem of determining the extreme points of a given set P can be solved in optimal time O(n log n) by computing the convex hull of P . The problem of finding the convex hull of a set of n points has been extensively studied and many elegant algorithms exist for its solution [2, 3, 11, 13, 14, 15, 16]. The method for identifying the points on the convex hull in two and three dimensions cannot be extended to dimensions greater than three since the number of facets of the convex hull of P has an exponential growth in higher dimensions, i.e. there can be up to Omega Gamma n bd=2c ) facets ....
M. Kallay. Convex hull made easy. Information Processing Letters, 22:161-163, 1986.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC