Path: utzoo!mnetor!uunet!husc6!bbn!rochester!ur-tut!sunybcs!boulder!hao!ames!pasteur!ucbvax!decvax!decwrl!granite!pjs
From: pjs@granite.dec.com (Philip J. Schneider)
Newsgroups: comp.graphics
Subject: Re: Simple geometric formulae.
Message-ID: <178@granite.dec.com>
Date: 21 Jan 88 17:26:37 GMT
References: <515@unioncs.UUCP>
Reply-To: pjs@granite.UUCP (Philip J. Schneider)
Distribution: na
Organization: DEC Workstation Systems Engineering
Lines: 38

In article <515@unioncs.UUCP> brownh@unioncs.UUCP (H. Brown) writes:
>
>
>In article <554@acornrc.UUCP> you write:
>>I'm looking for some simple geometric formulae such as
>>	distance from a point to a line segment
>>	distance from a point to a bezier
>>	distance from a point to an ellipse
>>	how to determine whether a point is inside an ellipse
>>	how to determine whether a point is inside a polygon
>>	etc.
>
>I am also interested in any references to this information, as well as
>	intersection of a line and a plane
>	intersection of a line and a sphere
>I would appreciate it if someone could forward any pointers  to 
>such info.  Thanks much in advance.
>
>Alex Brown
>steinmetz!unioncs!brownh


I have a book that consists of formulae and optomized code fragments
for lots of problems like these mentioned:

	"A Programmer's Geometry",
		by Adran Bowyer and John Woodwark
		1983

	Butterworth Publishers
	80 Montvale Avenue
	Stoneham, MA  02180
	(617)438-8464

- Philip Schneider

P.S. For the intersection of a line and a sphere, look at the code in
     just about every ray-tracing program ever written . . . :-)