colin@utcsri.UUCP (Colin Hui) (10/14/85)
I'm looking for software (free) to do hidden line removal in object space.
Ideally this software should be a routine which takes in a list of polygons
in normalize device coordinates and pass back a list of visible polygons.
The speed of the routine is not critical but the correctness is. This
routine should handle concave polygons with an arbitrary number of
vertices. Does anyone in net land know of such a routine in the public
domain or any public domain routines that does hidden line removal whether
it be in object space or image space.
Are there any quick and dirty object space hidden line algorithm which I
can code in a short time? I don't have a lot of time to spend on this.
I have looked at the algorithm by Weiler and Atherton but the article
(Siggraph '79?) was not very clear on the implementation. Has anyone
inplemented this algorithm and/or know of articles describing this
algorithm better?
Does anyone have a clipping routine that clips a polygon against
another?
Any help or pointers would be appreciated by me and countless others
in our lab.
many thanks
colin
UUCP: {decvax,linus,ihnp4,uw-beaver,allegra,utzoo}!utcsrgv!colin
CSNET: colin@torontothomas@utah-gr.UUCP (Spencer W. Thomas) (10/18/85)
Take a look at "Visible Feature Return at Object Resolution" by Sequin
and Wensley in IEEE CG&A, May 1985. You might even be able to get the
code from Berkeley.
--
=Spencer ({ihnp4,decvax}!utah-cs!thomas, thomas@utah-cs.ARPA)
"When wrath runs rampage in your heart you must hold still
that rambunctions tongue!" - Sappho