22 citations · 22 across the 1 of their papers we have counts for
3 papers
cs.CG2002★ 22 cited
On Simultaneous Graph Embedding
C. A. Duncan, A. Efrat, C. Erten +2
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…
cs.CG2002
Computing Homotopic Shortest Paths Efficiently
Alon Efrat, Stephen G. Kobourov, Anna Lubiw
This paper addresses the problem of finding shortest paths homotopic to a given disjoint set of paths that wind amongst point obstacles in the plane. We present a faster algorithm…
cs.CG2000
Pattern Matching for sets of segments
Alon Efrat, Piotr Indyk, Suresh Venkatasubramanian
In this paper we present algorithms for a number of problems in geometric pattern matching where the input consist of a collections of segments in the plane. Our work consists of t…