On finding maximum-cardinality symmetric subsets

DOI10.1016/S0925-7721(02)00046-9zbMATH Open1013.68267OpenAlexW2118513232MaRDI QIDQ1869736FDOQ1869736

Authors 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)

Recommendations

• scientific article; zbMATH DE number 1786503
• Optimal algorithms for finding the symmetries of a planar point set
• Point sets with distinct distances
• A note on maximally repeated sub-patterns of a point set
• Optimal algorithms for symmetry detection in two and three dimensions

Cites work

• scientific article; zbMATH DE number 1670651 (Why is no real title available?)
• scientific article; zbMATH DE number 4045185 (Why is no real title available?)
• scientific article; zbMATH DE number 4085021 (Why is no real title available?)
• scientific article; zbMATH DE number 739015 (Why is no real title available?)
• scientific article; zbMATH DE number 1017008 (Why is no real title available?)
• scientific article; zbMATH DE number 970812 (Why is no real title available?)
• Congruence, similarity, and symmetries of geometric objects
• Detection of rotational and involutional symmetries and congruity of polyhedra
• Distribution of distances and triangles in a point set and algorithms for computing the largest common point sets
• On detecting spatial regularity in noisy images
• On determining the congruence of point sets in \(d\) dimensions
• Optimal algorithms for finding the symmetries of a planar point set
• Parallel algorithms for all maximal equally-spaced collinear sets and all maximal regular coplanar lattices
• Testing approximate symmetry in the plane is NP-hard
• Testing the congruence of d-dimensional point sets
• The \(k\) most frequent distances in the plane

Cited in

(4)

• scientific article; zbMATH DE number 1786503 (Why is no real title available?)
• Maximizing the Number of Nonnegative Subsets
• On a conjecture on the symmetric hit problem
• Finding large co-Sidon subsets in sets with a given additive energy

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1869736)