J
Jeff Erickson
Researcher at University of Illinois at Urbana–Champaign
Publications - 166
Citations - 5407
Jeff Erickson is an academic researcher from University of Illinois at Urbana–Champaign. The author has contributed to research in topics: Planar graph & Time complexity. The author has an hindex of 43, co-authored 166 publications receiving 5136 citations. Previous affiliations of Jeff Erickson include National Center for Supercomputing Applications & Eindhoven University of Technology.
Papers
More filters
Proceedings ArticleDOI
Raising roofs, crashing cycles, and playing pool: applications of a data structure for finding pairwise interactions
David Eppstein,Jeff Erickson +1 more
TL;DR: The straight skeleton of an n -gon with r reflex vertices is constructed in time O(n 1+e + n 8/11+e r 9/11-e ) , for any fixed e >0, improving the previous best upper bound of O(nr log n) .
Journal ArticleDOI
Optimally Cutting a Surface into a Disk
Jeff Erickson,Sariel Har-Peled +1 more
TL;DR: It is shown that this problem of cutting a subset of the edges of a polyhedral manifold surface, possibly with boundary, to obtain a single topological disk is NP-hard in general, even for manifolds without boundary and for punctured spheres.
Proceedings ArticleDOI
Indexing moving points (extended abstract)
TL;DR: An efficient indexing scheme to answer approximate nearest-neighbor queries among moving points is developed and a trade off between the query time and the number of times the index needs to be updated as the points move is obtained.
Proceedings ArticleDOI
Iterated nearest neighbors and finding minimal polytypes
David Eppstein,Jeff Erickson +1 more
TL;DR: A new method for finding several types of optimalk-point sets, minimizing perimeter, diameter, circumradius, and related measures, by testing sets of theO(k) nearest neighbors to each point, which is better in a number of ways than previous algorithms, which were based on high-order Voronoi diagrams.
Journal ArticleDOI
Iterated nearest neighbors and finding minimal polytopes
David Eppstein,Jeff Erickson +1 more
TL;DR: In this paper, a new method for finding several types of optimalk-point sets, minimizing perimeter, diameter, circumradius, and related measures, by testing sets of the O(k) nearest neighbors to each point was proposed.