Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

An algorithm to find polygon similarity

From MaRDI portal
Publication:582069
Jump to:navigation, search

DOI10.1016/0020-0190(89)90142-7zbMath0689.68034OpenAlexW1995858180MaRDI QIDQ582069

Jayaramaiah Boreddy, R. N. Mukherjee

Publication date: 1989

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

Full work available at URL: https://doi.org/10.1016/0020-0190(89)90142-7


zbMATH Keywords

triangulationaffine transformationsnormalisationsimilarity measurecentroidcyclic permutationcyclically ordered


Mathematics Subject Classification ID

Computing methodologies and applications (68U99) Algorithms in computer science (68W99) Polytopes and polyhedra (52Bxx)


Related Items (1)

On similarity of polynomial configurations



Cites Work

  • An application of pattern matching to a problem in geometrical complexity
  • An improved algorithm to check for polygon similarity
  • On polygon similarity


This page was built for publication: An algorithm to find polygon similarity

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:582069&oldid=12479308"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 30 January 2024, at 08:38.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki