Modern virtual environments can contain a variety of characters and traversable regions.
Each character may have different preferences for the traversable region types. Pedestrians …

Let S be a subdivision of the plane into polygonal regions, where each region has an
associated positive weight. The weighted region shortest path problem is to determine a …

Given a grid of cells, each having a value indicating its cost per unit area, a variant of the
least-cost path problem is to find a corridor of a specified width connecting two termini such …

The Fréchet distance is a well studied and commonly used measure to capture the similarity
of polygonal curves. Unfortunately, it exhibits a high sensitivity to the presence of outliers …

We present an approximation algorithm for the shortest descending path problem. Given a
source s and a destination t on a terrain, a shortest descending path from s to t is a path of …

The least-cost path problem is a widely studied problems in geographic information science.
In raster space, the problem is to find a path that accumulates the least amount of cost …

The Weighted Region Problem is defined as the problem of finding a cost-optimal path in a
weighted planar polygonal subdivision. Searching for paths on a grid representation of the …

A path on a polygonal terrain is gentle if it does not ascend or descend too steeply, ie, its
gradient is below a given threshold θ at every point. The constriction to gentle paths makes …

Modern virtual environments can contain a variety of characters and traversable regions.
Each character may have different preferences for the traversable region types. Pedestrians …

Given a grid of cells, each having a value indicating its cost per unit area, a variant of the
least-cost path problem is to find a corridor of a specified width connecting two termini such …