We study the problem of finding shortest tours/paths for “lawn mowing” and “milling”
problems: Given a region in the plane, and given the shape of a “cutter”(typically, a circle or …

Handbook of DISCRETE AND COMPUTATIONAL GEOMETRY Page 1 i “K25063” — 2017/9/15
— 18:58 — page 811 — i i i 31 SHORTEST PATHS AND NETWORKS Joseph SB Mitchell …

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 …

Due to the fact that no NP-complete problem can be solved in polynomial time (unless P=
NP), many approximability results (both positive and negative) of NP-hard optimization …

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 …

In this paper, we show that the universal covering space of a surface can be used to unify
previous results on computing paths in a simple polygon. We optimize a given path among …

We study network-design problems with multiple design objectives. In particular, we look at
two cost measures to be minimized simultaneously: the total cost of the network and the …

Consider a traveling salesperson who has a given amount of gasoline (allowing travel up to
distance B) and wants to maximize the number of sites visited before running out of …

We give an O (n log n)-time method for finding a best k-link piecewise-linear function
approximating an n-point planar data set using the well-known uniform metric to measure …