Jeffrey Gordon Erickson

Univ. of Illinois, Urbana-Champaign, Dept. of Computer Science
http://compgeom.cs.uiuc.edu/~jeffe/
jeffe@cs.uiuc.edu

Author, editor, or reviewer of:

• Building space-time meshes over arbitrary spatial domains
• Flipping cubical meshes
• Greedy optimal homotopy and homology generators
• Iterated nearest neighbors and finding minimal polytopes
• Kinetic collision detection between simple polygons
• Lower Bounds for Fundamental Geometric Problems
• New algorithms for minimum measure simplices and one-dimensional weighted Voronoi diagrams
• New lower bounds for halfspace emptiness
• Nice point sets can have nasty Delaunay triangulations
• Optimally cutting a surface into a disk
• Raising roofs, crashing cycles, and playing pool: applications of a data structure for finding pairwise interactions
• Tightening non-simple paths and cycles on surfaces
• Vertex-unfoldings of simplicial manifolds
• Vertex-unfoldings of simplicial polyhedra