Name
Papers
Collaborators
JACK SNOEYINK
179
239
Citations 
PageRank 
Referers 
2842
231.68
3970
Referees 
References 
1836
1977
Search Limit
1001000
Title
Citations
PageRank
Year
Computation of spatial skyline points10.352021
Creating a robust implementation for segment intersection by refinement: A multistage assignment that defines away degeneracies.00.342016
Time, Space, and Precision: Revisiting Classic Problems in Computational Geometry with Degree-Driven Analysis, pp. 280.00.342014
Frontiers in algorithmics.50.542014
Almost all Delaunay triangulations have stretch factor greater than pi/230.472011
Reconstructing polygons from scanner data100.842011
Proceedings of the 26th ACM Symposium on Computational Geometry, Snowbird, Utah, USA, June 13-16, 2010362.572010
Flexible isosurfaces: Simplifying and displaying scalar topology using the contour tree431.552010
Computation of non-dominated points using compact voronoi diagrams20.362010
Maximum geodesic routing in the plane with obstacles00.342010
Identification of family-specific residue packing motifs and their use for structure-based protein function prediction: I. Method development.80.582009
On Finding Non-dominated Points using Compact Voronoi Diagrams00.342009
Reducing the memory required to find a geodesic shortest path on a large mesh40.402009
Bio-geometry: challenges, approaches, and future opportunities in proteomics and drug discovery00.342008
Faraway Point: A Senitel Point For Delaunay Computation20.372008
How long can a graph be kept planar?20.432008
Terrain Representation using Right-Triangulated Irregular Networks20.402007
Defining and computing optimum RMSD for gapped multiple structure alignment00.342007
Maintaining solvent accessible surface area under rotamer substitution for protein design.20.392007
MolProbity: all-atom contacts and structure validation for proteins and nucleic acids.493.332007
Artifacts caused by simplicial subdivision231.182006
VisTRE: A Visualization Tool to Evaluate Errors in Terrain Representation10.372006
Counting and Enumerating Pointed Pseudotriangulations with the Greedy Flip Algorithm170.882006
Sphere-based Computation of Delaunay Diagrams on Points from 4d Grids00.342006
Illustrating the streaming construction of 2D delaunay triangulations10.372006
Efficient algorithm for approximating maximum inscribed sphere in high dimensional polytope20.412006
Rotamer-pair energy calculations using a trie data structure30.522005
Maximum Independent Set for Intervals by Divide-Prune-and-Conquer00.342005
Probik: Protein Backbone Motion by Inverse Kinematics.40.472005
Delineating Boundaries for Imprecise Regions120.812005
Polygonal path simplification with angle constraints90.692005
Testing Shortcuts to Maintain Simplicity in Subdivision Simplification10.392005
Implementing time-varying contour trees10.362005
Banana spiders: A study of connectivity in 3d combinatorial rigidity30.402004
Proceedings of the 20th ACM Symposium on Computational Geometry, Brooklyn, New York, USA, June 8-11, 2004304.922004
Simplifying Flexible Isosurfaces Using Local Geometric Measures843.222004
A 2-chain can interlock with a k-chain10.432004
Binary compression rates for ASCII formats40.502003
Path seeds and flexible isosurfaces using topology for exploratory visualization341.452003
Large Mesh Simplification using Processing Sequences561.972003
Ununfoldable polyhedra with convex faces212.182003
Interlocked open and closed linkages with few joints41.002003
Approximating the geometric minimum-diameter spanning tree.20.372003
Efficiently Approximating Polygonal Paths in Three and Higher Dimensions251.332002
Some Aperture-Angle Optimization Problems40.532002
Algorithmic issues in modeling motion301.962002
Coding with ASCII: compact, yet text-based 3D content60.762002
Testing Homotopy for paths in the plane361.412002
Heaphull?00.342001
Counting triangulations and pseudo-triangulations of wheels151.012001
  • 1
  • 2