Computation of symmetries of rational surfaces

In this paper, we provided, first, a general symbolic algorithm for computing the symmetries of a given rational surface, based on the classical differential invariants of surfaces, i.e., Gauss curvature and mean curvature. In practice, the algorithm works well for sparse parametrizations (e.g., toric surfaces) and PN surfaces. Additionally, we provided a specific, and symbolic, algorithm for computing the symmetries of ruled surfaces. This algorithm works extremely well in practice, since the problem is reduced to that of rational space curves, which can be efficiently solved by using existing methods. The algorithm for ruled surfaces is based on the fact, proven in the paper, that every symmetry of a rational surface must also be a symmetry of its line of striction, which is a rational space curve. The algorithms have been implemented in the computer algebra system Maple, and the implementations have been made public. Evidence of their performance is given in the paper.