#### Filter Results:

- Full text PDF available (47)

#### Publication Year

1993

2018

- This year (4)
- Last 5 years (14)
- Last 10 years (38)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Brain Region

#### Data Set Used

#### Organism

Learn More

- Jeff Erickson, Kim Whittlesey
- SODA
- 2005

We describe simple greedy algorithms to construct the shortest set of loops that generates either the fundamental group (with a given basepoint) or the first homology group (over any fixed… (More)

- Jeff Erickson, Sariel Har-Peled
- Symposium on Computational Geometry
- 2002

We consider the problem of cutting a set of edges on a polyhedral manifold surface, possibly with boundary, to obtain a single topological disk, minimizing either the total number of cut edges or… (More)

- Pankaj K. Agarwal, Lars Arge, Jeff Erickson
- PODS
- 2000

We propose three indexing schemes for storing a set <italic>S</italic> of <italic>N</italic> points in the plane, each moving along a linear trajectory, so that a query of the following form can be… (More)

Perturbative computations of the expectation value of the Wilson loop in N = 4 supersymmetric Yang-Mills theory are reported. For the two special cases of a circular loop and a pair of anti-parallel… (More)

- Jeff Erickson
- Discrete & Computational Geometry
- 1996

We establish new lower bounds on the complexity of the following basic geometric problem, attributed to John Hopcroft: Given a set of n points and m hyperplanes in IR, is any point contained in any… (More)

- Jeff Erickson
- Symposium on Computational Geometry
- 2001

We consider the complexity of Delaunay triangulations of sets of point s in $\Real^3$ under certain practical geometric constraints. The \emph{spread} of a set of points is the ratio between the… (More)

- Jeff Erickson
- SODA
- 1995

We prove an f2(n Ir”l) lower bound for the following problem: For some fixed linear equation in T variables, given a set of n real numbers, do any T of them satisfy th; ecpmtion? Our lower bound… (More)

- Jeff Erickson, Shripad Thite, Fred Rothganger, Jean Ponce
- IEEE Transactions on Robotics
- 2003

This paper addresses the problem of capturing an arbitrary convex object P in the plane with three congruent disc-shaped robots. Given two stationary robots in contact with P, we characterize the set… (More)

1 Introduction WC show how to preprocess a set S of points in lRd into an external memory data structure that efficiently supports linear-constraint queries. Each query is in the form of a linear… (More)

- David Bremner, Erik D. Demaine, +4 authors Godfried T. Toussaint
- WADS
- 2003

Given a set R of red points and a set B of blue points, the nearest-neighbour decision rule classifies a new point q as red (respectively, blue) if the closest point to q in R ∪ B comes from R… (More)