Polygonal shape reconstruction in the plane

Polygonal shape reconstruction in the plane

For access to this article, please select a purchase option:

Buy article PDF
(plus tax if applicable)
Buy Knowledge Pack
10 articles for £75.00
(plus taxes if applicable)

IET members benefit from discounts to all IET publications and free access to E&T Magazine. If you are an IET member, log in to your account and the discounts will automatically be applied.

Learn more about IET membership 

Recommend Title Publication to library

You must fill out fields marked with: *

Librarian details
Your details
Why are you recommending this title?
Select reason:
IET Computer Vision — Recommend this title to your library

Thank you

Your recommendation has been sent to your librarian.

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.


    1. 1)
      • R.O. Duda , P.E. Hart . (1973) Pattern classification and scene analysis.
    2. 2)
      • O. Faugeras . (1999) Three-dimensional computer vision: a geometric viewpoint.
    3. 3)
      • Chassery, J.M., Montanvert, A.: `Geometric representation of shapes and objects for visual perception', Geometric reasoning for perception and action, selected papers presented in a Workshop held at Grenoble, 16–17 September 1991, France, p. 163–182.
    4. 4)
    5. 5)
    6. 6)
    7. 7)
    8. 8)
    9. 9)
    10. 10)
    11. 11)
    12. 12)
    13. 13)
    14. 14)
    15. 15)
      • D.G. Kirkpatrick , J.D. Radke , G. Toussaint . (1998) A framework for computational morphology computational geometry.
    16. 16)
    17. 17)
    18. 18)
    19. 19)
      • J. O'Rourke . (1994) Computational geometry in C.
    20. 20)
      • M. de Berg , M. van Kreveld , M. Overmars , O. Schwarzkopf . (1997) Computational geometry: algorithms and applications.
    21. 21)
      • J. Edmonds . (1960) A combinatorial representation for polyhedral surfaces.

Related content

This is a required field
Please enter a valid email address