Path: utzoo!attcan!utgpu!news-server.csri.toronto.edu!rutgers!cs.utexas.edu!wuarchive!udel!boutell
From: boutell@freezer.it.udel.edu (Tom Boutell)
Newsgroups: comp.graphics
Subject: Intersections
Message-ID: <31960@nigel.ee.udel.edu>
Date: 30 Sep 90 18:06:32 GMT
Sender: usenet@ee.udel.edu
Organization: University of Delaware -- ACIT Sun Lab
Lines: 12
Nntp-Posting-Host: maplenut.it.udel.edu

Having failed to find this one in the frequently asked questions cate-
gory, I'm going to go ahead and post it. I need a decent algorithm
for determining the intersections of lines. No, I haven't forgotten
all my algebra (-:, but the standard formulas have something lacking
when one *or* both lines are nearly vertical; the degree of error
tends to be great. Is there an accepted solution to the problem for
integer arithmetic, reliable down to one- pixel accuracy?

-- 
What do you want from the fish of the fish that you fished when you fished
for the fish that you fished? How many numchuks could Chuck chuck if Chuck
could chuck numchuks? boutell@freezer.it.udel.edu? Or 27.598234821? Or not?