Alon Efrat
Cited by
Cited by
Using and determining location in a context-sensitive tour guide
N Davies, K Cheverst, K Mitchell, A Efrat
Computer 34 (8), 35-41, 2001
Geometry helps in bottleneck matching and related problems
A Efrat, A Itai, MJ Katz
Algorithmica 31 (1), 1-28, 2001
Matching planar maps
H Alt, A Efrat, G Rote, C Wenk
Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete …, 2003
The resilience of WDM networks to probabilistic geographical failures
PK Agarwal, A Efrat, SK Ganjugunte, D Hay, S Sankararaman, ...
IEEE/ACM Transactions on Networking 21 (5), 1525-1538, 2013
Curve matching, time warping, and light fields: New algorithms for computing similarity between curves
A Efrat, Q Fan, S Venkatasubramanian
Journal of Mathematical Imaging and Vision 27, 203-216, 2007
Approximation algorithms for two optimal location problems in sensor networks
A Efrat, S Har-Peled, JSB Mitchell
2nd International Conference on Broadband Networks, 2005., 714-723, 2005
Vertical decomposition of shallow levels in 3-dimensional arrangements and its applications
PK Agarwal, A Efrat, M Sharir
Proceedings of the eleventh annual symposium on Computational geometry, 39-50, 1995
System and method for detecting proximity between mobile device users
A Amir, A Efrat
US Patent 7,289,814, 2007
Touring a sequence of polygons
M Dror, A Efrat, A Lubiw, JSB Mitchell
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing …, 2003
On simultaneous planar graph embeddings
P Brass, E Cenek, CA Duncan, A Efrat, C Erten, DP Ismailescu, ...
Computational Geometry 36 (2), 117-130, 2007
Sweeping simple polygons with a chain of guards
A Efrat, LJ Guibas, S Har-Peled, DC Lin, JSB Mitchell, TM Murali
Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms …, 2000
Buddy tracking—efficient proximity detection among mobile friends
A Amir, A Efrat, J Myllymaki, L Palaniappan, K Wampler
Pervasive and Mobile Computing 3 (5), 489-511, 2007
Guarding galleries and terrains
A Efrat, S Har-Peled
Information processing letters 100 (6), 238-245, 2006
Finding a guard that sees most and a shop that sells most
O Cheong, A Efrat, S Har-Peled
Discrete & Computational Geometry 37, 545-563, 2007
Ants, crickets and frogs in cyclic pursuit
AM Bruckstein, N Cohen, A Efrat
Technion-Israel Institute of Technology. Center for Intelligent Systems, 1991
Computing homotopic shortest paths efficiently
A Efrat, SG Kobourov, A Lubiw
Computational Geometry 35 (3), 162-172, 2006
Computing the smallest k-enclosing circle and related problems
A Efrat, M Sharir, A Ziv
Computational Geometry 4 (3), 119-136, 1994
Geometric algorithms for the analysis of 2D-electrophoresis gels
A Efrat, F Hoffmann, K Kriegel, C Schultz, C Wenk
Journal of Computational Biology 9 (2), 299-315, 2002
Planning robot motion strategies for efficient model construction
H González-Baños, E Mao, JC Latombe, TM Murali, A Efrat
Robotics Research: The Ninth International Symposium, 345-352, 2000
On the performance of the ICP algorithm
E Ezra, M Sharir, A Efrat
Computational Geometry 41 (1-2), 77-93, 2008
The system can't perform the operation now. Try again later.
Articles 1–20