A natural and well-studied problem in algorithmic graph theory and network optimization is
that of computing a\shortest path" between two nodes, s and t, in a graph whose edges …

A human observer can effortlessly identify visible portions of geometric objects present in the
environment. However, computations of visible portions of objects from a viewpoint involving …

In this paper a model that handles costs of turns in route planning is defined, investigated
and discussed. Costs are traditionally attached to edges in a graph. For some important …

Handbook of DISCRETE AND COMPUTATIONAL GEOMETRY Page 1 i “K25063” — 2017/9/15
— 18:58 — page 875 — i i i 33 VISIBILITY Joseph O’Rourke INTRODUCTION In a …

Lightness and sparsity are two natural parameters for Euclidean (1+ε)-spanners. Classical
results show that, when the dimension d∈N and ε>0 are constant, every set S of n points in …

A path or a polygonal domain is C-oriented if the orientations of its edges belong to a set of
C given orientations; this is a generalization of the notable rectilinear case (C= 2). We study …

Lightness is a fundamental parameter for Euclidean spanners; it is the ratio of the spanner
weight to the weight of the minimum spanning tree of a finite set of points in $\mathbb {R}^ d …

In application areas such as geographical information systems, the Euclidean metric is often
less meaningfully applied to determine a shortest path than metrics which capture, through …

Lightness and sparsity are two natural parameters for Euclidean $(1+\varepsilon) $-
spanners. Classical results show that, when the dimension $ d\in\mathbb {N} $ and …

Given a finite set of points S in ℝ d, consider visiting the points in S with a polygonal path
which makes a minimum number of turns, or equivalently, has the minimum number of …