home *** CD-ROM | disk | FTP | other *** search
- Path: sparky!uunet!mcsun!corton!sophia!taloa!news
- From: guyard@dollar.unice.fr (Frederic Guyard)
- Newsgroups: sci.math.symbolic
- Subject: Finding convex hull ?
- Message-ID: <1992Jul21.161451.8912@taloa.unice.fr>
- Date: 21 Jul 92 16:14:51 GMT
- Sender: news@taloa.unice.fr (Usenet News)
- Organization: University of Nice Sophia-Antipolis, France
- Lines: 9
- Nntp-Posting-Host: peseta.unice.fr
-
- Hi;
-
- Is there a fast algorithm to find the convex hull of a set of points, where
- each point is a point of a n dimensional vector space.
- If n=2, there is the Graham algorithm... But for n>2 ?
- Is there a generalisation for the Graham algorithm ?
-
-
- Thank you
-