We give an easy and efficient algorithm to check whether a given
polynomial f in K[x,y] is a coordinate, where K be a commutative field
of characteristic zero, and if so to compute a coordinate's mate of f. Then we
treat the same problem replacing the ground field K by a unique
factorization domain A of characteristic zero. A notable feature of our
method is that it always produces a mate of minimal degree.
