On finding maximum-cardinality symmetric subsets

DOI10.1016/S0925-7721(02)00046-9zbMath1013.68267OpenAlexW2118513232MaRDI QIDQ1869736

Peter Brass

Publication date: 28 April 2003

Published in: Computational Geometry (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0925-7721(02)00046-9

zbMATH Keywords

symmetry detectionregular polygonsmaximum cardinalitysymmetric subsetspoint patterns

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On detecting spatial regularity in noisy images
• Optimal algorithms for finding the symmetries of a planar point set
• Testing approximate symmetry in the plane is NP-hard
• Distribution of distances and triangles in a point set and algorithms for computing the largest common point sets
• On determining the congruence of point sets in \(d\) dimensions
• Congruence, similarity, and symmetries of geometric objects
• The \(k\) most frequent distances in the plane
• Detection of rotational and involutional symmetries and congruity of polyhedra
• Parallel algorithms for all maximal equally-spaced collinear sets and all maximal regular coplanar lattices
• Testing the congruence of d-dimensional point sets

This page was built for publication: On finding maximum-cardinality symmetric subsets