Given a sequence of <i>k</i> polygons in the plane, a start point <i>s</i>, and a target point, <i>t</i>, we seek a shortest path that starts at <i>s</i>, visits in order each of the polygons, andâ€¦ (More)

The subject of this paper are algorithms for measuring the similarity of patterns of line segments in the plane, a standard problem in, e.g. computer vision, geographic information systems, etc. Moreâ€¦ (More)

Telecommunications networks, and in particular optical WDM networks, are vulnerable to large-scale failures in their physical infrastructure, resulting from physical attacks (such as anâ€¦ (More)

Let A and B be two sets of n objects in \reals d , and let Match be a (one-to-one) matching between A and B . Let min(Match ), max(Match ), and Î£(Match) denote the length of the shortest edge, theâ€¦ (More)

This paper study two problems that arise in optimization of sensor networks: First, we devise provable approximation schemes for locating a base station and constructing a network among a set ofâ€¦ (More)

We present a near-quadratic time algorithm that computes a point inside a simple polygon P having approximately the largest visibility polygon inside P, and near-linear time algorithm for finding theâ€¦ (More)

Let P be a polygon with n vertices. We say that two points of P see each other if the line segment connecting them lies inside (the closure of) P . In this paper we present efficient approximationâ€¦ (More)