• P.O. Box 513

    5600 MB Eindhoven

    Netherlands

  • Groene Loper 5, Metaforum

    5612 AP Eindhoven

    Netherlands

Organization profile

Introduction / mission

Geometric algorithms is the field within algorithms research that is concerned with the design and analysis of efficient algorithms and data structures for problems involving geometric objects in 2-, 3-, and higher-dimensional space.

Organisational profile

The Applied Geometric Algorithms group mainly focuses on geo-metric algorithms for spatial dataand applications of geometric algorithms in the areas of GIScience and Smart Mobility (including automated cartography and moving object analysis), geo-visualization, visual analytics, and e-Humanities.

Our approaches frequently combine the rigorous methods from algorithmic research areas such as computational geometry - which give performance guarantees with respect to both the quality of solutions and the running time of algorithms - with efficient engineering to achieve results of both theoretical and practical significance.

WorldCat by OCLC has 2 billion entries describing more than 321 million bibliographic records. It used to offer only a textual user interface for searching and browsing. Together with OCLC’s research scientists, we develop visual analytics tools that meet humanities researchers’ needs as well as concrete demands from libraries. The tools provide visual interfaces for data cleaning, clustering, and analysis, and intuitive and interactive representation of search results.

Together with the eScience Center we are developing an online platform and open-source code library to move our advanced information-visualization and mapping techniques from theoretic concepts to practical tools that can be used by anyone.

  • Algorithmic Foundations for the Analysis and Visualization of Complex Moving Objects
    NWO – VICI
    Going beyond the basic setting of moving point objects, we study moving complex, non-point objects such as moving polylines (e.g. modeling changing coastlines or glacier termini), polygons (e.g. hurricanes), and geometric networks (e.g. river networks).
  • Visual Analytics for the World’s Library Data
    NWO – Creative Industry
    Together with OCLC we develop an interactive visual analytics toolkit to explore millions of bibliographic records.
  • Algorithmic Geo-visualization: from Theory to Practice 
    Netherlands eScience Center
    Together with the eScience Center we are developing advanced stable geo-visualization techniques for time-varying data and make our results available in a professional software library.

DO NOT USE TO BE REMOVED

Geometric algorithms, also known as computational geometry, is the field within algorithms research that is concerned with the design and analysis of efficient algorithms and data structures for problems involving geometric objects in 2-, 3-, and higher-dimensional space. The Applied Geometric Algorithms group mainly focuses on geometric algorithms for spatial data and applications of geometric algorithms in the areas of GIScience (including automated cartography and moving object analysis), geo-visualization, visual analytics, and e-humanities. Our approaches frequently combine the rigorous methods from computational geometry - which give performance guarantees with respect to both the quality of solutions and the running time of algorithms - with efficient engineering to achieve results of both theoretical and practical significance.

Geo-Visualization, Automated Cartography, Visual Analytics

(Automated) cartography is focused mostly on the visualization aspects of GIScience and has established itself as its own research area. In recent years the computational aspects of thematic mapping have received considerable interest. Maps are effective tools for communicating information and hence spatial data (and also some non-spatial data) can be visualized well using maps. Thematic maps often depict a single theme or attribute, such as population, income, crime rate, or migration. The map below is a visual summary of some of our recent work in this area.

Movement Data Analysis

Over the past years the availability of devices that can be used to track moving objects - GPS satellite systems, mobile phones, radio telemetry, surveillance cameras, RFID tags, and more - has increased dramatically, leading to an explosive growth in movement data. Objects being tracked range from animals (for behavioral studies) and cars (for traffic prediction), to hurricanes, sports players (for video analysis of games), and suspected terrorists. Naturally the goal is not only to track objects but also to extract information from the resulting data. Our recent work focuses in particular on the analysis of complex moving objects: non-point objects such as moving polylines (changing coastlines or glacier termini), polygons (hurricanes), and geometric networks (river networks).

e-Humanities

The increased digitization of cultural heritage artifacts such as books, manuscripts, or musical scores, creates an ever growing set of highly complex data which humanities researchers aim to analyze and understand. The area of e-humanities, which deals with the development and use of digital technologies in the humanities and social sciences, is hence an intriguing application area for algorithmic visualization with a potentially high impact on society. Our recent work focuses in particular on visual analytics solutions for very large GLAM (meta) data sets.

Network Recent external collaboration on country level. Dive into details by clicking on the dots.

Research Output 2003 2019

Locally correct Fréchet matchings

Buchin, K., Buchin, M., Meulemans, W. & Speckmann, B., 1 Jan 2019, In : Computational Geometry: Theory and Applications. 76, p. 1-18 18 p.

Research output: Contribution to journalArticleAcademicpeer-review

Curve
Monotone
Metric

Region-based approximation of probability distributions (for visibility between imprecise points among obstacles)

Buchin, K., Kostitsyna, I., Löffler, M. & Silveira, R. I., 16 Feb 2019, In : Algorithmica. 34 p.

Research output: Contribution to journalArticleAcademicpeer-review

Open Access
Visibility
Probability distributions
Probability density function
Probability Distribution
Polygon

A framework for algorithm stability and its application to kinetic euclidean MSTs

Meulemans, W., Speckmann, B., Verbeek, K. & Wulms, J., 1 Jan 2018, LATIN 2018: Theoretical Informatics: 13th Latin American Symposium, Buenos Aires, Argentina, April 16-19, 2018, Proceedings. Bender, M. A., Farach-Colton, M. & Mosteiro, M. A. (eds.). Dordrecht: Springer, p. 805-819 15 p. (Lecture Notes in Computer Science; vol. 10807)

Research output: Chapter in Book/Report/Conference proceedingConference contributionAcademicpeer-review

Open Access
File
Minimum Spanning Tree
Euclidean
Kinetics
Lipschitz Stability
Combinatorial Algorithms

Prizes

NWO Veni Award : Stable Geometric algorithms

Kevin Verbeek (Recipient), 28 Jul 2015

Recognition: NWOVeniScientific

Student theses

Efficiently answering Fréchet queries

Author: van Diggelen, T., 26 Mar 2018

Supervisor: Buchin, K. (Supervisor 1) & Meulemans, W. (Supervisor 2)

Student thesis: Master

File

Map matching in cartograpic schematization

Author: van Hulten, L., 29 Jan 2018

Supervisor: Meulemans, W. (Supervisor 1) & van Goethem, A. (Supervisor 2)

Student thesis: Master

File

Near-Dorling cartograms

Author: van Oorschot, J., 26 Mar 2018

Supervisor: Speckmann, B. (Supervisor 1) & Buchin, K. (Supervisor 2)

Student thesis: Master

File