Kevin Verbeek
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Research Interests
Kevin Verbeek has a total of 22 co-authors. Here are the top co-authors by number of shared publications:
- Bettina Speckmann
Eindhoven University of Technology
3 shared publications - Carlos Seara
Departament de Matemàtiques, Universitat Politècnica de Catalunya, Barcelona, Spain
2 shared publications - Dolores Lara
Centro de Investigación y de Estudios Avanzados del Instituto Politécnico Nacional
2 shared publications - Jorge Urrutia
Instituto de Matemáticas, Universidad Nacional Autónoma de México, Mexico City, Mexico
2 shared publications - Matias Korman
Tohoku University Sendai Japan
2 shared publications - Mikio Kano
Ibaraki University
2 shared publications
Latest Publications
- Open Access
Balanced partitions of 3-colored geometric sets in the plane
Let $S$ be a finite set of geometric objects partitioned into classes or \emph{colors}. A subset $S'\subseteq S$ is said to be \emph{balanced} if $S'$ contains the same amount of elements of $S$ from each of the colors. We study several problems on partitioning $3$-colored sets of points and lines in the plane into two balanced subsets: (a) We prove that for every 3-colored arrangement of lines there exists a segment that intersects exactly one line of each color, and that when there are $2m$ lines of each color, there is a segment intercepting $m$ lines of each color. (b) Given $n$ red points, $n$ blue points and $n$ green points on any closed Jordan curve $\gamma$, we show that for every integer $k$ with $0 \leq k \leq n$ there is a pair of disjoint intervals on $\gamma$ whose union contains exactly $k$ points of each color. (c) Given a set $S$ of $n$ red points, $n$ blue points and $n$ green points in the integer lattice satisfying certain constraints, there exist two rays with common apex, one vertical and one horizontal, whose union splits the plane into two regions, each one containing a balanced subset of $S$.Open AccessBalanced partitions of 3-colored geometric sets in the plane
Let $S$ be a finite set of geometric objects partitioned into classes or \emph{colors}. A subset $S'\subseteq S$ is said to be \emph{balanced} if $S'$ contains the same amount of elements of $S$ from each of the colors. We study several problems on partitioning $3$-colored sets of points and lines in the plane into two balanced subsets: (a) We prove that for every 3-colored arrangement of lines there exists a segment that intersects exactly one line of each color, and that when there are $2m$ lines of each color, there is a segment intercepting $m$ lines of each color. (b) Given $n$ red points, $n$ blue points and $n$ green points on any closed Jordan curve $\gamma$, we show that for every integer $k$ with $0 \leq k \leq n$ there is a pair of disjoint intervals on $\gamma$ whose union contains exactly $k$ points of each color. (c) Given a set $S$ of $n$ red points, $n$ blue points and $n$ green points in the integer lattice satisfying certain constraints, there exist two rays with common apex, one vertical and one horizontal, whose union splits the plane into two regions, each one containing a balanced subset of $S$. - 1 January 2015
- Published by Elsevier in Discrete Applied Mathematics
- Vol. 181, 21-32
Balanced partitions of 3-colored geometric sets in the plane
- 1 January 2015
- Published by Elsevier in Discrete Applied Mathematics
- Vol. 181, 21-32
Balanced partitions of 3-colored geometric sets in the plane
- 22 December 2014
- Published by Society for Industrial & Applied Mathematics (SIAM)
Geometric k Shortest Paths
- 22 December 2014
- Published by Society for Industrial & Applied Mathematics (SIAM)
Geometric k Shortest Paths
- 8 November 2014
- Published by Springer Nature in Lecture Notes in Computer Science
- Vol. 26, 338-350
On the Most Likely Voronoi Diagramand Nearest Neighbor Searching
- 8 November 2014
- Published by Springer Nature in Lecture Notes in Computer Science
- Vol. 26, 338-350
On the Most Likely Voronoi Diagramand Nearest Neighbor Searching
- 23 January 2014
- Published by Springer Nature in Algorithmica
- Vol. 72 (2) , 656-685
Angle-Restricted Steiner Arborescences for Flow Map Layout
- 23 January 2014
- Published by Springer Nature in Algorithmica
- Vol. 72 (2) , 656-685
Angle-Restricted Steiner Arborescences for Flow Map Layout
- Open Access
Strict Confluent Drawing
We define strict confluent drawing, a form of confluent drawing in which the existence of an edge is indicated by the presence of a smooth path through a system of arcs and junctions (without crossings), and in which such a path, if it exists, must be unique. We prove that it is NP-complete to determine whether a given graph has a strict confluent drawing but polynomial to determine whether it has an outerplanar strict confluent drawing with a fixed vertex ordering (a drawing within a disk, with the vertices placed in a given order on the boundary).
Open AccessStrict Confluent Drawing
We define strict confluent drawing, a form of confluent drawing in which the existence of an edge is indicated by the presence of a smooth path through a system of arcs and junctions (without crossings), and in which such a path, if it exists, must be unique. We prove that it is NP-complete to determine whether a given graph has a strict confluent drawing but polynomial to determine whether it has an outerplanar strict confluent drawing with a fixed vertex ordering (a drawing within a disk, with the vertices placed in a given order on the boundary).