Abstract
This paper presents a new geometric hidden-line algorithm applicable to complex three-dimensional vector graphics scenes. The algorithm has advantages of generality, coding simplicity, and is particularly appropriate to parallel processing. The algorithm works accurately for any axonometric or oblique projection and can be adapted to work with the central projection. It applies to any nuimber of three-dimensional polyhedral objects which may have holes partially or fully through them, or other shape complexities. The algorithm does not require any particular ordering of polygon vertices and operates in both object and image space. An application of this algorithm to a computer aided learning package for engineering students is described.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
