Author image not provided
 Maike Buchin

Authors:
Add personal information
  Affiliation history
Bibliometrics: publication history
Average citations per article5.21
Citation Count203
Publication count39
Publication years2006-2017
Available for download14
Average downloads per article230.86
Downloads (cumulative)3,232
Downloads (12 Months)353
Downloads (6 Weeks)70
SEARCH
ROLE
Arrow RightAuthor only


AUTHOR'S COLLEAGUES
See all colleagues of this author

SUBJECT AREAS
See all subject areas




BOOKMARK & SHARE


39 results found Export Results: bibtexendnoteacmrefcsv

Result 1 – 20 of 39
Result page: 1 2

Sort by:

1 published by ACM
December 2017 Journal of Experimental Algorithmics (JEA): Volume 22, 2017
Publisher: ACM
Bibliometrics:
Citation Count: 0
Downloads (6 Weeks): 22,   Downloads (12 Months): 31,   Downloads (Overall): 31

Full text available: PDFPDF
We introduce the concept of using a flow diagram to compactly represent the segmentation of a large number of state sequences according to a set of criteria. We argue that this flow diagram representation gives an intuitive summary that allows the user to detect patterns within the segmentations. In essence, ...
Keywords: football, Flow networks, group segmentation, sports analytics, experimental, state sequence, network analysis

2 published by ACM
November 2017 SIGSPATIAL'17: Proceedings of the 25th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems
Publisher: ACM
Bibliometrics:
Citation Count: 0
Downloads (6 Weeks): 27,   Downloads (12 Months): 27,   Downloads (Overall): 27

Full text available: PDFPDF
We propose a new approach for constructing the underlying map from trajectory data. Our algorithm is based on the idea that road segments can be identified as stable subtrajectory clusters in the data. For this, we consider how subtrajectory clusters evolve for varying distance values, and choose stable values for ...
Keywords: Trajectories, clustering, geometric algorithms, map construction

3
July 2017 Discrete & Computational Geometry: Volume 58 Issue 1, July 2017
Publisher: Springer-Verlag New York, Inc.
Bibliometrics:
Citation Count: 0

Given two polygonal curves in the plane, there are many ways to define a notion of similarity between them. One popular measure is the Fréchet distance. Since it was proposed by Alt and Godau in 1992, many variants and extensions have been studied. Nonetheless, even more than 20 years later, ...
Keywords: Frechet distance, Algebraic decision tree, Four Russian trick, Pointer machine, Word RAM

4
February 2017 International Journal of Geographical Information Science: Volume 31 Issue 2, February 2017
Publisher: Taylor & Francis, Inc.
Bibliometrics:
Citation Count: 0

The analysis of interaction between movement trajectories is of interest for various domains when movement of multiple objects is concerned. Interaction often includes a delayed response, making it difficult to detect interaction with current methods that compare movement at specific time intervals. We propose analyses and visualizations, on a local ...

5
February 2017 International Journal of Geographical Information Science: Volume 31 Issue 2, February 2017
Publisher: Taylor & Francis, Inc.
Bibliometrics:
Citation Count: 0

The analysis of interaction between movement trajectories is of interest for various domains when movement of multiple objects is concerned. Interaction often includes a delayed response, making it difficult to detect interaction with current methods that compare movement at specific time intervals. We propose analyses and visualizations, on a local ...

6
September 2016 Discrete & Computational Geometry: Volume 56 Issue 2, September 2016
Publisher: Springer-Verlag New York, Inc.
Bibliometrics:
Citation Count: 0

All known algorithms for the Fr�chet distance between curves proceed in two steps: first, they construct an efficient oracle for the decision version; second, they use this oracle to find the optimum from a finite set of critical values. We present a novel approach that avoids the detour through the ...
Keywords: Fréchet distance, 68U05, 68W25, Approximation, Polyhedral distances

7
June 2016 SEA 2016: Proceedings of the 15th International Symposium on Experimental Algorithms - Volume 9685
Publisher: Springer-Verlag New York, Inc.
Bibliometrics:
Citation Count: 0

We introduce the concept of compactly representing a large number of state sequences, e.g., sequences of activities, as a flow diagram. We argue that the flow diagram representation gives an intuitive summary that allows the user to detect patterns among large sets of state sequences. Simplified, our aim is to ...

8
May 2016 International Journal of Geographical Information Science - Analysis of Movement Data: Volume 30 Issue 5, May 2016
Publisher: Taylor & Francis, Inc.
Bibliometrics:
Citation Count: 0

Nowadays, an abundance of sensors are used to collect very large datasets of moving objects. The movement of these objects can be analysed by identifying common routes. For this, a cluster of trajectories must be defined and the pattern of each cluster discovered. In this article, we introduce a new ...
Keywords: spatio-temporal pattern, position clusters, Fréchet distance, Box Plot, trajectory analysis

9
May 2016 International Journal of Geographical Information Science - Analysis of Movement Data: Volume 30 Issue 5, May 2016
Publisher: Taylor & Francis, Inc.
Bibliometrics:
Citation Count: 2


10 published by ACM
November 2014 SIGSPATIAL '14: Proceedings of the 22nd ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems
Publisher: ACM
Bibliometrics:
Citation Count: 6
Downloads (6 Weeks): 5,   Downloads (12 Months): 62,   Downloads (Overall): 202

