Abstract
The computational requirements and accuracy of two methods for finding the intersection of Bezier surfaces are examined. In both methods, the existence of an intersection curve is confirmed by using the convex hull property of such surfaces. The first method evaluates the intersection by recursive subdivision of two patches with overlapping hulls. The second method detects a point on the intersection curve and then incrementally traces the intersection in the parametric spaces of the two surfaces. With both methods, the intersection of a pair of first-order planar patches must be solved analytically. The intersection is approximated by first-order Bezier patches in the first case and by planar triangles in the second. Overall, the method of incremental tracing is shown to give more accurate results than the method of recursive subdivision.< <ETX xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">></ETX>
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.
