home *** CD-ROM | disk | FTP | other *** search
- Newsgroups: comp.graphics
- Path: sparky!uunet!charon.amdahl.com!pacbell.com!iggy.GW.Vitalink.COM!cs.widener.edu!eff!sol.ctr.columbia.edu!destroyer!gumby!yale!yale.edu!jvnc.net!darwin.sura.net!nntp.msstate.edu!willis1.cis.uab.edu!sloan
- From: sloan@cis.uab.edu (Kenneth Sloan)
- Subject: Re: Point inside a triangle
- Message-ID: <1992Nov18.003415.9990@cis.uab.edu>
- Organization: CIS, University of Alabama at Birmingham
- References: <Bxtz3s.6xA@slipknot.rain.com> <1992Nov17.132302.6345@sophia.smith.edu> <BxvnnI.90x@slipknot.rain.com>
- Date: Wed, 18 Nov 1992 00:34:15 GMT
- Lines: 27
-
- In article <BxvnnI.90x@slipknot.rain.com> robert@slipknot.rain.com.UUCP (Robert Reed) writes:
- >
- >A trivial modification to the algorithm as I suggested it would correct for
- >this. If the boundaries of any polygon are to be considered interior, then if
- >a bounding edge is collinear with the test point, it is sufficient to test
- >whether the point is within the interval of the edge. If it is not, the edge
- >is trivially rejected as before. If it is, the algorithm can be prematurely
- >terminated with a TRUE result.
-
- But...but...the point is:
-
- Your "trivial modification" is virtually *all* of Professor O'Rourke's
- algorithm! By the time you make this trivial modification to your
- algorithm, you might just as well throw away your algorithm.
-
- This is a common problem when dealing with algorithm "sketches" - one
- man's algorithm is another man's "special cases". Often, you need bits
- and pieces of both to handle everything. Where you start is a matter of
- taste, style, and judgement.
-
- And, of course, de gustibus non disputandum est.
-
- --
- Kenneth Sloan Computer and Information Sciences
- sloan@cis.uab.edu University of Alabama at Birmingham
- (205) 934-2213 115A Campbell Hall, UAB Station
- (205) 934-5473 FAX Birmingham, AL 35294-1170
-