The number of vertices in order-k abstract color Voronoi diagrams of n sites with m colors is at most 4k(n−k)−2n, proved via colorful Clarkson–Shor and tight bounds on circular sequences of colored permutations.
38 Evanthia Papadopoulou
1 Pith paper cite this work, alongside 42 external citations. Polarity classification is still indexing.
1
Pith paper citing it
42
external citations · OpenAlex
fields
cs.CG 1years
2026 1verdicts
ACCEPT 1representative citing papers
citing papers explorer
-
Abstract Color Voronoi Diagrams and Circular Sequences of Color Permutations
The number of vertices in order-k abstract color Voronoi diagrams of n sites with m colors is at most 4k(n−k)−2n, proved via colorful Clarkson–Shor and tight bounds on circular sequences of colored permutations.