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
Book ChapterDOI
Efficient Tradeoff Schemes in Data Structures for Querying Moving Objects
TL;DR: Data structures for answering various queries on moving objects, including range and proximity queries, are developed, and tradeoffs between various performance measures—query time, data structure size, and accuracy of results are studied.
Proceedings ArticleDOI
New lower bounds for halfspace emptiness
TL;DR: The author derives a lower bound of /spl Omega/(n/sup 4/3/) for the halfspace emptiness problem: given a set of n points and n hyperplanes in R/sup 5/, is every point above every hyperplane?
Book ChapterDOI
Tightening curves on surfaces via local moves
Hsien-Chih Chang,Jeff Erickson,David Letscher,Arnaud de Mesmay,Saul Schleimer,Eric Sedgwick,Dylan P. Thurston,Stephan Tillmann +7 more
TL;DR: It is proved that Ω(n2) moves are required in the worst case to tighten a contractible closed curve on a surface with non-positive Euler characteristic, where n is the number of self-intersection points.
Posted Content
Recognizing Weakly Simple Polygons
TL;DR: An O(n log n)-time algorithm is presented that determines whether a given planar n-gon is weakly simple and improves upon an O( n^2 log n) time algorithm by [Chang, Erickson, and Xu, SODA, 2015].
Proceedings ArticleDOI
Lower bounds for external algebraic decision trees
TL;DR: A natural extension of algebraic decision trees to the external-memory setting, where the cost of disk operations overwhelms CPU time, is proposed, and a tight lower bound of Ω(n log m) is proved on the complexity of both sorting and element uniqueness in this model of computation.