Kevin Verbeek

Kevin Verbeek

Auto-generated profile, based on publicly available information

Kevin Verbeek

TU Eindhoven

Research Focus & Metrics

Academic Career Length

18Years (2009-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
3 November 2011 in IEEE Transactions on Visualization and Computer Graphics
Verified
Journal Article
Closed access
KBKevin Buchin
Kevin Buchin
BSBettina Speckmann
Bettina Speckmann
KVKevin Verbeek
Kevin Verbeek
Flow maps are thematic maps that visualize the movement of objects, such as people or goods, between geographic regions. One or more sources are connected to several targets by lines whose thickness corresponds to the amount of flow between a source and a target. Good flow maps reduce visual clutter by merging (bundling) lines smoothly and by avoiding self-intersections. Most flow maps are still drawn by hand and only few automated methods exist. Some of the known algorithms do not support edge-bundling and those that do, cannot guarantee crossing-free flows. We present a new algorithmic method that uses edge-bundling and computes crossing-free flows of high visual quality. Our method is based on so-called spiral trees, a novel type of Steiner tree which uses logarithmic spirals. Spiral trees naturally induce a clustering on the targets and smoothly bundle lines. Our flows can also avoid obstacles, such as map features, region outlines, or even the targets. We demonstrate our approach with extensive experiments.

29 August 2017 in IEEE Transactions on Visualization and Computer Graphics
Verified
Journal Article
Closed access
MSMax Sondag
Max Sondag
BSBettina Speckmann
Bettina Speckmann
KVKevin Verbeek
Kevin Verbeek
Treemaps are a popular tool to visualize hierarchical data: items are represented by nested rectangles and the area of each rectangle corresponds to the data being visualized for this item. The visual quality of a treemap is commonly measured via the aspect ratio of the rectangles. If the data changes, then a second important quality criterion is the stability of the treemap: how much does the treemap change as the data changes. We present a novel stable treemapping algorithm that has very high visual quality. Whereas existing treemapping algorithms generally recompute the treemap every time the input changes, our algorithm changes the layout of the treemap using only local modifications. This approach not only gives us direct control over stability, but it also allows us to use a larger set of possible layouts, thus provably resulting in treemaps of higher visual quality compared to existing algorithms. We further prove that we can reach all possible treemap layouts using only our local modifications. Furthermore, we introduce a new measure for stability that better captures the relative positions of rectangles. We finally show via experiments on real-world data that our algorithm outperforms existing treemapping algorithms also in practice on either visual quality and/or stability. Our algorithm scores high on stability regardless of whether we use an existing stability measure or our new measure.

1 June 2020 in Computer Graphics Forum
Verified
Journal Article
Closed access
PDF file
EVE. Vernier
E. Vernier
MSM. Sondag
M. Sondag
JCJ. Comba
J. Comba
BSB. Speckmann
B. Speckmann
Alexandru TeleaAlexandru Telea
Alexandru Telea
KVK. Verbeek
K. Verbeek

1 August 2018 in Computational Geometry
Verified
Journal Article
Closed access
FHFrank Hoffmann
Frank Hoffmann
KKKlaus Kriegel
Klaus Kriegel
SSSubhash Suri
Subhash Suri
KVKevin Verbeek
Kevin Verbeek
MWMax Willert
Max Willert

1 March 2018 in Computational Geometry
Verified
Journal Article
Closed access
WEWilliam Evans
William Evans
SFStefan Felsner
Stefan Felsner
MKMichael Kaufmann
Michael Kaufmann
SKStephen G. Kobourov
Stephen G. Kobourov
DMDebajyoti Mondal
Debajyoti Mondal
KVKevin Verbeek
Kevin Verbeek

11 August 2022 in Computational Geometry
Verified
Journal Article
Open access
KBKevin Buchin
Kevin Buchin
MLMaarten Löffler
Maarten Löffler
TOTim Ophelders
Tim Ophelders
APAleksandr Popov
Aleksandr Popov
JUJérôme Urhausen
Jérôme Urhausen
KVKevin Verbeek
Kevin Verbeek