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

한국정보과학회 (Korean Institute of Information Scientists and Engineers)
권호 표지

점집합의 최대 반복 패턴

Maximally repeated sub-patterns of a point set

  • 발행 : 2005.11.01
PDF 다운로드
⟨ 이전 논문 다음 논문 ⟩

초록

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.

키워드