Abstract
In the fields related to geometric modelling, it is fundamental to count on robust. In this work we present a new algorithm for testing the intersection between a segment and a polygon in 3D space. This algorithm is robust and efficient, and it is the basis of most operations developed in geometric modelling. After, we will apply this algorithm to a classic problem in computer graphics: determining the hidden faces of a scene using the ray-casting algorithm. To solve the problem, an object-oriented approach will be used.
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.
