An algorithm to detect the weak-symmetry of a simple polygon

Authors:
Mahmoud Melkemi;Frédéric Cordier;Nickolas S. Sapidis
Affiliations:
Université Haute Alsace, Laboratoire de Mathématiques Informatique et, Mulhouse, France;Université Haute Alsace, Laboratoire de Mathématiques Informatique et, Mulhouse, France;Department of Mechanical Engineering, University of Western Macedonia, Kozani, Greece
Venue:
ICIAR'11 Proceedings of the 8th international conference on Image analysis and recognition - Volume Part I
Year:
2011

Citing 6
Cited 1

Spatial tessellations: concepts and applications of Voronoi diagrams

Spatial tessellations: concepts and applications of Voronoi diagrams
A hough transform technique for the detection of reflectional symmetry and skew-symmetry

Pattern Recognition Letters
Computational Geometry in C

Computational Geometry in C
Robust Detection of Skewed Symmetries

ICPR '00 Proceedings of the International Conference on Pattern Recognition - Volume 3
Technical Section: Sketch-based modeling: A survey

Computers and Graphics
Sketching of Mirror-Symmetric Shapes

IEEE Transactions on Visualization and Computer Graphics

Inferring mirror symmetric 3D shapes from sketches

Computer-Aided Design

Quantified Score

Hi-index	0.00

Visualization

Abstract

This article deals with the problem of detecting the weaksymmetry of a simple polygon. The main application of this work is the automatic reconstruction of 3D polygons (planar or non-planar polylines) symmetric with respect to a plane from free hand sketching 2D polygons. We propose a provable approach to check on the weak-symmetry of a simple polygon. The worst time complexity of the proposed algorithm is O(n3) where n is the number of the vertices of the input polygon.