What is he best known for?
The fields of study he is best known for:
- Combinatorics
- Geometry
- Algorithm
Jeff Erickson mainly investigates Combinatorics, Discrete mathematics, Point, Homotopy and Upper and lower bounds.
His work deals with themes such as Boundary, Convex hull and Greedy algorithm, which intersect with Combinatorics.
His research integrates issues of Rectangle, Cover, Computational topology and Search engine indexing in his study of Discrete mathematics.
His Point study integrates concerns from other disciplines, such as Voronoi diagram, Line, Domain and Algorithm.
His Homotopy research is multidisciplinary, relying on both Image, Simplicial complex, Type, Finite set and Euclidean geometry.
His studies deal with areas such as Binary logarithm, Medial axis, Dimension and Binary number as well as Upper and lower bounds.
His most cited work include:
- Indexing moving points (229 citations)
- Greedy optimal homotopy and homology generators (196 citations)
- Raising Roofs, Crashing Cycles, and Playing Pool: Applications of a Data Structure for Finding Pairwise Interactions (151 citations)
What are the main themes of his work throughout his whole career to date?
His main research concerns Combinatorics, Discrete mathematics, Time complexity, Upper and lower bounds and Planar graph.
The concepts of his Combinatorics study are interwoven with issues in Homotopy, Surface and Computational topology.
He has included themes like Point, Plane and Hyperplane in his Discrete mathematics study.
His Point research incorporates themes from Algorithm, Delaunay triangulation, Type, Finite set and Line.
His study on Time complexity also encompasses disciplines like
- Directed graph together with Homology,
- Minimum cut which connect with Greedy algorithm.
He has researched Upper and lower bounds in several fields, including Model of computation, Computational geometry, Medial axis and Dimension.
He most often published in these fields:
- Combinatorics (68.75%)
- Discrete mathematics (37.50%)
- Time complexity (17.05%)
What were the highlights of his more recent work (between 2014-2021)?
- Combinatorics (68.75%)
- Planar graph (13.64%)
- Homotopy (11.93%)
In recent papers he was focusing on the following fields of study:
Jeff Erickson spends much of his time researching Combinatorics, Planar graph, Homotopy, Discrete mathematics and Upper and lower bounds.
His Combinatorics research focuses on Torus and how it relates to Geodesic.
His research on Planar graph also deals with topics like
- Treewidth which is related to area like Jordan curve theorem, Chordal graph, Tree-depth, Indifference graph and 1-planar graph,
- Embedding that intertwine with fields like Matrix multiplication and Euclidean geometry.
His research in Homotopy tackles topics such as Contractible space which are related to areas like Boundary.
His study explores the link between Discrete mathematics and topics such as Simple polygon that cross with problems in Open problem, Bounded function and Point.
He interconnects Medial graph and Surface in the investigation of issues within Upper and lower bounds.
Between 2014 and 2021, his most popular works were:
- Detecting weakly simple polygons (25 citations)
- Recognizing Weakly Simple Polygons (15 citations)
- Untangling Planar Curves (11 citations)
In his most recent research, the most cited papers focused on:
- Geometry
- Combinatorics
- Algorithm
His primary areas of investigation include Combinatorics, Planar graph, Discrete mathematics, Homotopy and Upper and lower bounds.
The various areas that he examines in his Combinatorics study include Simple, Geodesic and Convex hull.
His Planar graph study combines topics from a wide range of disciplines, such as Time complexity, Algorithm, Optimization problem and Flow network.
His work carried out in the field of Discrete mathematics brings together such families of science as Model of computation, Real RAM and Art gallery problem.
His biological study spans a wide range of topics, including Matching, Jordan curve theorem, Contractible space and Treewidth.
The Upper and lower bounds study combines topics in areas such as Boundary, Surface, Euler characteristic and Exponential function.
This overview was generated by a machine learning system which analysed the scientist’s
body of work. If you have any feedback, you can
contact us
here.
