Shape based circularity measures of planar point sets

被引:0
|
作者
Stojmenovic, Milos [1 ]
Nayak, Amiya [1 ]
机构
[1] Univ Ottawa, SITE, Ottawa, ON K1N 6N5, Canada
关键词
D O I
暂无
中图分类号
TP39 [计算机的应用];
学科分类号
081203 ; 0835 ;
摘要
We are interested in circularity measures which are invariant to rotation, scaling, and translation, are calculated very quickly and are resistant to protrusions in the data set. We propose several measures here, a of which are based on existing linearity measures that have been adapted to measure circularity. In order to make use of these linearity measures, we transfer the Cartesian coordinates of the input set into polar coordinates. The linearity of the polar coordinate set corresponds to the circularity of the original input set given a suitable center. We separately consider the circularity of ordered and unordered point sets. The circularity of unordered data is determined directly from the linearity measure, whereas the circularity of ordered data is derived by multiplying the unordered data circularity measure by a monotonicity factor. We discuss two ways of determining the center of the shape. The circularity measures are tested on a set of 25 curves. The proposed algorithms work on both open and closed curves, whereas all competing algorithms (except one) are linked with exclusively closed curves. The measures were compared with human measurements of circularity of the same set The new methods are have been found to best correspond to human perceptions.
引用
收藏
页码:1279 / 1282
页数:4
相关论文
共 50 条
  • [31] Open Caps and Cups in Planar Point Sets
    Pavel Valtr
    Discrete & Computational Geometry, 2007, 37 : 565 - 576
  • [32] On the number of radial orderings of planar point sets
    1600, Discrete Mathematics and Theoretical Computer Science (16):
  • [33] Trapezoids and Deltoids in Wide Planar Point Sets
    Gy. Elekes
    Graphs and Combinatorics, 2019, 35 : 569 - 578
  • [34] Trapezoids and Deltoids in Wide Planar Point Sets
    Elekes, Gy.
    GRAPHS AND COMBINATORICS, 2019, 35 (03) : 569 - 578
  • [35] COUNTING CONVEX POLYGONS IN PLANAR POINT SETS
    MITCHELL, JSB
    ROTE, G
    SUNDARAM, G
    WOEGINGER, G
    INFORMATION PROCESSING LETTERS, 1995, 56 (01) : 45 - 49
  • [36] Vietoris–Rips Complexes of Planar Point Sets
    Erin W. Chambers
    Vin de Silva
    Jeff Erickson
    Robert Ghrist
    Discrete & Computational Geometry, 2010, 44 : 75 - 90
  • [37] A note on universal point sets for planar graphs
    Scheucher M.
    Schrezenmaier H.
    Steiner R.
    Journal of Graph Algorithms and Applications, 2020, 24 (03) : 247 - 267
  • [38] On crossing-families in planar point sets
    Aichholzer, Oswin
    Kyncl, Jan
    Scheucher, Manfred
    Vogtenhuber, Birgit
    Valtr, Pavel
    COMPUTATIONAL GEOMETRY-THEORY AND APPLICATIONS, 2022, 107
  • [39] MEASURES: BACK AND FORTH BETWEEN POINT SETS AND LARGE SETS
    Goldring, Noa
    BULLETIN OF SYMBOLIC LOGIC, 1995, 1 (02) : 170 - 188
  • [40] A non-parametric approach to shape reconstruction from planar point sets through Delaunay filtering
    Peethambaran, Jiju
    Muthuganapathy, Ramanathan
    COMPUTER-AIDED DESIGN, 2015, 62 : 164 - 175