Abstract
Abstract In general, two quadric surfaces intersect in a space quartic curve. However, the intersection curve frequently degenerates to a collection of planar curves. These degenerate cases are often required by design. For example, to blend two cones with a Dupin cyclide or a quadric surface, the cones must have planar intersection. Moreover, degeneracies normally introduce problems into the general intersection algorithms and are difficult to implement in a reliable way. In this paper, we shall present a fast and robust algorithm to detect and compute the planar intersection curves, as well as a technique to find the types of the curves without actually computing them.
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.
