Talks and Poster Presentations (with Proceedings-Entry):

S. Nickel, M. Sondag, W. Meulemans, M. Chimani, S.G. Kobourov, J. Peltonen, M. Nöllenburg:
"Computing Stable Demers Cartograms";
Talk: International Symposium on Graph Drawing and Network Visualization (GD), Prag; 2019-09-17 - 2019-09-20; in: "GD 2019: Graph Drawing and Network Visualization", LNCS, 11904 (2019), ISBN: 978-3-030-35801-3; 46 - 60.

English abstract:
Cartograms are popular for visualizing numerical data for
map regions. Maintaining correct adjacencies is a primary quality criterion
for cartograms. When there are multiple data values per region (over
time or different datasets) shown as animated or juxtaposed cartograms,
preserving the viewer´s mental map in terms of stability between cartograms
is another important criterion. We present a method to compute
stable Demers cartograms, where each region is shown as a square
and similar data yield similar cartograms. We enforce orthogonal separation
constraints with linear programming, and measure quality in terms
of keeping adjacent regions close (cartogram quality) and using similar
positions for a region between the different data values (stability). Our
method guarantees ability to connect most lost adjacencies with minimal
leaders. Experiments show our method yields good quality and stability.

"Official" electronic version of the publication (accessed through its Digital Object Identifier - DOI)

Electronic version of the publication:

Created from the Publication Database of the Vienna University of Technology.