Anzeige
Erschienen in:
2010 | OriginalPaper | Buchkapitel
The Union of Colorful Simplices Spanned by a Colored Point Set
verfasst von : André Schulz, Csaba D. Tóth
Erschienen in: Combinatorial Optimization and Applications
Verlag: Springer Berlin Heidelberg
Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.
Wählen Sie Textabschnitte aus um mit Künstlicher Intelligenz passenden Patente zu finden. powered by
Markieren Sie Textabschnitte, um KI-gestützt weitere passende Inhalte zu finden. powered by
A simplex spanned by a colored point set in Euclidean
d
-space is
colorful
if all vertices have distinct colors. The union of all full-dimensional colorful simplices spanned by a colored point set is called the
colorful union
. We show that for every
d
∈ ℕ, the maximum combinatorial complexity of the colorful union of
n
colored points in ℝ
d
is between
$\Omega(n^{(d-1)^2})$
and
$O(n^{(d-1)^2}\log n)$
. For
d
= 2, the upper bound is known to be
O
(
n
), and for
d
= 3 we present an upper bound of
O
(
n
4
α
(
n
)), where
α
(·) is the extremely slowly growing inverse Ackermann function. We also prove several structural properties of the colorful union. In particular, we show that the boundary of the colorful union is covered by
O
(
n
d
− 1
) hyperplanes, and the colorful union is the union of
d
+ 1 star-shaped polyhedra. These properties lead to efficient data structures for point inclusion queries in the colorful union.