H-Index & Metrics Top Publications

H-Index & Metrics

Discipline name H-index Citations Publications World Ranking National Ranking
Computer Science H-index 45 Citations 12,973 169 World Ranking 3522 National Ranking 1811
Mathematics H-index 42 Citations 6,773 159 World Ranking 881 National Ranking 420

Overview

What is he best known for?

The fields of study he is best known for:

  • Algorithm
  • Geometry
  • Artificial intelligence

Jack Snoeyink mainly investigates Combinatorics, Algorithm, Discrete mathematics, Simple polygon and Regular polygon. Many of his research projects under Combinatorics are closely connected to Protein family with Protein family, tying the diverse disciplines of science together. His research integrates issues of Quadratic equation, Line, Geometry and SIMPLE algorithm in his study of Algorithm.

The study incorporates disciplines such as Pitteway triangulation and Minimum-weight triangulation in addition to Discrete mathematics. His Regular polygon study incorporates themes from Path and Plane. His study in the fields of Structure validation under the domain of Protein structure overlaps with other disciplines such as Component.

His most cited work include:

  • MolProbity: all-atom contacts and structure validation for proteins and nucleic acids (3018 citations)
  • MolProbity: More and better reference data for improved all-atom structure validation. (733 citations)
  • Computing contour trees in all dimensions (369 citations)

What are the main themes of his work throughout his whole career to date?

His scientific interests lie mostly in Combinatorics, Algorithm, Discrete mathematics, Voronoi diagram and Regular polygon. The Combinatorics study combines topics in areas such as Plane, Line segment and Convex hull. His work on Computational geometry as part of general Algorithm study is frequently linked to sort, therefore connecting diverse disciplines of science.

His Discrete mathematics research is multidisciplinary, incorporating perspectives in Delaunay triangulation, Monotone polygon and Degree. Jack Snoeyink works mostly in the field of Voronoi diagram, limiting it down to concerns involving Pitteway triangulation and, occasionally, Minimum-weight triangulation. His Regular polygon research is multidisciplinary, relying on both Upper and lower bounds, Polyhedron and Piecewise.

He most often published in these fields:

  • Combinatorics (52.96%)
  • Algorithm (19.86%)
  • Discrete mathematics (18.82%)

What were the highlights of his more recent work (between 2009-2021)?

  • Combinatorics (52.96%)
  • Algorithm (19.86%)
  • Regular polygon (10.80%)

In recent papers he was focusing on the following fields of study:

His primary areas of study are Combinatorics, Algorithm, Regular polygon, Simply connected space and Efficient algorithm. His Combinatorics research is multidisciplinary, incorporating elements of Point and Euclidean distance. His Algorithm study combines topics from a wide range of disciplines, such as Quadric, Intersection, Mathematical optimization and Range.

His Regular polygon research integrates issues from Time complexity, Polyhedron, Triangulation and Lebesgue integration. Jack Snoeyink has researched Simply connected space in several fields, including Cover, Covering space, Equilateral triangle, Upper and lower bounds and Piecewise. In his work, Line segment and Geometry is strongly intertwined with Simulation, which is a subfield of Efficient algorithm.

Between 2009 and 2021, his most popular works were:

  • MolProbity: More and better reference data for improved all-atom structure validation. (733 citations)
  • Scientific Benchmarks for Guiding Macromolecular Energy Function Improvement (156 citations)
  • Combined covalent-electrostatic model of hydrogen bonding improves structure prediction with Rosetta (144 citations)

In his most recent research, the most cited papers focused on:

  • Algorithm
  • Geometry
  • Artificial intelligence

His primary scientific interests are in Combinatorics, Delaunay triangulation, Pitteway triangulation, Bowyer–Watson algorithm and Polygon. His Combinatorics study typically links adjacent topics like Euclidean distance. His Delaunay triangulation study often links to related topics such as Discrete mathematics.

