The critical point and related symmetry measures of a planar convex set

被引:1
|
作者
Kaiser, MJ [1 ]
机构
[1] AMER UNIV ARMENIA,DEPT IND ENGN,YEREVAN 375019,ARMENIA
关键词
affine invariant points; computational convex geometry; critical point; symmetry measures;
D O I
10.1016/0898-1221(96)00179-4
中图分类号
O29 [应用数学];
学科分类号
070104 ;
摘要
The critical point and related invariant points of a planar convex set are computed using an exhaustive search strategy based on a formulation due to Neumann. Algorithms to compute the critical point based on the Minkowski formulation and Euclidean duality is also presented. The functionals associated with the critical points are illustrated, and computational experience lends support to a conjecture due to Neumann in regard to the lower bound of a perimeter functional. Related symmetry measures based on cut areas and chords are also examined.
引用
收藏
页码:79 / 98
页数:20
相关论文
共 50 条
  • [41] CONVEX POLYGONS DETERMINED BY A FINITE PLANAR SET
    BONNICE, WE
    AMERICAN MATHEMATICAL MONTHLY, 1974, 81 (07): : 749 - 752
  • [42] The geometry of the centre symmetry set of a planar curve
    Miller, Dominika
    Zwierzynski, Michal
    JOURNAL OF TOPOLOGY AND ANALYSIS, 2024,
  • [43] On the Symmetry of a Convex Polyhedron in a Translational Point Multilattice
    Shtogrin, M. I.
    PROCEEDINGS OF THE STEKLOV INSTITUTE OF MATHEMATICS, 2024, 325 (01) : 304 - 313
  • [44] Symmetry and the farthest point mapping on convex surfaces
    Vilcu, Costin
    Zamfirescu, Tudor
    ADVANCES IN GEOMETRY, 2006, 6 (03) : 379 - 387
  • [45] Adaptive Point Location in Planar Convex Subdivisions
    Cheng, Siu-Wing
    Lau, Man-Kit
    ALGORITHMS AND COMPUTATION, ISAAC 2015, 2015, 9472 : 14 - 22
  • [46] Empty Convex Hexagons in Planar Point Sets
    Tobias Gerken
    Discrete & Computational Geometry, 2008, 39 : 239 - 272
  • [47] Empty convex hexagons in planar point sets
    Gerken, Tobias
    DISCRETE & COMPUTATIONAL GEOMETRY, 2008, 39 (1-3) : 239 - 272
  • [48] COUNTING CONVEX POLYGONS IN PLANAR POINT SETS
    MITCHELL, JSB
    ROTE, G
    SUNDARAM, G
    WOEGINGER, G
    INFORMATION PROCESSING LETTERS, 1995, 56 (01) : 45 - 49
  • [49] An interior-point method for minimizing convex functions on the convex hull of a point set
    Stoer, Josef
    Botkin, Nikolai D.
    Pykhteev, Oleg A.
    OPTIMIZATION, 2007, 56 (04) : 515 - 524
  • [50] On the number of rectangulations of a planar point set
    Ackerman, Eyal
    Barequet, Gill
    Pinter, Ron Y.
    JOURNAL OF COMBINATORIAL THEORY SERIES A, 2006, 113 (06) : 1072 - 1091