A new measure for the rectilinearity of polygons

被引:0
|
作者
Zunic, J [1 ]
Rosin, PL [1 ]
机构
[1] Cardiff Univ, Dept Comp Sci, Cardiff, S Glam, Wales
来源
VISION GEOMETRY XI | 2002年 / 4794卷
关键词
shape; polygons; rectilinearity; measurement;
D O I
10.1117/12.453591
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
A polygon P is said to be rectilinear if all interior angles of P belong to the set {pi/2, 3pi/2}. In this paper we establish the mapping R(P) = (pi)/(pi - 2 . root2) (.) ((max)(alphais an element of[0,2pi]) (P)((P,alpha)(1))/(root2 .P2(P) -) (2 . root2)/(pi) where P is an arbitrary polygon, P-2(P) denotes the Euclidean perimeter of P, while P-1(P, alpha) is the perimeter in the sense of l(1) metrics of the polygon obtained by the rotation of P by angle a with the origin as the center of the applied rotation. It turns out that R(P) can be used as an estimate for the rectilinearity of P. Precisely, R(P) has the following desirable properties: any polygon P has the estimated rectilinearity R(P) which is a number from [0, 1]; R(P)=1 if and only if P is a rectilinear polygon; inf R(P) (Pis an element ofII) = 0, where II denotes the set of all polygons; a polygon's rectilinearity measure is invariant under similarity transformations. The proposed rectilinearity measure can be an alternative for the recently described measure R-1(P).(1) Those rectilinearity measures are essentially different since there is no monotonic function f, such that f (R-1(P)) = R(P), that holds for all P is an element of Pi. A simple procedure for computing R(P) for a given polygon P is described as well.
引用
收藏
页码:81 / 91
页数:11
相关论文
共 50 条
  • [21] The second Vassiliev measure of uniform random walks and polygons in confined space
    Smith, Philip
    Panagiotou, Eleni
    JOURNAL OF PHYSICS A-MATHEMATICAL AND THEORETICAL, 2022, 55 (09)
  • [22] A new algorithm for identifying polygons' orientation
    Ding, Jian
    Jiang, Nan
    Rui, Ting
    Jisuanji Gongcheng/Computer Engineering, 2006, 32 (09): : 47 - 50
  • [23] A new algorithm for watermarking building polygons
    Wu Baiyan
    Wang Wei
    Peng Zhiyong
    Du Daosheng
    ICDIP 2009: INTERNATIONAL CONFERENCE ON DIGITAL IMAGE PROCESSING, PROCEEDINGS, 2009, : 366 - +
  • [24] RAYS - NEW REPRESENTATION FOR POLYGONS AND POLYHEDRA
    FRANKLIN, WR
    COMPUTER VISION GRAPHICS AND IMAGE PROCESSING, 1983, 22 (03): : 327 - 338
  • [25] Nothing New about Equiangular Polygons
    Woeginger, Gerhard J.
    AMERICAN MATHEMATICAL MONTHLY, 2013, 120 (09): : 849 - 850
  • [26] New Results on Visibility in Simple Polygons
    Gilbers, Alexander
    Klein, Rolf
    ALGORITHMS AND DATA STRUCTURES, 2009, 5664 : 327 - 338
  • [27] A NEW MEASURE FOR MEASURE
    WRIGHT, A
    COAL AGE, 1984, 89 (03): : 50 - 52
  • [28] METROLOGICAL PROVISIONS FOR MONITORING RECTILINEARITY AND PLANARITY
    MEDYANTSEVA, LL
    GORBACHEVA, VV
    MEASUREMENT TECHNIQUES, 1976, 19 (02) : 221 - 223
  • [29] Wrapping polygons in polygons
    Antonio Pasini
    Giustina Pica
    Annals of Combinatorics, 1998, 2 (4) : 325 - 349
  • [30] A NEW LINEAR ALGORITHM FOR INTERSECTING CONVEX POLYGONS
    OROURKE, J
    CHIEN, CB
    OLSON, T
    NADDOR, D
    COMPUTER GRAPHICS AND IMAGE PROCESSING, 1982, 19 (04): : 384 - 391