Full text available: PDFPDF
We present an algorithmic framework for criteria-based segmentation of trajectories that can efficiently process a large class of criteria. Criteria-based segmentation is the problem of subdividing a trajectory into a small number of parts such that each part satisfies a global criterion. Our framework can handle criteria that are stable, ...
Keywords: segmentation, trajectory, computational geometry

11 published by ACM
June 2014 SOCG'14: Proceedings of the thirtieth annual symposium on Computational geometry
Publisher: ACM
Bibliometrics:
Citation Count: 0
Downloads (6 Weeks): 1,   Downloads (12 Months): 17,   Downloads (Overall): 91

Full text available: PDFPDF

12 published by ACM
June 2014 SOCG'14: Proceedings of the thirtieth annual symposium on Computational geometry
Publisher: ACM
Bibliometrics:
Citation Count: 3
Downloads (6 Weeks): 0,   Downloads (12 Months): 17,   Downloads (Overall): 88

Full text available: PDFPDF
We study the shortcut Fréchet distance, a natural variant of the Fréchet distance, that allows us to take shortcuts from and to any point along one of the curves. The classic Fréchet distance is a bottle-neck distance measure and hence quite sensitive to outliers. The shortcut Fréchet distance allows us ...

13
April 2014 Computational Geometry: Theory and Applications: Volume 47 Issue 3, April, 2014
Publisher: Elsevier Science Publishers B. V.
Bibliometrics:
Citation Count: 1

A constant-work-space algorithm has read-only access to an input array and may use only O(1) additional words of O(logn) bits, where n is the input size. We show how to triangulate a plane straight-line graph with n vertices in O(n^2) time and constant work-space. We also consider the problem of ...
Keywords: Shortest path, Simple polygon, Space-time trade-off, Triangulation, Constant workspace

14
January 2014 SODA '14: Proceedings of the twenty-fifth annual ACM-SIAM symposium on Discrete algorithms
Publisher: Society for Industrial and Applied Mathematics
Bibliometrics:
Citation Count: 6
Downloads (6 Weeks): 1,   Downloads (12 Months): 19,   Downloads (Overall): 50

Full text available: PDFPDF
Given two polygonal curves in the plane, there are many ways to define a notion of similarity between them. One measure that is extremely popular is the Fréchet distance. Since it has been proposed by Alt and Godau in 1992, many variants and extensions have been studied. Nonetheless, even more ...

15 published by ACM
November 2013 SIGSPATIAL'13: Proceedings of the 21st ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems
Publisher: ACM
Bibliometrics:
Citation Count: 0
Downloads (6 Weeks): 3,   Downloads (12 Months): 24,   Downloads (Overall): 132

Full text available: PDFPDF
Increasing volumes of trajectory data require analysis methods which go beyond the visual. Methods for computing trajectory analysis typically assume linear interpolation between quasi-regular sampling points. This assumption, however, is often not realistic, and can lead to a meaningless analysis for sparsely and/or irregularly sampled data. We propose to use ...
Keywords: trajectory analysis, similarity measure, space-time prisms

16
August 2013 WADS'13: Proceedings of the 13th international conference on Algorithms and Data Structures
Publisher: Springer-Verlag
Bibliometrics:
Citation Count: 4

The collective motion of a set of moving entities like people, birds, or other animals, is characterized by groups arising, merging, splitting, and ending. Given the trajectories of these entities, we define and model a structure that captures all of such changes using the Reeb graph, a concept from topology. ...

17
September 2012 ESA'12: Proceedings of the 20th Annual European conference on Algorithms
Publisher: Springer-Verlag
Bibliometrics:
Citation Count: 2

The Fréchet distance is a metric to compare two curves, which is based on monotonous matchings between these curves. We call a matching that results in the Fréchet distance a Fréchet matching. There are often many different Fréchet matchings and not all of these capture the similarity between the curves ...

18
July 2012 Geoinformatica: Volume 16 Issue 3, July 2012
Publisher: Kluwer Academic Publishers
Bibliometrics:
Citation Count: 2

Spatially aggregated data is frequently used in geographical applications. Often spatial data analysis on aggregated data is performed in the same way as on exact data, which ignores the fact that we do not know the actual locations of the data. We here propose models and methods to take aggregation ...
Keywords: Cluster, Public health, Aggregated data, Algorithm

19
February 2012 Algorithmica: Volume 62 Issue 1-2, February 2012
Publisher: Springer-Verlag New York, Inc.
Bibliometrics:
Citation Count: 1

A binary tanglegram is a drawing of a pair of rooted binary trees whose leaf sets are in one-to-one correspondence; matching leaves are connected by inter-tree edges. For applications, for example, in phylogenetics, it is essential that both trees are drawn without edge crossings and that the inter-tree edges have ...
Keywords: Crossing minimization, NP-hardness, Fixed-parameter tractability, Approximation algorithm

20
November 2011 Computational Geometry: Theory and Applications: Volume 44 Issue 9, November, 2011
Publisher: Elsevier Science Publishers B. V.
Bibliometrics:
Citation Count: 7

A natural time-dependent similarity measure for two trajectories is their average distance at corresponding times. We give algorithms for computing the most similar subtrajectories under this measure, assuming the two trajectories are given as two polygonal, possibly self-intersecting lines with time stamps. For the case when a minimum duration of ...
Keywords: Moving objects, Trajectory analysis, Similarity measure



The ACM Digital Library is published by the Association for Computing Machinery. Copyright © 2018 ACM, Inc.
Terms of Usage   Privacy Policy   Code of Ethics   Contact Us