Applied Geometric Algorithms

  • 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 geometric algorithms for spatial data and applications of geometric algorithms in the areas of GIScience and Smart Mobility (including Automated Cartography, Geo-Visualization, and Moving Object Analysis), Visual Analytics, Mobile Agents, 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. 

  • Spatially Informed Visualization
  • Complex Moving Objects
  • Stability
  • Mobile Agents
  • e-Humanities

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

Open Access
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
1 Citation (Scopus)

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