Abstract
A simple and efficient hidden surface algorithm for the visualization of polyhedric solids is presented and discussed. The determination of the relative position between two planes of the model is performed by using optimized techniques of bit masks. The drawing planes sequence is established through partial order relations of the model planes, which are assigned by using a node graph. The computational code developed is written in Pascal and is run on personal computers (IBM or compatible). The performance of the proposed algorithm is shown by its application to some finite and boundary element models.
Sign-in/Register to access full text options 
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.
