Maike Buchin

Orcid: 0000-0002-3446-4343

Affiliations:
  • Ruhr-Universität Bochum, Germany


According to our database1, Maike Buchin authored at least 79 papers between 2003 and 2023.

Collaborative distances:
  • Dijkstra number2 of three.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2023
Approximating (<i>k,ℓ</i>)-Median Clustering for Polygonal Curves.
ACM Trans. Algorithms, January, 2023

Realizability of Free Spaces of Curves.
Proceedings of the 34th International Symposium on Algorithms and Computation, 2023

Anonymous Routing Using Minimum Capacity Clustering (Short Paper).
Proceedings of the 12th International Conference on Geographic Information Science, 2023

2022
Computation and Reconfiguration in Low-Dimensional Topological Spaces (Dagstuhl Seminar 22062).
Dagstuhl Reports, 2022

The k-outlier Fréchet distance.
CoRR, 2022

Fréchet distance between two point sets.
Comput. Geom., 2022

Approximating Length-Restricted Means Under Dynamic Time Warping.
Proceedings of the Approximation and Online Algorithms - 20th International Workshop, 2022

Efficient Fréchet Distance Queries for Segments.
Proceedings of the 30th Annual European Symposium on Algorithms, 2022

Coresets for (k, ℓ )-Median Clustering Under the Fréchet Distance.
Proceedings of the Algorithms and Discrete Applied Mathematics, 2022

2021
Distance measures for embedded graphs.
Comput. Geom., 2021

Shape decomposition algorithms for laser capture microdissection.
Algorithms Mol. Biol., 2021

Decomposing Polygons into Fat Components.
Proceedings of the 33rd Canadian Conference on Computational Geometry, 2021

2020
Inferring movement patterns from geometric similarity.
J. Spatial Inf. Sci., 2020

Group diagrams for representing trajectories.
Int. J. Geogr. Inf. Sci., 2020

Approximating (k, 𝓁)-Median Clustering for Polygonal Curves.
CoRR, 2020

Computing the Fréchet distance of trees and graphs of bounded tree width.
CoRR, 2020

On the complexity of the middle curve problem.
CoRR, 2020

A polynomial-time partitioning algorithm for weighted cactus graphs.
CoRR, 2020

Middle curves based on discrete Fréchet distance.
Comput. Geom., 2020

Improved Map Construction using Subtrajectory Clustering.
Proceedings of the LocalRec'20: Proceedings of the 4th ACM SIGSPATIAL Workshop on Location-Based Recommendations, 2020

2019
The k-Fréchet distance.
CoRR, 2019

Locally correct Fréchet matchings.
Comput. Geom., 2019

The k-Fréchet Distance: How to Walk Your Dog While Teleporting.
Proceedings of the 30th International Symposium on Algorithms and Computation, 2019

2018
Model-Based Segmentation and Classification of Trajectories.
Algorithmica, 2018

2017
Compact Flow Diagrams for State Sequences.
ACM J. Exp. Algorithmics, 2017

Visual analytics of delays and interaction in movement data.
Int. J. Geogr. Inf. Sci., 2017

Four Soviets Walk the Dog: Improved Bounds for Computing the Fréchet Distance.
Discret. Comput. Geom., 2017

Clustering Trajectories for Map Construction.
Proceedings of the 25th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems, 2017

2016
Trajectory Box Plot: a new pattern to summarize movements.
Int. J. Geogr. Inf. Sci., 2016

Analysis of movement data.
Int. J. Geogr. Inf. Sci., 2016

Computing the Fréchet Distance with a Retractable Leash.
Discret. Comput. Geom., 2016

A Middle Curve Based on Discrete Fréchet Distance.
Proceedings of the LATIN 2016: Theoretical Informatics, 2016

2015
Trajectory grouping structure.
J. Comput. Geom., 2015

Model-Based Classification of Trajectories.
Proceedings of the Algorithms and Computation - 26th International Symposium, 2015

Analyzing delays in trajectories.
Proceedings of the 2015 IEEE Pacific Visualization Symposium, 2015

2014
Moving beyond the point: An agenda for research in movement analysis with real data.
Comput. Environ. Urban Syst., 2014

Similarity of trajectories taking into account geographic context.
J. Spatial Inf. Sci., 2014

Interaction and Collective Movement Processing (Dagstuhl Seminar 14132).
Dagstuhl Reports, 2014

Reprint of: Memory-constrained algorithms for simple polygons.
Comput. Geom., 2014

Four Soviets Walk the Dog - with an Application to Alt's Conjecture.
Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms, 2014

A framework for trajectory segmentation by stable criteria.
Proceedings of the 22nd ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems, 2014

