On similarity of polynomial configurations

DOI10.1016/0020-0190(93)90132-SzbMath0797.68157OpenAlexW2004423313MaRDI QIDQ688225

Nageswara S. V. Rao, Ching Luo

Publication date: 28 November 1993

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0190(93)90132-s

zbMATH Keywords

fast Fourier transformsaffine transformationspolynomial configurationsBezier polygons

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Numerical aspects of computer graphics, image analysis, and computational geometry (65D18) Numerical methods for discrete and fast Fourier transforms (65T50)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• An algorithm to find polygon similarity
• Data structures and algorithms for approximate string matching
• Parallel construction of a suffix tree with applications
• An improved algorithm to check for polygon similarity
• On polygon similarity
• Parallel Merge Sort
• Complexity of Computations with Matrices and Polynomials
• An optimal algorithm for geometrical congruence