#### Filter Results:

- Full text PDF available (25)

#### Publication Year

2002

2012

- This year (0)
- Last 5 years (2)
- Last 10 years (14)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

Data representing moving objects is rapidly getting more available, especially in the area of wildlife GPS tracking. It is a central belief that information is hidden in large data sets in the form of interesting patterns, where a pattern can be any configuration of some moving objects in a certain area and/or during a certain time period. One of the most… (More)

- Mattias Andersson, Joachim Gudmundsson, Patrick Laube, Thomas Wolle
- GeoInformatica
- 2008

Widespread availability of location aware devices (such as GPS receivers) promotes capture of detailed movement trajectories of people, animals, vehicles and other moving objects, opening new options for a better understanding of the processes involved. In this paper we investigate spatio-temporal movement patterns in large tracking data sets. We present a… (More)

- Hans L. Bodlaender, Thomas Wolle, Arie M. C. A. Koster
- J. Graph Algorithms Appl.
- 2004

Edge contraction is shown to be a useful mechanism to improve lower bound heuristics for treewidth. A successful lower bound for treewidth is the degeneracy: the maximum over all subgraphs of the minimum degree. The degeneracy is polynomial time computable. We introduce the notion of contraction degeneracy: the maximum over all minors of the minimum degree.… (More)

- Joachim Gudmundsson, Patrick Laube, Thomas Wolle
- Encyclopedia of GIS
- 2008

Spatio-temporal data is any information relating space and time. This entry specifically considers data involving point objects moving over time. The terms entity and trajectory will refer to such a point object and the representation of its movement, respectively. Movement patterns in such data refer to (salient) events and episodes expressed by a set of… (More)

- Hans L. Bodlaender, Corinne Feremans, Alexander Grigoriev, Eelko Penninkx, René Sitters, Thomas Wolle
- Comput. Geom.
- 2006

In this paper we discuss the complexity and approximability of the minimum corridor connection problem where, given a rectilinear decomposition of a rectilinear polygon into “rooms”, one has to find the minimum length tree along the edges of the decomposition such that every room is incident to a vertex of the tree. We show that the problem is strongly… (More)

Let be given an undirected, simple graph G = (V, E). We associate to each vertex a number in [0, 1] its reliability, i.e. the probability that it does not fail. Furthermore, let a set S ⊆ V of servers and a set L ⊆ V of clients be given. Vertex failures are independent of each other. The network reliability asks for the probability that the graph induced by… (More)

Widespread availability of location aware devices (such as GPS receivers) promotes capture of detailed movement trajectories of people, animals, vehicles and other moving objects, opening new options for a better understanding of the processes involved. In this paper we investigate spatio-temporal movement patterns in large tracking data sets. We present a… (More)

A trajectory is a sequence of locations, each associated with a timestamp, describing the movement of a point. Trajectory data is becoming increasingly available and the size of recorded trajectories is getting larger. In this paper we study the problem of compressing planar trajectories such that the most common spatio-temporal queries can still be… (More)

- Joachim Gudmundsson, Thomas Wolle
- Computers, Environment and Urban Systems
- 2012

Analysing a football match is without doubt an important task for coaches, talent scouts, players and even media; and with current technologies more and more match data is collected. Several companies offer the ability to track the position of the players and the ball with high accuracy and high resolution. They also offer software that include basic… (More)

Every lower bound for treewidth can be extended by taking the maximum of the lower bound over all subgraphs or minors. This extension is shown to be a very vital idea for improving treewidth lower bounds. In this paper, we investigate a total of nine graph parameters, providing lower bounds for treewidth. The parameters have in common that they all are the… (More)