Search filters

List of works by Jack Snoeyink

A lower bound for multicast key distribution

article by Jack Snoeyink et al published February 2005 in Computer Networks

Algorithmic issues in modeling motion

Almost all Delaunay triangulations have stretch factor greater than π / 2

article by Jit Bose et al published February 2011 in Computational Geometry

Almost-Delaunay simplices: Robust neighbor relations for imprecise 3D points using CGAL

article

An efficient algorithm for finding the CSG representation of a simple polygon

Artifacts caused by simplicial subdivision

scientific article

Bio-geometry

Capturing crossings: Convex hulls of segment and plane intersections

Coding polygon meshes as compressable ASCII

Combined covalent-electrostatic model of hydrogen bonding improves structure prediction with Rosetta

scientific article (publication date: 10 February 2015)

Comparing graph representations of protein structure for mining family-specific residue-based packing motifs.

scientific article

Compressing the Property Mapping of Polygon Meshes

Computation of Non-dominated Points Using Compact Voronoi Diagrams

Computing a (1+ε)-Approximate Geometric Minimum-Diameter Spanning Tree

article

Computing contour trees in all dimensions

article

Computing minimum length paths of a given homotopy class

Computing planar Voronoi diagrams in double precision

Computing the Implicit Voronoi Diagram in Triple Precision

Computing the Nearest Neighbor Transform Exactly with Only Double Precision

Counting and Enumerating Pointed Pseudotriangulations with the Greedy Flip Algorithm

Counting and Reporting Red/Blue Segment Intersections

Counting and cutting cycles of lines and rods in space

Defining and computing optimum RMSD for gapped and weighted multiple-structure alignment

scientific article published in October 2008

Degree-Driven Design for Correct Geometric Algorithms

scholarly article by Jack Snoeyink published 2011 in Lecture Notes in Computer Science

Delaunay triangulation of imprecise points in linear time after preprocessing

Delaunay triangulations of imprecise pointsin linear time after preprocessing

Delineating Boundaries for Imprecise Regions

Editorial

Editorial

Efficient Algorithms for Maximum Regression Depth

Encoding volumetric grids for streaming isosurface extraction

FARAWAY POINT: A SENTINEL POINT FOR DELAUNAY COMPUTATION

Faster placement of hydrogens in protein structures by dynamic programming

Fitting spheres to electron density

Flexible isosurfaces: Simplifying and displaying scalar topology using the contour tree

article published in 2010

Frontiers in algorithmics

Functional Neighbors: Inferring Relationships between Non-Homologous Protein Families Using Family-Specific Packing Motifs

Functional neighbors: inferring relationships between nonhomologous protein families using family-specific packing motifs

scientific article published on 21 June 2010

Generating random polygons with given vertices

Identification of family-specific residue packing motifs and their use for structure-based protein function prediction: I. Method development.

scientific article

Identification of family-specific residue packing motifs and their use for structure-based protein function prediction: II. Case studies and applications

scientific article

Implementing time-varying contour trees

Implicitly Representing Arrangements of Lines or Segments

journal article from 'Discrete & Computational Geometry' published in 1989

Interlocked open and closed linkages with few joints

Large mesh simplification using processing sequences

Lossless compression of predicted floating-point geometry

Maintaining solvent accessible surface area under rotamer substitution for protein design

scientific article published in June 2007

Maximum independent set for intervals by divide and conquer with pruning

Modestly faster histogram computations on GPUs

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

scientific article

Number of Crossing-Free Geometric Graphs vs. Triangulations

journal article from 'Electronic Notes in Discrete Mathematics' published in 2008

ON THE TIME BOUND FOR CONVEX DECOMPOSITION OF SIMPLE POLYGONS

article by MARK KEIL & Jack Snoeyink published June 2002 in International Journal of Computational Geometry and Applications

Objects that cannot be taken apart with two hands

September 1994 article in Discrete and Computational Geometry

On arrangements of Jordan arcs with three intersections per pair

On exclusion regions for optimal triangulations

article by R.L. (Scot) Drysdale et al published April 2001 in Discrete Applied Mathematics

On the energy of bifurcated hydrogen bonds for protein structure prediction

On-the-Fly Rotamer Pair Energy Evaluation in Protein Design

scholarly article

Point location in zones of k-flats in arrangements

Polygonal path simplification with angle constraints

Probik: Protein Backbone Motion by Inverse Kinematics

Quadratic and cubic b-splines by generalizing higher-order voronoi diagrams

RNABC: forward kinematics to reduce all-atom steric clashes in RNA backbone

scientific article published on 31 March 2007

Reconstructing Polygons from Scanner Data

Reconstructing polygons from scanner data

Reducing the memory required to find a geodesic shortest path on a large mesh

Rotamer-Pair Energy Calculations Using a Trie Data Structure

article by Andrew Leaver-Fay et al published 2005 in Lecture Notes in Computer Science

Scientific benchmarks for guiding macromolecular energy function improvement

scientific article (publication date: 2013)

Spanning Trees Crossing Few Barriers

Spirale Reversi: Reverse decoding of the Edgebreaker encoding

Streaming computation of Delaunay triangulations

Streaming computation of Delaunay triangulations

Structure-based function inference using protein family-specific fingerprints.

scientific article

THE REFLEX-FREE HULL

Testing Homotopy for Paths in the Plane

The Safari interface for visualizing time-dependent volume data using iso-surfaces and contour spectra

scholarly article by Lutz Kettner et al published May 2003 in Computational Geometry

The Size of Spanning Disks for Polygonal Curves

article

The problem of managing a strategic reserve

Tight degree bounds for pseudo-triangulations of points

Time-varying Reeb graphs for continuous space–time data

Two-Dimensional and Three-Dimensional Point Location in Rectangular Subdivisions

Ununfoldable polyhedra with convex faces

VisTRE: A Visualization Tool to Evaluate Errors in Terrain Representation

scholarly article published June 2006