{"title":"A model for polygon similarity estimation","authors":"D. Cakmakov, V. Arnautovski, D. Davcev","doi":"10.1109/CMPEUR.1992.218449","DOIUrl":null,"url":null,"abstract":"A model for polygon similarity estimation is presented. The advantages of the model are that it introduces a numerical measure of similarity between two polygons; it can be applied for all polygon forms and any number of vertices; and it gives acceptable intuitively interpreted results even in the cases of great differences in the number of polygon vertices. The model has been tested in a large number of experiments. The discussion is restricted to simple planar polygons, i.e., those polygons whose edges do not intersect themselves and whose vertices are represented by ordered pairs of Cartesian coordinates.<<ETX>>","PeriodicalId":390273,"journal":{"name":"CompEuro 1992 Proceedings Computer Systems and Software Engineering","volume":"28 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1992-05-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"CompEuro 1992 Proceedings Computer Systems and Software Engineering","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CMPEUR.1992.218449","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 4
Abstract
A model for polygon similarity estimation is presented. The advantages of the model are that it introduces a numerical measure of similarity between two polygons; it can be applied for all polygon forms and any number of vertices; and it gives acceptable intuitively interpreted results even in the cases of great differences in the number of polygon vertices. The model has been tested in a large number of experiments. The discussion is restricted to simple planar polygons, i.e., those polygons whose edges do not intersect themselves and whose vertices are represented by ordered pairs of Cartesian coordinates.<>