A note on maximally repeated sub-patterns of a point set

We answer a question raised by Brass on the number of maximally repeated sub-patterns in a set of n points in Rd. We show that this number, which was conjectured to be polynomial, is in fact (2n/2) in the worst case, regardless of the dimension d.

• Type: Journal
• Year: 2006
• Where: DM
• Authors: Véronique Cortier, Xavier Goaoc, Mira Lee, Hyeon-Suk Na
• Keywords: Brass, DM 2006, Polynomial, Worst Case