#### DMCA

## Constrained free space diagrams: a tool for trajectory analysis

Venue: | Int. J. of Geogr. Inform. Sci |

Citations: | 14 - 7 self |

### Citations

1785 | A Density-Based Algorithm for Discovering Clusters
- Ester, Kriege, et al.
- 1996
(Show Context)
Citation Context ...r a single file. More recently, further movement patterns have been studied. Jeung et al. [2008] modified the definition of a flock to what they call a convoy, using the notion of density connection [=-=Ester et al., 1996-=-]. Intuitively, two entities in a group are density-connected if a sequence of objects exists that connects the two objects and the distance between consecutive objects does not exceed a given constan... |

236 | Fast similarity search in the presence of noise, scaling, and translation in time-series databases
- Agrawal, Lin, et al.
- 1995
(Show Context)
Citation Context ...gest common subsequence model [Vlachos et al., 2002], a combination of parallel distance, perpendicular distance and angle distance [Lee et al., 2007], the count of common subsequences of length two [=-=Agrawal et al., 1995-=-] and the domain-dependent extraction of a single representative value for the whole series [Kalpakis et al., 2001]. The second type of trajectory analysis focuses on the moving entities but at the sa... |

218 | Quantitative Analysis of Movement: Measuring and Modeling Population Redistribution in Animals and Plants. Sinauer Associates, - Turchin - 1998 |

190 |
Computing the Fréchet distance between two polygonal curves
- Alt, Godau
- 1995
(Show Context)
Citation Context ...ts. Much research has been done on this topic suggesting numerous metrics to measure the distance between two paths, in particular the Hausdorff distance [Alt et al., 1995] and the Fréchet distance [=-=Alt and Godau, 1995-=-]. Further distance measures have been considered, such as the longest common subsequence model [Vlachos et al., 2002], a combination of parallel distance, perpendicular distance and angle distance [L... |

96 | State-of-the-art in Shape Matching,”
- Veltkamp, Hagedoorn
- 1999
(Show Context)
Citation Context ...ince it takes the continuity of the shapes into account it is generally regarded as a more appropriate distance measure than the Hausdorff distance for curves [Alt and Guibas, 1999, Alt et al., 2004, =-=Veltkamp and Hagedoorn, 2001-=-]. We denote the Fréchet distance between to curves f and g by δF( f ,g). For completeness, we include its formal definition here. Definition 1. Let f : I = [lI,rI]→ Rc and g : J = [lJ,rJ]→ Rc be two... |

79 | Approximate matching of polygonal shapes. - Alt, Behrends, et al. - 1995 |

73 |
Distance Measures for Effective Clustering of ARIMA Time-Series.
- Kalpakis, Gada, et al.
- 2001
(Show Context)
Citation Context ...and angle distance [Lee et al., 2007], the count of common subsequences of length two [Agrawal et al., 1995] and the domain-dependent extraction of a single representative value for the whole series [=-=Kalpakis et al., 2001-=-]. The second type of trajectory analysis focuses on the moving entities but at the same point in time. Several papers consider the average distance at equal times as similarity measure [Buchin et al.... |

64 | A near-linear time approximation algorithm for geometric bipartite matching. - Sharathkumar, Agarwal - 2012 |

54 | Discovery of convoys in trajectory databases. - Jeung, Yiu, et al. - 2008 |

50 | Computing longest duration flocks in trajectory data. - Gudmundsson, Kreveld - 2006 |

45 | Reporting flock patterns. - Benkert, Gudmundsson, et al. - 2008 |

44 | Finding REMO - Detecting Relative Motion Patterns in Geospatial Lifelines. - Laube, Kreveld, et al. - 2004 |

43 | Efficient detection of motion patterns in spatio-temporal data sets. - GUDMUNDSSON, KREVELD, et al. - 2004 |

34 | Comparison of distance measures for planar curves, Algorithmica 38(1 - Alt, Knauer, et al. - 2004 |

30 | Detecting commuting patterns by clustering subtrajectories - Buchin, Buchin, et al. |

26 | Continuous clustering of moving objects - Jensen, Lin, et al. |

22 | Mining spatio-temporal association rules, sources, sinks, stationary regions and thoroughfares in object mobility databases.
- Verhein, Chawla
- 2006
(Show Context)
Citation Context ...tterns among trajectories, for example flocks [Benkert et al., 2008, Laube et al., 2004], convoys [Jeung et al., 2008], leaderships [Andersson et al., 2008], and popular places [Benkert et al., 2007, =-=Verhein and Chawla, 2006-=-]. In this paper we will present a more general tool that can be used to analyse trajectories with various attributes and restrictions. Previous work on trajectory analysis has focused on two types of... |

21 | Interpolation of animal tracking data in a fluid environment. - Tremblay, Shaffer, et al. - 2006 |

16 | Reporting leaders and followers among trajectories of moving point objects - Andersson, Gudmundsson, et al. - 2008 |

11 | Finding long and similar parts of trajectories. - Buchin, Buchin, et al. - 2011 |

11 | Time-focused density-based clustering of trajectories of moving objects - Nanni, Pedreschi - 2006 |

11 | Dynamics-aware similarity of moving objects trajectories
- TRAJCEVSKI, DING, et al.
- 2007
(Show Context)
Citation Context ...lysis focuses on the moving entities but at the same point in time. Several papers consider the average distance at equal times as similarity measure [Buchin et al., 2009b, Nanni and Pedreschi, 2006, =-=Trajcevski et al., 2007-=-]. Furthermore, extensive research has been done on detecting moving clusters (or flocks) [Benkert et al., 2008, Gudmundsson et al., 2007, Jensen et al., 2007, Jeung et al., 2008, Kalnis et al., 2005,... |

10 |
An approach to evaluating motion pattern detection techniques in spatio-temporal data
- Laube, Purves
- 2006
(Show Context)
Citation Context ... interesting to investigate whether this process can be semi-automated. A possible approach is to evaluate the interestingness of the pattern for various settings of the parameters on synthetic data [=-=Laube and Purves, 2006-=-]. To make the algorithm efficient one needs to consider the structure in more detail. In general the time and space complexity for a free-space diagram is n2 times the complexity of one cell, which c... |

6 | Finding popular places.
- Benkert, Djordjevic, et al.
- 2010
(Show Context)
Citation Context ... detecting movement patterns among trajectories, for example flocks [Benkert et al., 2008, Laube et al., 2004], convoys [Jeung et al., 2008], leaderships [Andersson et al., 2008], and popular places [=-=Benkert et al., 2007-=-, Verhein and Chawla, 2006]. In this paper we will present a more general tool that can be used to analyse trajectories with various attributes and restrictions. Previous work on trajectory analysis h... |

5 | Energetics of swimming and flying in formation. - Fish - 1999 |

3 | Geodesic Fréchet distance with polygonal obstacles - Cook, Wenk - 2008 |

3 | Min-link shortest path maps and Fréchet distance - Cook, Wenk - 2008 |

1 | On discovering moving clusters in spatio-temporal data - Buchin, Buchin, et al. - 2005 |