On finding maximum-cardinality symmetric subsets
From MaRDI portal
Publication:1869736
DOI10.1016/S0925-7721(02)00046-9zbMATH Open1013.68267OpenAlexW2118513232MaRDI QIDQ1869736FDOQ1869736
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
Cites Work
- Title not available (Why is that?)
- Congruence, similarity, and symmetries of geometric objects
- On detecting spatial regularity in noisy images
- Parallel algorithms for all maximal equally-spaced collinear sets and all maximal regular coplanar lattices
- On determining the congruence of point sets in \(d\) dimensions
- Testing approximate symmetry in the plane is NP-hard
- Detection of rotational and involutional symmetries and congruity of polyhedra
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Testing the congruence of d-dimensional point sets
- Distribution of distances and triangles in a point set and algorithms for computing the largest common point sets
- Optimal algorithms for finding the symmetries of a planar point set
- The \(k\) most frequent distances in the plane
- Title not available (Why is that?)
- Title not available (Why is that?)
Cited In (4)
Recommendations
- Title not available (Why is that?) π π
- 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 π π
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)