A Reflective Symmetry Descriptor
ECCV '02 Proceedings of the 7th European Conference on Computer Vision-Part II
Planar Symmetry Detection by Random Sampling and Voting Process
Proceedings of the Joint IAPR International Workshops on Advances in Pattern Recognition
On Finding Maximum-Cardinality Symmetric Subsets
JCDCG '00 Revised Papers from the Japanese Conference on Discrete and Computational Geometry
Exact Point Pattern Matching and the Number of Congruent Triangles in a Three-Dimensional Pointset
ESA '00 Proceedings of the 8th Annual European Symposium on Algorithms
Using phase information for symmetry detection
Pattern Recognition Letters
ACM SIGGRAPH 2007 papers
Folding meshes: hierarchical mesh segmentation based on planar symmetry
SGP '06 Proceedings of the fourth Eurographics symposium on Geometry processing
Symmetry-enhanced remeshing of surfaces
SGP '07 Proceedings of the fifth Eurographics symposium on Geometry processing
Reflective Symmetry Detection Based on Parallel Projection
ICANNGA '07 Proceedings of the 8th international conference on Adaptive and Natural Computing Algorithms, Part II
Islamic geometrical patterns indexing and classification using discrete symmetry groups
Journal on Computing and Cultural Heritage (JOCCH)
Consensus Graphs for Symmetry Plane Estimation
SSPR & SPR '08 Proceedings of the 2008 Joint IAPR International Workshop on Structural, Syntactic, and Statistical Pattern Recognition
Symmetric reconstruction algorithms for incomplete 3D models
International Journal of Computer Applications in Technology
A new possibility for pattern recognition independently from geometrical measuresetrical measures
ICOSSSE'08 Proceedings of the 7th WSEAS international conference on System science and simulation in engineering
Computer Methods and Programs in Biomedicine
Partial intrinsic reflectional symmetry of 3D shapes
ACM SIGGRAPH Asia 2009 papers
Testing for image symmetries: with application to confocal microscopy
IEEE Transactions on Information Theory
Analysis tool for cataloguing textile and tile pattern designs
ICCSA'03 Proceedings of the 2003 international conference on Computational science and its applications: PartIII
Full and Partial Symmetries of Non-rigid Shapes
International Journal of Computer Vision
Best Nonspherical Symmetric Low Rank Approximation
SIAM Journal on Matrix Analysis and Applications
Proceedings of the International Symposium on Computational Aesthetics in Graphics, Visualization, and Imaging
A computational model for pattern and tile designs classification using plane symmetry groups
CIARP'05 Proceedings of the 10th Iberoamerican Congress conference on Progress in Pattern Recognition, Image Analysis and Applications
Fundamental region based indexing and classification of islamic star pattern images
ICIAR'06 Proceedings of the Third international conference on Image Analysis and Recognition - Volume Part II
Symmetry recognition in group-theoretic computational schemes for complex structural systems
Computers and Structures
Automatically detecting symmetries in decorative tiles
ICIAR'05 Proceedings of the Second international conference on Image Analysis and Recognition
Shape palindromes: analysis of intrinsic symmetries in 2d articulated shapes
SSVM'11 Proceedings of the Third international conference on Scale Space and Variational Methods in Computer Vision
A novel algorithm for an image processing system in entomology
Proceedings of the Fifth Balkan Conference in Informatics
Parallel reflective symmetry transformation for volume data
EG PGV'07 Proceedings of the 7th Eurographics conference on Parallel Graphics and Visualization
A feature-based method of rapidly detecting global exact symmetries in CAD models
Computer-Aided Design
| Hi-index | 15.04 |
A straight line is an axis ofsymmetry of a planar figure if the figure is invariant to reflection with respect to that line. The purpose of this correspondence is to describe an O( n log n) time algorithm for enumerating all the axes of symmetry of a planar figure which is made up of (possibly intersecting) segments, circles, points, etc. The solution involves a reduction of the problem to a combinatorial question on words. Our algorithm is optimal since we can establish an O(n log n) time lower bound for this problem.