[Search for users]
[Overall Top Noters]
[List of all Conferences]
[Download this site]
| Title: | Mathematics at DEC | 
|  | 
| Moderator: | RUSURE::EDP | 
|  | 
| Created: | Mon Feb 03 1986 | 
| Last Modified: | Fri Jun 06 1997 | 
| Last Successful Update: | Fri Jun 06 1997 | 
| Number of topics: | 2083 | 
| Total number of notes: | 14613 | 
748.0. "Blanking on 3-D plots." by CSC32::RODAS () Tue Aug 11 1987 10:49
    In an attempt to re-write was has been written, no doubt, a thousand
    times before, I am looking for an alogrythm to do blanking on a
    3-D plotting routine.  I.E. How to determine which point on a plot
    would not be seen given some projection.  I can determine whether
    a point can be seen, but what is nessary is to calculate the
    intersection between the horizon on the plot and the diminishing
    line. 
    
    				Thanks for the help.
    						Pete
    
| T.R | Title | User | Personal Name
 | Date | Lines | 
|---|
| 748.1 | A book... | SDOGUS::DRAKE | Dave (Diskcrash) Drake 619-292-1818 | Sat Aug 15 1987 03:13 | 5 | 
|  |     A good reference book, that has code examples...
    Interactive Microcomputer Graphics
    Chan S. Park
    Addison-Wesley 1985
    ISBN 0-201-05541-4
 |