#### Filter Results:

- Full text PDF available (5)

#### Publication Year

2013

2017

- This year (1)
- Last 5 years (5)
- Last 10 years (5)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- Sander P. A. Alewijnse, Kevin Buchin, Maike Buchin, Andrea Kölzsch, Helmut Kruckenberg, Michel A. Westenberg
- SIGSPATIAL/GIS
- 2014

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, in the sense that… (More)

- Sander P. A. Alewijnse, Kevin Buchin, Maike Buchin, Stef Sijben, Michel A. Westenberg
- Algorithmica
- 2017

We present efficient algorithms for segmenting and classifying trajectories based on a movement model parameterised by a single parameter, like the Brownian bridge movement model. Segmentation is the problem of subdividing a trajectory into interior-disjoint parts such that each part is homogeneous in its movement characteristics. We formalise this using… (More)

- Sander P. A. Alewijnse, Quirijn W. Bouts, Alex P. ten Brink, Kevin Buchin
- Algorithmica
- 2013

The greedy spanner is a high-quality spanner: its total weight, edge count and maximal degree are asymptotically optimal and in practice significantly better than for any other spanner with reasonable construction time. Unfortunately, all known algorithms that compute the greedy spanner on $$n$$ n points use $$\varOmega (n^2)$$ Ω ( n 2 ) space, which is… (More)

- Sander P. A. Alewijnse, Quirijn W. Bouts, Alex P. ten Brink, Kevin Buchin
- Algorithmica
- 2014

The greedy spanner is the highest quality geometric spanner (in e.g. edge count and weight, both in theory and practice) known to be computable in polynomial time. Unfortunately, all known algorithms for computing it on n points take $$\varOmega (n^2)$$ Ω ( n 2 ) time, limiting its applicability on large data sets. We propose a novel algorithm design which… (More)

- Sander P. A. Alewijnse, Timur M. Bagautdinov, +4 authors Michel A. Westenberg
- JoCG
- 2014

Progressive algorithms are algorithms that, on the way to computing a complete solution to the problem at hand, output intermediate solutions that approximate the complete solution increasingly well. We present a framework for analyzing such algorithms, and develop efficient progressive algorithms for two geometric problems: computing the convex hull of a… (More)

- ‹
- 1
- ›