Path: utzoo!news-server.csri.toronto.edu!rpi!zaphod.mps.ohio-state.edu!pacific.mps.ohio-state.edu!linac,att!emory!wuarchive!udel!haven!adm!smoke!gwyn
From: gwyn@smoke.brl.mil (Doug Gwyn)
Newsgroups: comp.lang.c
Subject: Re: Efficient algorithm needed
Message-ID: <15505@smoke.brl.mil>
Date: 18 Mar 91 19:36:04 GMT
References: <2538@odin.cs.hw.ac.uk> <4987@goanna.cs.rmit.oz.au> <27497@uflorida.cis.ufl.EDU>
Organization: U.S. Army Ballistic Research Laboratory, APG, MD.
Lines: 9

In article <27497@uflorida.cis.ufl.EDU> jdb@reef.cis.ufl.edu (Brian K. W. Hook) writes:
>I am working on a Windows 3.0 version of XEYES and need a very fast and not
>necessarily accurate algorithm for determining the following: ...

Why don't you instead adapt my public-domain code for the Blit (DMD/MTG)
"eyes"?  It works very nicely, better than "xeyes", and the code is much
simpler due to the Blit being cleaner than X11.

Send me email to request a copy of the "eyes" source.