Abstract

This paper presents an accurate and efficient method for the computation of both point projection and inversion onto Bezier surfaces. First, these two problems are formulated in terms of solution of a polynomial equation with u and v variables expressed in the Bernstein basis. Then, based on subdivision of the Bezier surface and the recursive quadtree decomposition, a novel solution method is proposed. The computation of point projection is shown to be equivalent to the geometrically intuitive intersection of asurface with the u-ν plane. Finally, by comparing the distances between the test point and the candidate points, the closest point is found. Examples illustrate the feasibility of this method.

Full Text
Paper version not known

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 call

Disclaimer: 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.