Simplification of surface parametrizations --a lattice polygon approach
In an earlier paper of the author [Proc. ISSAC 2002, ACM Press, New York, pp. 229--237 (2002)], an algorithm was given that produces a reparametrization which is at most twice as large as the smallest possible reparametrization. In the present paper, the author specializes, the algorithm to the case of toric surfaces and describes it for this case by operations on lattice polygons.
scientific article; zbMATH DE number 2093529