Problems and results on geometric patterns
From MaRDI portal
The paper views many classical problems of combinatorial and computational geometry from the angle of geometric pattern recognition. Typically the following questions are asked: What is the maximum number of occurrences of a given pattern among \(n\) points? How does the answer depend on the particular pattern? What is the minimum number of distinct \(k\)-element patterns determined by a set of \(n\) points? The authors also look for efficient algorithms to find all occurrences of a pattern. For the entire collection see [Zbl 1075.05002].
Recommendations
Cited in
(10)- Advances in pattern theory
- Geometric pattern matching reduces to \(k\)-SUM
- On the parameterized complexity of \(d\)-dimensional point set pattern matching
- A note on maximally repeated sub-patterns of a point set
- scientific article; zbMATH DE number 2042236 (Why is no real title available?)
- On the number of similar instances of a pattern in a finite set
- scientific article; zbMATH DE number 3305800 (Why is no real title available?)
- Geometric Pattern Matching Reduces to k-SUM.
- On the maximum number of translates in a point set
- Monochromatic simplices of any volume
This page was built for publication: Problems and results on geometric patterns
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5717951)