Author pages are created from data sourced from our academic publisher partnerships and public sources.

- Publications
- Influence

Touring a sequence of polygons

- M. Dror, A. Efrat, A. Lubiw, J. Mitchell
- Computer Science, Mathematics
- STOC '03
- 9 June 2003

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… Expand

Geometry Helps in Bottleneck Matching and Related Problems

Abstract. Let A and B be two sets of n objects in \realsd , 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… Expand

The resilience of WDM networks to probabilistic geographical failures

- P. Agarwal, A. Efrat, Shashidhara K. Ganjugunte, D. Hay, S. Sankararaman, G. Zussman
- Computer Science
- INFOCOM
- 10 April 2011

Telecommunications networks, and in particular optical WDM networks, are vulnerable to large-scale failures of their physical infrastructure, resulting from physical attacks (such as an… Expand

Approximation algorithms for two optimal location problems in sensor networks

- A. Efrat, Sariel Har-Peled, J. Mitchell
- Computer Science
- 2nd International Conference on Broadband…
- 3 October 2005

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… Expand

Guarding galleries and terrains

- A. Efrat, Sariel Har-Peled
- Mathematics, Computer Science
- Inf. Process. Lett.
- 25 August 2002

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… Expand

Matching planar maps

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… Expand

The complexity of the union of (α, β)-covered objects

- A. Efrat
- Computer Science, Mathematics
- SCG '99
- 13 June 1999

An (α, β)-covered object is a simply connected planar region c with the property that for each point p ∈ ∂c there exists a triangle contained in c and having p as a vertex, such that all its angles… Expand

Using and Determining Location in a Context-Sensitive Tour Guide

- N. Davies, K. Cheverst, K. Mitchell, A. Efrat
- Computer Science
- Computer
- 1 August 2001

In a study that provided unique insights into the challenges associated with developing location-based applications, the Lancaster Guide project used members of the general public to test a… Expand

On simultaneous planar graph embeddings

- P. Braß, Eowyn Cenek, +6 authors J. Mitchell
- Mathematics, Computer Science
- Comput. Geom.
- 1 February 2007

We consider the problem of simultaneous embedding of planar graphs. There are two variants of this problem, one in which the mapping between the vertices of the two graphs is given and another in… Expand

The Resilience of WDM Networks to Probabilistic Geographical Failures

- P. Agarwal, A. Efrat, Shashidhara K. Ganjugunte, D. Hay, S. Sankararaman, G. Zussman
- Computer Science
- IEEE/ACM Transactions on Networking
- 1 October 2013

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… Expand