Abstract
An algorithmic method is presented for computing all the affine equivalences between two rational ruled surfaces defined by rational parametrizations. The algorithm works directly in parametric rational form, i.e. without computing or making use of the implicit equation of the surface. The method translates the problem into parameter space, and relies on polynomial system solving. Geometrically, the problem is related to finding the projective equivalences between two projective curves (corresponding to the directions of the rulings of the surfaces). This problem was recently addressed in a paper by Hauer and Jüttler, and we exploit the ideas by these authors in the algorithm presented in this paper. The general idea for affine equivalences is adapted to computing the isometries between two rational ruled surfaces, and the symmetries of a given rational ruled surface. The efficiency of the method is shown through several examples.
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.
