Research on automation has a long history in cartography. Today, it addresses a large variety of maps ranging from classical topographic maps to highly interactive maps for small and smart devices. To a growing extent, problems of automation in cartography attract the attention of computer scientists who aim not only at practicable algorithms but also at theoretical results, e.g., by studying the computational complexity of problems or proving quality guarantees of algorithms. This workshop of two half days explicitly aims at combining theoretical and practical aspects of computing in cartography. It builds upon the claim that algorithmic research in cartography requires that
(1) problem formulations are both well-motivated from practice and mathematically precise and
(2) algorithms are supported with both theoretical and practical arguments (usually inferred from experiments).
The workshop will provide its participants the opportunity to give short presentations of recent and on-going research and will include invited talks and discussions to elaborate how theoretical and practical research on computational cartography can be linked in a best way, to combine the strengths of different parts of the community. An open-problem session will allow researchers to attract partners who are interested in joint research on a presented problem and to initiate the discussion with them.
Presentations will be selected based on abstract submissions which should not exceed 500 words. Ideally, every presentation should reach into both theoretical and practical aspects of computing in cartography, for example, by discussing theoretical results for a practically motivated problem or a practical algorithm for a mathematically defined problem. The workshop generally addresses all problems of automation in cartography and, more generally, algorithmic problems related to the visual communication of information that has a spatial component.