基于Minkowski加法的凸多边形反射对称测度的高效计算

Proceedings of 13th International Conference on Pattern Recognition Pub Date : 1996-08-25 DOI:10.1109/ICPR.1996.546824

A. Tuzikov, G. Margolin, H. Heijmans

{"title":"基于Minkowski加法的凸多边形反射对称测度的高效计算","authors":"A. Tuzikov, G. Margolin, H. Heijmans","doi":"10.1109/ICPR.1996.546824","DOIUrl":null,"url":null,"abstract":"This paper introduces a reflection symmetry measure for convex polygons based on Minkowski addition. An interesting property of this measure is that it can be computed in O(k/sup 3/) time, where k is the number of edges of the polygon. The proposed algorithm as well as the symmetry measure computation uses the perimetric measure representation of convex polygons.","PeriodicalId":290297,"journal":{"name":"Proceedings of 13th International Conference on Pattern Recognition","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1996-08-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":"{\"title\":\"Efficient computation of a reflection symmetry measure for convex polygons based on Minkowski addition\",\"authors\":\"A. Tuzikov, G. Margolin, H. Heijmans\",\"doi\":\"10.1109/ICPR.1996.546824\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This paper introduces a reflection symmetry measure for convex polygons based on Minkowski addition. An interesting property of this measure is that it can be computed in O(k/sup 3/) time, where k is the number of edges of the polygon. The proposed algorithm as well as the symmetry measure computation uses the perimetric measure representation of convex polygons.\",\"PeriodicalId\":290297,\"journal\":{\"name\":\"Proceedings of 13th International Conference on Pattern Recognition\",\"volume\":\"1 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1996-08-25\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"4\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings of 13th International Conference on Pattern Recognition\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICPR.1996.546824\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of 13th International Conference on Pattern Recognition","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICPR.1996.546824","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 4

摘要

介绍了一种基于闵可夫斯基加法的凸多边形反射对称测度。这个度量的一个有趣的性质是，它可以在O(k/sup 3/)时间内计算出来，其中k是多边形的边数。该算法和对称测度计算都采用凸多边形的周长测度表示。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

Efficient computation of a reflection symmetry measure for convex polygons based on Minkowski addition

This paper introduces a reflection symmetry measure for convex polygons based on Minkowski addition. An interesting property of this measure is that it can be computed in O(k/sup 3/) time, where k is the number of edges of the polygon. The proposed algorithm as well as the symmetry measure computation uses the perimetric measure representation of convex polygons.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

Proceedings of 13th International Conference on Pattern Recognition

自引率

0.00%

发文量