Polygonal shape reconstruction in the plane

被引:17
|
作者
Gheibi, A. [1 ]
Davoodi, M. [1 ]
Javad, A. [1 ]
Panahi, F. [1 ]
Aghdam, M. M. [1 ]
Asgaripour, M. [1 ]
Mohades, A. [1 ]
机构
[1] Amir Kabir Univ Technol, Lab Algorithms & Computat Geometry, Math & Comp Sci Dept, Tehran, Iran
关键词
POINTS; SET; PATTERN; CRUST;
D O I
10.1049/iet-cvi.2009.0079
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
In this study a robust shape reconstruction algorithm is proposed which guarantees a simple polygon as output and works well on both types of input, dot patterns and boundary samples, in the plane. Guaranteed polygonal output makes it favourable for many applications because of its ease of manipulation and use. The proposed algorithm, called simple-shape, starts reconstruction from the convex hull and makes it concave step by step based on a new hybrid selection criterion which is built on human beings visual perception. Also at the end, a simple-shape algorithm is tested in several cases and the results are compared with the latest shape reconstruction algorithm in the literature.
引用
收藏
页码:97 / 106
页数:10
相关论文
共 50 条
  • [21] PERSISTENCE OF POLYGONAL HARMONICS AS SHAPE DESCRIPTORS
    HURTER, P
    CLARK, NN
    PARTICLE CHARACTERIZATION, 1987, 4 (03): : 101 - 105
  • [22] A theory of fracture with a polygonal shape crack
    Mura, T
    SMALL FATIGUE CRACKS: MECHANICS, MECHANISMS, AND APPLICATIONS, 1999, : 3 - 15
  • [23] Computing the eccentricity transform of a polygonal shape
    Kropatsch, Walter G.
    Ion, Adrian
    Peltier, Samuel
    PROGRESS IN PATTERN RECOGNITION, IMAGE ANALYSIS AND APPLICATIONS, PROCEEDINGS, 2007, 4756 : 291 - 300
  • [24] Polygonal Shape Blending with Topological Evolutions
    Li-Gang Liu
    Bo Zhang
    Bai-Ning Guo
    Heung-Yeung Shum
    Journal of Computer Science and Technology, 2005, 20 : 77 - 89
  • [25] Polygonal shape blending with topological evolutions
    Liu, LG
    Zhang, B
    Gu, BN
    Shum, HY
    JOURNAL OF COMPUTER SCIENCE AND TECHNOLOGY, 2005, 20 (01) : 77 - 89
  • [26] Nonholonomic distance to polygonal obstacles for a car-like robot of polygonal shape
    Giordano, Paolo Robuffo
    Vendittelli, M.
    Laumond, Jean-Paul
    Soueres, Philippe
    IEEE TRANSACTIONS ON ROBOTICS, 2006, 22 (05) : 1040 - 1047
  • [27] Routing Among Convex Polygonal Obstacles in the Plane
    Inkulu, R.
    Kumar, Pawan
    COMBINATORIAL OPTIMIZATION AND APPLICATIONS, COCOA 2021, 2021, 13135 : 1 - 11
  • [28] Formation of superscar waves in plane polygonal billiards
    Bogomolny, Eugene
    JOURNAL OF PHYSICS COMMUNICATIONS, 2021, 5 (05):
  • [29] PLANE-WAVE QUANTIZATION FOR POLYGONAL BILLIARDS
    VEGA, JL
    UZER, T
    FORD, J
    PHYSICAL REVIEW E, 1995, 52 (02): : 1490 - 1496
  • [30] SHORTEST PATHS IN THE PLANE WITH CONVEX POLYGONAL OBSTACLES
    ROHNERT, H
    INFORMATION PROCESSING LETTERS, 1986, 23 (02) : 71 - 76