On finding maximum-cardinality symmetric subsets
type: Item
instance of: scholarly article
title: On finding maximum-cardinality symmetric subsets
zbMATH Open document ID: 1013.68267
DOI: 10.1016/S0925-7721(02)00046-9
published in: Computational Geometry
publication date: 2003-04-28T00:00:00Z
Mathematics Subject Classification ID: 68U05
zbMATH DE Number: 1902827
zbMATH Keywords: point patterns
zbMATH Keywords: symmetry detection
zbMATH Keywords: symmetric subsets
zbMATH Keywords: regular polygons
zbMATH Keywords: maximum cardinality
author: Peter Brass
MaRDI profile type: Publication
cites work: On determining the congruence of point sets in \(d\) dimensions
cites work: Distribution of distances and triangles in a point set and algorithms for computing the largest common point sets
cites work: Congruence, similarity, and symmetries of geometric objects
cites work: Parallel algorithms for all maximal equally-spaced collinear sets and all maximal regular coplanar lattices
cites work: Q2753928
cites work: Testing the congruence of d-dimensional point sets
cites work: Q3814808
cites work: Q3782807
cites work: Q4328181
cites work: Optimal algorithms for finding the symmetries of a planar point set
cites work: Testing approximate symmetry in the plane is NP-hard
cites work: Detection of rotational and involutional symmetries and congruity of polyhedra
cites work: Q5689017
cites work: Q4339095
cites work: On detecting spatial regularity in noisy images
cites work: The \(k\) most frequent distances in the plane
full work available at URL: s0925-7721(02)00046-9
OpenAlex ID: W2118513232
description: scientific article; zbMATH DE number 1902827