home *** CD-ROM | disk | FTP | other *** search
/ NetNews Usenet Archive 1992 #16 / NN_1992_16.iso / spool / sci / math / symbolic / 2051 < prev    next >
Encoding:
Internet Message Format  |  1992-07-22  |  807 b 
  1. Path: sparky!uunet!pmafire!news.dell.com!natinst.com!cs.utexas.edu!uwm.edu!zaphod.mps.ohio-state.edu!cis.ohio-state.edu!ucbvax!agate!agate!phr
  2. From: phr@soda.berkeley.edu (Paul Rubin)
  3. Newsgroups: sci.math.symbolic
  4. Subject: Re: Finding convex  hull ?
  5. Message-ID: <PHR.92Jul22170347@soda.berkeley.edu>
  6. Date: 23 Jul 92 00:03:47 GMT
  7. References: <1992Jul21.161451.8912@taloa.unice.fr> <1992Jul22.113118.24947@ai.univie.ac.at>
  8. Organization: CSUA/UCB
  9. Lines: 4
  10. NNTP-Posting-Host: soda.berkeley.edu
  11. In-reply-to: christian@ai.univie.ac.at's message of Wed, 22 Jul 1992 11:31:18 GMT
  12.  
  13. The best known algorithms for convex hull are very complicated.
  14. One can't assume that a constraint system will do something efficient.
  15. I believe "Compuational Geometry" by Preparata and Shamos has some
  16. info on convex hull algorithms.
  17.