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 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.
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.
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.
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)
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)
Computing contour trees in all dimensions
Hamish Carr;Jack Snoeyink;Ulrike Axen.
Computational Geometry: Theory and Applications (2003)
Speeding Up the Douglas-Peucker Line-Simplification Algorithm
John Hershberger;Jack Snoeyink.
Simplifying Flexible Isosurfaces Using Local Geometric Measures
Hamish Carr;Jack Snoeyink;Michiel van de Panne.
ieee visualization (2004)
Computing minimum length paths of a given homotopy class
John Hershberger;Jack Snoeyink.
Computational Geometry: Theory and Applications (1994)
Streaming computation of Delaunay triangulations
Martin Isenburg;Yuanxin Liu;Jonathan Shewchuk;Jack Snoeyink.
international conference on computer graphics and interactive techniques (2006)
Face fixer: compressing polygon meshes with properties
Martin Isenburg;Jack Snoeyink.
international conference on computer graphics and interactive techniques (2000)
Ray shooting in polygons using geodesic triangulations
Bernard Chazelle;Herbert Edelsbrunner;Michelangelo Grigni;Leonidas J. Guibas;Leonidas J. Guibas.
Scientific Benchmarks for Guiding Macromolecular Energy Function Improvement
Andrew P Leaver-Fay;Matthew J. O'Meara;Mike Tyka;Ron Jacak.
Methods in Enzymology (2013)
If you think any of the details on this page are incorrect, let us know.
We appreciate your kind effort to assist us to improve this page, it would be helpful providing us with as much detail as possible in the text box below: