ON SIMILARITY OF POLYNOMIAL CONFIGURATIONS

Authors
RAO NSV LUO C
Citation
Nsv. Rao et C. Luo, ON SIMILARITY OF POLYNOMIAL CONFIGURATIONS, Information processing letters, 47(5), 1993, pp. 231-236
Citations number
16
Categorie Soggetti
Information Science & Library Science","Computer Applications & Cybernetics
Journal title
Information processing letters → ACNP
ISSN journal
00200190
Volume
47
Issue
5
Year of publication
1993
Pages
231 - 236
Database
ISI
SICI code
0020-0190(1993)47:5<231:OSOPC>2.0.ZU;2-C
Abstract
The problem of checking the equivalence of two sets of polynomial curv es (in a plane), each set of total degree n, under the affine transfor mations of translation, rotation, scaling and mirror reflection is stu died. An optimal THETA(n log n) time algorithm for this problem is pre sented. This algorithm is based on efficient computation of Bezier pol ygons by using some polynomial manipulations that employ FFT methods.