Relay-Version: version B 2.10 5/3/83; site utzoo.UUCP
Posting-Version: version B 2.10.1 6/24/83; site tty3b.UUCP
Path: utzoo!watmath!clyde!cbosgd!ihnp4!mgnetp!ltuxa!tty3b!lee
From: lee@tty3b.UUCP (1-26-84"Lee Merr 97750)
Newsgroups: net.graphics
Subject: Hidden line problem 'solved'?
Message-ID: <576@tty3b.UUCP>
Date: Fri, 18-Jan-85 18:37:14 EST
Article-I.D.: tty3b.576
Posted: Fri Jan 18 18:37:14 1985
Date-Received: Sat, 19-Jan-85 04:26:46 EST
Organization: Teletype Corp., Skokie, Ill
Lines: 18



In the Jan. 7 issue of then EE times, there is a mention of the hidden line
problem:

"The Evolution Of Software Technology Into A Scientific Discipline"

"Brian Hanratty's solution to the hidden-line problem makes MCS's Anvil 3000
program appear conventionally three-dimensional by removing hidden lines in
2 seconds on a two-dimensional drawing that would otherwise take 4 minutes
using traditional brute-force methods."

The article mentioned that this algorithm appeared about a year ago.  Can
anyone dig up a reference to it, or at least give an outline of the algorithm?

Thanks...

Lee Merrill @ ihnp4!tty3b!lee