BBBrad Ballinger
Brad Ballinger
*This is an algorithmically generated author record based on publicly available information.
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Brad Ballinger has a total of 10 co-authors. Here are the top co-authors by number of shared publications:
- Attila Pór
Department of Mathematics, Western Kentucky University, Bowling Green, USA
3 shared publications - David R. Wood
Monash University, Melbourne, Australia
3 shared publications - Stefan Langerman
Computer Science Department Université Libre de Bruxelles Belgium
3 shared publications - Sébastien Collette
Universite Libre de Bruxelles
3 shared publications - Greg Aloupis
Universite Libre de Bruxelles
2 shared publications - Fiama Pierina Orejuela Hurtado
Departament de Matemàtica Aplicada II Universitat Politècnica de Catalunya Barcelona Spain
1 shared publication
Latest Publications
- 7 October 2010
- Published by Springer Nature in Graphs and Combinatorics
- Vol. 27 (1) , 47-60
Every Large Point Set contains Many Collinear Points or an Empty Pentagon
- 7 October 2010
- Published by Springer Nature in Graphs and Combinatorics
- Vol. 27 (1) , 47-60
Every Large Point Set contains Many Collinear Points or an Empty Pentagon
- Open Access
Blocking Coloured Point Sets
This paper studies problems related to visibility among points in the plane. A point $x$ \emph{blocks} two points $v$ and $w$ if $x$ is in the interior of the line segment $\bar{vw}$. A set of points $P$ is \emph{$k$-blocked} if each point in $P$ is assigned one of $k$ colours, such that distinct points $v,w\in P$ are assigned the same colour if and only if some other point in $P$ blocks $v$ and $w$. The focus of this paper is the conjecture that each $k$-blocked set has bounded size (as a function of $k$). Results in the literature imply that every 2-blocked set has at most 3 points, and every 3-blocked set has at most 6 points. We prove that every 4-blocked set has at most 12 points, and that this bound is tight. In fact, we characterise all sets $\{n_1,n_2,n_3,n_4\}$ such that some 4-blocked set has exactly $n_i$ points in the $i$-th colour class. Amongst other results, for infinitely many values of $k$, we construct $k$-blocked sets with $k^{1.79...}$ points.Open AccessBlocking Coloured Point Sets
This paper studies problems related to visibility among points in the plane. A point $x$ \emph{blocks} two points $v$ and $w$ if $x$ is in the interior of the line segment $\bar{vw}$. A set of points $P$ is \emph{$k$-blocked} if each point in $P$ is assigned one of $k$ colours, such that distinct points $v,w\in P$ are assigned the same colour if and only if some other point in $P$ blocks $v$ and $w$. The focus of this paper is the conjecture that each $k$-blocked set has bounded size (as a function of $k$). Results in the literature imply that every 2-blocked set has at most 3 points, and every 3-blocked set has at most 6 points. We prove that every 4-blocked set has at most 12 points, and that this bound is tight. In fact, we characterise all sets $\{n_1,n_2,n_3,n_4\}$ such that some 4-blocked set has exactly $n_i$ points in the $i$-th colour class. Amongst other results, for infinitely many values of $k$, we construct $k$-blocked sets with $k^{1.79...}$ points.