多边形相似度估计模型

D. Cakmakov, V. Arnautovski, D. Davcev
{"title":"多边形相似度估计模型","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":"{\"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}","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

摘要

提出了一种多边形相似度估计模型。该模型的优点是引入了两个多边形之间相似度的数值度量;它可以应用于所有多边形形式和任意数量的顶点;即使在多边形顶点数量差异很大的情况下,它也能给出可接受的直观解释结果。该模型已在大量实验中得到验证。讨论仅限于简单的平面多边形,即那些边缘不相交且顶点由有序的笛卡尔坐标对表示的多边形。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
A model for polygon similarity estimation
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.<>
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Neural clustering algorithms for classification and pre-placement of VLSI cells General-to-specific learning of Horn clauses from positive examples Minimization of NAND circuits by rewriting-rules heuristic A generalized stochastic Petri net model of Multibus II Activation of connections to accelerate the learning in recurrent back-propagation
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1