Proceedings of the Korean Information Science Society Conference (한국정보과학회:학술대회논문집)

  • 2005.11a
  • /
  • Pages.961-963
  • /
  • 2005
  • /
  • 1598-5164(pISSN)
Korean Institute of Information Scientists and Engineers (한국정보과학회)
권호 표지

Maximally repeated sub-patterns of a point set

점집합의 최대 반복 패턴

  • Published : 2005.11.01
Download PDF
⟨ Previous Next ⟩

Abstract

We answer a question raised by P. Brass on the number of maximally repeated sub-patterns in a set of n points in $\mathbb{R}^{d}$. We show that is number, which was conjectured to be polynomial, is in fact $\Theta(2^{\frac{n}{2}})$ in the worst case, regardless of the dimension d.

Keywords