Elsevier

Pattern Recognition Letters

Volume 14, Issue 9, September 1993, Pages 703-705
Pattern Recognition Letters

The m-core properly contains the m-divisible points in space

https://doi.org/10.1016/0167-8655(93)90138-4Get rights and content

Abstract

A point x in ®d is an m-divisible point of a finite set of n points S ⊂ ®d if x is contained in conv Sb i=1, …, m, for some partition S=S1OS2OOSm of S. Let Dm (S) denote the set of m-divisible points of S. We say x is the m-core of S if each closed half-space containing x also contains at least m points of S. Let Cm(S) denote the set of points in the m-core. Reay, Sierksma and others have conjectured that conv Dm(S)=Cm(S). In this note we give a counterexample for n=9, d=3, m=3. The conjecture is known to be true for d=2.

References (9)

  • B Birch

    On 3N points in a plane

  • M Breen

    Primitive Radon partitions for cyclic polytopes

    Israel J. Math.

    (1973)
  • J Caron

    MSc. Project

    (1990)
  • K Kolodziejczyk

    Two constructional problems in aligned spaces

    Zastos. Mat. (Appl. Math.)

    (1987)
There are more references available in the full text version of this article.

Cited by (12)

View all citing articles on Scopus

Research supported by NSERC grant No. A3013, NSERC/JSPS Bilateral Exchange Program and FCAR grant No. EQ 1678.

View full text