In order to schematize non-monotone paths we pro- pose a heuristic that first splits the input into k monotone subpaths and then combines the optimal embeddings ...

Motivated from drawing route sketches, we consider the following path schematization problem. We are given a simple embedded polygonal path P = (v 1, ...

We formalize the application problem of drawing route sketches as a geo- metric path schematization problem. Given a plane embedding of a path P, the goal ...

Motivated from drawing route sketches, we consider the following path schematization problem. We are given a simple embedded polygonal path P=(v1, ...

Motivated by drawing route sketches, we consider the d-regular path schematization problem. For this problem we are given an embedded path P (e.g., a route ...

Bibliographic details on Path Schematization for Route Sketches.

We model the problem as a mixed-integer linear program (MIP) that computes schematizations of paths or unions of alternative paths. The solution of the MIP ...

An important property of a route sketch is that it focuses on road changes and important landmarks rather than exact geography and distances. Typically the ...

This work reports on a practical and efficient technique for computing and presenting generalizations of routes, so-called sketches that compress a route ...