Searching for authors named Jeff Erickson – sorted by Relevance.
-
Space-Time Tradeoffs for Emptiness Queries (Extended Abstract)
- Space-Time Tradeoffs for Emptiness Queries (Extended abstract) Jeff Erickson Center
- Add To MetaCart
-
New Toads and Frogs results
- Games of No Chance MSRI Publications Volume 29, 1996 New Toads and Frogs Results JEFF ERICKSON
- Cited by 1 (0 self) – Add To MetaCart
-
Local polyhedra and geometric graphs
- Local Polyhedra and Geometric Graphs # Je# Erickson + University of Illinois at Urbana
- Cited by 6 (0 self) – Add To MetaCart
-
New Lower Bounds for Halfspace Emptiness
- New Lower Bounds for Halfspace Emptiness Jeff Erickson Computer Science Division University
- Cited by 3 (2 self) – Add To MetaCart
-
On the Relative Complexities of Some Geometric Problems
- On the Relative Complexities of Some Geometric Problems Jeff Erickson Computer Science Division
- Cited by 15 (7 self) – Add To MetaCart
-
New Lower Bounds for Convex Hull Problems in Odd Dimensions
- NEW LOWER BOUNDS FOR CONVEX HULL PROBLEMS IN ODD DIMENSIONS JEFF ERICKSON y Abstract. We show
- Cited by 25 (7 self) – Add To MetaCart
-
Nice Point Sets Can Have Nasty Delaunay Triangulations
- Nice Point Sets Can Have Nasty Delaunay Triangulations* Jeff Erickson University of Illinois
- Cited by 36 (5 self) – Add To MetaCart
-
Dense Point Sets Have Sparse Delaunay Triangulations or ". . . But Not Too Nasty"
- Dense Point Sets Have Sparse Delaunay Triangulations or \. . . But Not Too Nasty" Je Erickson
- Cited by 19 (2 self) – Add To MetaCart
-
Finite-Resolution Hidden Surface Removal
- Finite-Resolution Hidden Surface Removal Je Erickson y Abstract We propose a hybrid image
- Cited by 1 (0 self) – Add To MetaCart
-
New Lower Bounds for Hopcroft's Problem
- -Verlag New York Inc. New Lower Bounds for Hopcroft’s Problem ∗ J. Erickson Computer Science Division
- Cited by 30 (6 self) – Add To MetaCart

