Abstract
An algorithm for obtaining a piecewise planar approximation of a trimmed nurbs surface is presented. Given a model space tolerance ε. the algorithm triangulates the parameter space domain of the trimmed surface such that the 3D planar approximation, obtained by mapping 2D triangles onto the surface, deviates from the trimmed surface by no more than ε. The number of triangles computed in parameter space depends on the bounds of the second derivatives. A detailed discussion of the algorithm and a practical error analysis of the tessellation are provided.
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.
