Abstract
This article presents an efficient and robust algorithm that computes the intersection curve of two ruled surfaces. The surface intersection problem is reformulated as a zero-set finding problem for a bivariate function, which is also equivalent to the construction of an implicit curve in the plane. Each connected component of the surface intersection curve corresponds to a connected component in the zero-set, and vice versa, except for some singular points, redundant solutions, and degenerate cases. We also present algorithms that detect all these singular points, redundant solutions, and degenerate cases.
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.