Jack Snoeyink combines subjects such as Minimum-weight triangulation and Constrained Delaunay triangulation with his study of Discrete mathematics. His study in Bowyer–Watson algorithm is interdisciplinary in nature, drawing from both Power diagram, Centroidal Voronoi tessellation and Weighted Voronoi diagram. Artificial intelligence is closely connected to Computer vision in his research, which is encompassed under the umbrella topic of Polygon.

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.

Top Publications

MolProbity: all-atom contacts and structure validation for proteins and nucleic acids

Ian W. Davis;Andrew Leaver-Fay;Vincent B. Chen;Jeremy N. Block.
Nucleic Acids Research (2007)

3714 Citations

MolProbity: More and better reference data for improved all-atom structure validation.

Christopher J. Williams;Jeffrey J. Headd;Nigel W. Moriarty;Michael G. Prisant.
Protein Science (2018)

745 Citations

Computing contour trees in all dimensions

Hamish Carr;Jack Snoeyink;Ulrike Axen.
Computational Geometry: Theory and Applications (2003)

646 Citations

Speeding Up the Douglas-Peucker Line-Simplification Algorithm

John Hershberger;Jack Snoeyink.
(1992)

497 Citations

Simplifying Flexible Isosurfaces Using Local Geometric Measures

Hamish Carr;Jack Snoeyink;Michiel van de Panne.
ieee visualization (2004)

257 Citations

Computing minimum length paths of a given homotopy class

John Hershberger;Jack Snoeyink.
Computational Geometry: Theory and Applications (1994)

235 Citations

Streaming computation of Delaunay triangulations

Martin Isenburg;Yuanxin Liu;Jonathan Shewchuk;Jack Snoeyink.
international conference on computer graphics and interactive techniques (2006)

221 Citations

Face fixer: compressing polygon meshes with properties

Martin Isenburg;Jack Snoeyink.
international conference on computer graphics and interactive techniques (2000)

212 Citations

Ray shooting in polygons using geodesic triangulations

Bernard Chazelle;Herbert Edelsbrunner;Michelangelo Grigni;Leonidas J. Guibas;Leonidas J. Guibas.
Algorithmica (1994)

200 Citations

Scientific Benchmarks for Guiding Macromolecular Energy Function Improvement

Andrew P Leaver-Fay;Matthew J. O'Meara;Mike Tyka;Ron Jacak.
Methods in Enzymology (2013)

196 Citations

Profile was last updated on December 6th, 2021.
Research.com Ranking is based on data retrieved from the Microsoft Academic Graph (MAG).
The ranking h-index is inferred from publications deemed to belong to the considered discipline.

If you think any of the details on this page are incorrect, let us know.

Contact us

Top Scientists Citing Jack Snoeyink

Micha Sharir

Micha Sharir

Tel Aviv University

Publications: 96

Paul D. Adams

Paul D. Adams

Lawrence Berkeley National Laboratory

Publications: 62

Valerio Pascucci

Valerio Pascucci

University of Utah

Publications: 61

David Baker

David Baker

University of Washington

Publications: 60

Pankaj K. Agarwal

Pankaj K. Agarwal

Duke University

Publications: 56

Joseph S. B. Mitchell

Joseph S. B. Mitchell

Stony Brook University

Publications: 53

Marc van Kreveld

Marc van Kreveld

Utrecht University

Publications: 47

Prosenjit Bose

Prosenjit Bose

Carleton University

Publications: 44

Peer-Timo Bremer

Peer-Timo Bremer

Lawrence Livermore National Laboratory

Publications: 44

Mark de Berg

Mark de Berg

Eindhoven University of Technology

Publications: 40

Dan Halperin

Dan Halperin

Tel Aviv University

Publications: 39

Danny Z. Chen

Danny Z. Chen

University of Notre Dame

Publications: 38

David Eppstein

David Eppstein

University of California, Irvine

Publications: 37

Ian A. Wilson

Ian A. Wilson

Scripps Research Institute

Publications: 36

Timothy M. Chan

Timothy M. Chan

University of Illinois at Urbana-Champaign

Publications: 35

Something went wrong. Please try again later.