Computing the Fréchet distance with shortcuts is NP-hard.
Proceedings of the 30th Annual Symposium on Computational Geometry, 2014

Trajectory Grouping Structure: the Video.
Proceedings of the 30th Annual Symposium on Computational Geometry, 2014

2013
Trajectory Grouping Structures
CoRR, 2013

Memory-constrained algorithms for simple polygons.
Comput. Geom., 2013

Median Trajectories.
Algorithmica, 2013

Computing similarity of coarse and irregular trajectories using space-time prisms.
Proceedings of the 21st SIGSPATIAL International Conference on Advances in Geographic Information Systems, 2013

2012
Rolling Block Mazes are PSPACE-complete.
J. Inf. Process., 2012

Processing aggregated data: the location of clusters in health data.
GeoInformatica, 2012

Drawing (Complete) Binary Tanglegrams - Hardness, Approximation, Fixed-Parameter Tractability.
Algorithmica, 2012

Context-Aware Similarity of Trajectories.
Proceedings of the Geographic Information Science - 7th International Conference, 2012

2011
Segmenting trajectories: A framework and algorithms using spatiotemporal criteria.
J. Spatial Inf. Sci., 2011

Connect the dot: Computing feed-links for network extension.
J. Spatial Inf. Sci., 2011

Detecting Commuting Patterns by Clustering Subtrajectories.
Int. J. Comput. Geom. Appl., 2011

Finding long and similar parts of trajectories.
Comput. Geom., 2011

2010
Voronoi Diagram of Polygonal Chains under the Discrete FRéChet Distance.
Int. J. Comput. Geom. Appl., 2010

Constrained free space diagrams: a tool for trajectory analysis.
Int. J. Geogr. Inf. Sci., 2010

Can We Compute the Similarity between Surfaces?
Discret. Comput. Geom., 2010

An algorithmic framework for segmenting trajectories based on spatio-temporal criteria.
Proceedings of the 18th ACM SIGSPATIAL International Symposium on Advances in Geographic Information Systems, 2010

Fréchet Distance of Surfaces: Some Simple Hard Cases.
Proceedings of the Algorithms, 2010

10491 Results of the break-out group: Gulls Data.
Proceedings of the Representation, Analysis and Visualization of Moving Objects, 05.12., 2010

10491 Results of the break-out group: Aggregation.
Proceedings of the Representation, Analysis and Visualization of Moving Objects, 05.12., 2010

2009
Polychromatic Colorings of Plane Graphs.
Discret. Comput. Geom., 2009

Connect the Dot: Computing Feed-Links with Minimum Dilation.
Proceedings of the Algorithms and Data Structures, 11th International Symposium, 2009

Exact algorithms for partial curve matching via the Fréchet distance.
Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms, 2009

2008
Computing the Fréchet distance between simple polygons.
Comput. Geom., 2008

Clusters in Aggregated Health Data.
Proceedings of the Headway in Spatial Data Handling, 2008

Detecting single file movement.
Proceedings of the 16th ACM SIGSPATIAL International Symposium on Advances in Geographic Information Systems, 2008

Feed-links for network extensions.
Proceedings of the 16th ACM SIGSPATIAL International Symposium on Advances in Geographic Information Systems, 2008

Drawing (Complete) Binary Tanglegrams.
Proceedings of the Graph Drawing, 16th International Symposium, 2008

2007
On the Computability of the Frechet Distance Between Triangulated Surfaces (Über die Berechenbarkeit des Frechet-Abstands zwischen triangulierten Flächen)
PhD thesis, 2007

Lower Bounds for the Complexity of the Voronoi Diagram of Polygonal Curves under the Discrete Frechet Distance
CoRR, 2007

Topology Control.
Proceedings of the Algorithms for Sensor and Ad Hoc Networks, 2007

On Rolling Cube Puzzles.
Proceedings of the 19th Annual Canadian Conference on Computational Geometry, 2007

2006
Computing the Fréchet distance between simple polygons in polynomial time.
Proceedings of the 22nd ACM Symposium on Computational Geometry, 2006

2005
Semi-computability of the Fréchet distance between surfaces.
Proceedings of the (Informal) Proceedings of the 21st European Workshop on Computational Geometry, 2005

Minimizing the Total Absolute Gaussian Curvature in a Terrain is Hard.
Proceedings of the 17th Canadian Conference on Computational Geometry, 2005

2003
Real-time per-pixel rendering with stroke textures.
Proceedings of the 19th Spring Conference on Computer Graphics, 2003

Real-Time Expressive Rendering of City Models.
Proceedings of the Seventh International Conference on Information Visualization, 2003


  Loading...