Jack Snoeyink

Martin Isenburg, Valerio Pascucci, Jack Snoeyink, 2004, Proceedings. 2nd International Symposium on 3D Data Processing, Visualization and Transmission, 2004. 3DPVT 2004..

Banana spiders: A study of connectivity in 3d combinatorial rigidity

Jack Snoeyink, Andrea Mantler, J. Snoeyink, 2004, CCCG.

Computing the Nearest Neighbor Transform Exactly with Only Double Precision

Timothy M. Chan, David L. Millman, Jack Snoeyink, 2012, 2012 Ninth International Symposium on Voronoi Diagrams in Science and Engineering.

Cartographic Line Simplification and Polygon CSG Formulae and in O(n log* n) Time

John Hershberger, Jack Snoeyink, J. Hershberger, 1997, WADS.

Path Seeds and Flexible Isosurfaces - Using Topology for Exploratory Visualization

Jack Snoeyink, Hamish A. Carr, J. Snoeyink, 2003, VisSym.

On the sectional area of convex polytopes

Prosenjit Bose, Godfried T. Toussaint, Thomas C. Shermer, 1996, SCG '96.

A lower bound for multicast key distribution

George Varghese, Subhash Suri, Jack Snoeyink, 2001, Proceedings IEEE INFOCOM 2001. Conference on Computer Communications. Twentieth Annual Joint Conference of the IEEE Computer and Communications Society (Cat. No.01CH37213).

Time, Space, and Precision: Revisiting Classic Problems in Computational Geometry with Degree-Driven Analysis, pp. 280

Jack Snoeyink, 2014, CCCG.

Linear-Time Reconstruction of Delaunay Triangulations with Applications

Marc J. van Kreveld, Jack Snoeyink, 1997, ESA.

Proceedings of the Eleventh Annual Symposium on Computational Geometry, Vancouver, B.C., Canada, June 5-12, 1995

Jack Snoeyink, 1995, Symposium on Computational Geometry.

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

Wei Wang, Jack Snoeyink, Jun Huan, 2009, J. Comput. Aided Mol. Des..

Tentative Prune- and- Search Fixed-Points with Applications to Geometric Computation

David G. Kirkpatrick, Jack Snoeyink, 1993 .

Removing Degeneracies by Perturbing the Problem or Perturbing the World

Pierre Alliez, Olivier Devillers, Jack Snoeyink, 2000, CCCG.

Bio-geometry: challenges, approaches, and future opportunities in proteomics and drug discovery

Karthik Ramani, Tao Ju, Ruth Nussinov, 2008, SPM '08.

On the Precision to Sort Line-Quadric Intersections

Jack Snoeyink, Michael Deakin, 2016, CCCG.

Capturing Crossings: Convex Hulls of Segment and Plane Intersections

Esther M. Arkin, Joseph S. B. Mitchell, Jack Snoeyink, 2007, CCCG.

Removing Degeneracies by Perturbing the Problem or the World

Pierre Alliez, Olivier Devillers, Jack Snoeyink, 1997 .

Easy triangle strips for TIN terrain models

Bettina Speckmann, Jack Snoeyink, J. Snoeyink, 2001, CCCG.

Binary compression rates for ASCII formats

Martin Isenburg, Jack Snoeyink, 2003, Web3D '03.

VisTRE: A Visualization Tool to Evaluate Errors in Terrain Representation

Jack Snoeyink, Christopher G. Healey, J. Snoeyink, 2006, Third International Symposium on 3D Data Processing, Visualization, and Transmission (3DPVT'06).

Comparing Graph Representations of Protein Structure for Mining Family-Specific Residue-Based Packing Motifs

Wei Wang, Jack Snoeyink, Jun Huan, 2005, J. Comput. Biol..

Computation of Non-dominated Points Using Compact Voronoi Diagrams

Otfried Cheong, Jack Snoeyink, Sandip Das, 2010, WALCOM.

Efficient algorithms for line and curve segment intersection using restricted predicates

Jean-Daniel Boissonnat, Jack Snoeyink, J. Boissonnat, 1999, SCG '99.

The problem of managing a strategic reserve

Jack Snoeyink, L. Haarsma, David Cole, 1985 .

Tentative prune-and-search for computing Voronoi vertices

David G. Kirkpatrick, Jack Snoeyink, J. Snoeyink, 1993, SCG '93.

Delaunay triangulation of imprecise points in linear time after preprocessing

Maarten Löffler, Jack Snoeyink, 2010, Comput. Geom..

Compression and streaming of polygon meshes

Martin Isenburg, Jack Snoeyink, 2004 .

Polygonal path approximation with angle constraints

John Hershberger, Ovidiu Daescu, Jack Snoeyink, 2001, SODA '01.

Sweeping arrangements of curves

John Hershberger, Jack Snoeyink, 1989, SCG '89.

On arrangements of Jordan arcs with three intersections per pair

Leonidas J. Guibas, Micha Sharir, Raimund Seidel, 2018, SCG '88.

IMAGE LOCALIZATION IN SATELLITE IMAGERY WITH FEATURE-BASED INDEXING

Marc Pollefeys, Friedrich Fraundorfer, Jack Snoeyink, 2008 .

Coding polygon meshes as compressable ASCII

Martin Isenburg, Jack Snoeyink, 2002, Web3D '02.

Efficiently Planning Compliant Motion in the Plane

John Hershberger, Jack Snoeyink, Joseph Friedman, 1996, SIAM J. Comput..

Maximum independent set for intervals by divide and conquer with pruning

Jack Snoeyink, 2007, Networks.

Capturing atomic interactions with a graphical framework in computational protein design

Jack Snoeyink, Andrew Leaver-Fay, J. Snoeyink, 2006 .

Compact interval trees: a data structure for convex hulls

Leonidas J. Guibas, John Hershberger, Jack Snoeyink, 1991, SODA '90.

Queries with segments in Voronoi diagrams

Sergey Bereg, Jack Snoeyink, 1999, SODA '99.

Ray shooting in polygons using geodesic triangulations

Leonidas J. Guibas, Bernard Chazelle, Micha Sharir, 1991, Algorithmica.

Implementing time-varying contour trees

Jack Snoeyink, Ajith Mascarenhas, 2005, Symposium on Computational Geometry.

Finding the Medial Axis of a Simple Polygon in Linear Time

Francis Y. L. Chin, Jack Snoeyink, Cao An Wang, 1995, ISAAC.

Simplifying flexible isosurfaces using local geometric measures

Jack Snoeyink, Michiel van de Panne, Hamish A. Carr, 2004, IEEE Visualization 2004.

Geometry in GIS is not combinatorial: segment intersection for polygon overlay

Jack Snoeyink, D. S. Andrews, 1995, SCG '95.

Objects that cannot be taken apart with two hands

Jack Snoeyink, J. Snoeyink, 1993, SCG '93.

Implicitly representing arrangements of lines or segments

Leonidas J. Guibas, Micha Sharir, Raimund Seidel, 1989, Discret. Comput. Geom..

Good orders for incremental (re)construction

Marc J. van Kreveld, Jack Snoeyink, 1997, SCG '97.

Testing Homotopy for Paths in the Plane

Jack Snoeyink, Sergio Cabello, Yuanxin Liu, 2004, Discret. Comput. Geom..

Computing Rigid Components of Pseudo-triangulation Mechanisms in Linear Time

Jack Snoeyink, Ileana Streinu, J. Snoeyink, 2005, CCCG.

Time-varying Reeb graphs for continuous space-time data

Valerio Pascucci, Herbert Edelsbrunner, Jack Snoeyink, 2008, Comput. Geom..

Primal Dividing and Dual Pruning: Output-Sensitive Construction of Four-Dimensional Polytopes and Three-Dimensional Voronoi Diagrams

Timothy M. Chan, Jack Snoeyink, Chee-Keng Yap, 1997, Discret. Comput. Geom..

Revised Papers from the Third International Workshop on Algorithm Engineering and Experimentation

Jack Snoeyink, Adam L. Buchsbaum, 2001 .

On the energy of bifurcated hydrogen bonds for protein structure prediction

Jack Snoeyink, Sajal Dash, 2011, 2011 IEEE International Conference on Bioinformatics and Biomedicine Workshops (BIBMW).

A compact piecewise-linear voronoi diagram for convex sites in the plane

David G. Kirkpatrick, Jack Snoeyink, Michael McAllister, 1996, Discret. Comput. Geom..

Processing Sequences: A new Paradigm for Out-of-Core Processing on Large Meshes

Martin Isenburg, Jack Snoeyink, Stefan Gumhold, 2003 .

The face fixer video

Martin Isenburg, Jack Snoeyink, 2000, SCG '00.

Flooding Triangulated Terrain

Jack Snoeyink, Yuanxin Liu, J. Snoeyink, 2004, SDH.

Efficient Algorithms for Maximum Regression Depth

Bettina Speckmann, Joseph S. B. Mitchell, Micha Sharir, 2008, Discret. Comput. Geom..

Proceedings of the Annual Symposium on Computational Geometry: Foreword

Jack Snoeyink, Nina Amenta, Offried Cheong, 2006 .

Mesh collapse compression

Martin Isenburg, Jack Snoeyink, 1999, SCG '99.

Generalizing Ham Sandwich Cuts to Equitable Subdivisions

Sergey Bereg, David G. Kirkpatrick, Jack Snoeyink, 2000, Discret. Comput. Geom..

Proceedings of the 6th international Frontiers in Algorithmics, and Proceedings of the 8th international conference on Algorithmic Aspects in Information and Management

Lusheng Wang, Kaile Su, Jack Snoeyink, 2012 .

Algorithmic issues in modeling motion

Leonidas J. Guibas, Dinesh Manocha, Christian S. Jensen, 2002, CSUR.

Decontaminating Planar Regions by Sweeping with Barrier Curves

Jack Snoeyink, Tzvetalin S. Vassilev, Minko Markov, 2014, CCCG.

On the bit complexity of minimum link paths: Superquadratic algorithms for problem solvable in linear time

Jack Snoeyink, Simon Kahan, Simon Kahan, 1999, Comput. Geom..

Computing planar Voronoi diagrams in double precision: a further example of degree-driven algorithm design

David L. Millman, Jack Snoeyink, 2010, SoCG '10.

Compressing the property mapping of polygon meshes

Martin Isenburg, Jack Snoeyink, J. Snoeyink, 2001, Proceedings Ninth Pacific Conference on Computer Graphics and Applications. Pacific Graphics 2001.

The Size of Spanning Disks for Polygonal Curves

Jack Snoeyink, Joel Hass, William P. Thurston, 2003, Discret. Comput. Geom..

Fitting spheres to electron density

Jack Snoeyink, Vishal Verma, 2011, SoCG '11.

Faraway Point: a Sentinel Point for Delaunay Computation

Jack Snoeyink, Yuanxin Liu, J. Snoeyink, 2008, Int. J. Comput. Geom. Appl..

How Long Can a Graph be Kept Planar?

Chinmay Jain, Jack Snoeyink, Tibor Szabó, 2008, Electron. J. Comb..

Encoding volumetric grids for streaming isosurface extraction

Valerio Pascucci, Jack Snoeyink, Ajith Mascarenhas, 2004 .

Cartographic line simplification and polygon CSG formulæ in O(nlog * n) time

John Hershberger, Jack Snoeyink, 1998, Comput. Geom..

Implementing Streaming Simplification for large Labeled Meshes

Jack Snoeyink, Shawn Brown, Catalin Constantin, 2010, ALENEX.

Spanning Trees Crossing Few Barriers

Leonidas J. Guibas, Mark de Berg, Otfried Cheong, 2003, Discret. Comput. Geom..

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

Leonidas J. Guibas, David P. Dobkin, John Hershberger, 1988, SIGGRAPH.

Fitting a Set of Points by a Circle

Jack Snoeyink, Pedro Ramos, Jesús García-López, 1998, Discret. Comput. Geom..

Computing Minimum Length Paths of a Given Homotopy Class

John Hershberger, Jack Snoeyink, J. Hershberger, 1994, Comput. Geom..

Ray Shooting in Polygons Using Geodesic Triangulations

Leonidas J. Guibas, Bernard Chazelle, Micha Sharir, 1991, ICALP.

Efficiently Approximating Polygonal Paths in Three and Higher Dimensions

Michael T. Goodrich, Ovidiu Daescu, Jack Snoeyink, 1998, SCG '98.

Input-Sensitive Compliant Motion in the Plane

John Hershberger, Jack Snoeyink, Joseph Friedman, 1990, SWAT.

Two-dimensional Computation of the Three-dimensional Reachable Region for a Welding Head

Jack Snoeyink, Michael McAllister, J. Snoeyink, 1993, CCCG.

Streaming compression of triangle meshes

Martin Isenburg, Peter Lindstrom, Jack Snoeyink, 2005, SIGGRAPH '05.

Face fixer: compressing polygon meshes with properties

Martin Isenburg, Jack Snoeyink, J. Snoeyink, 2000, SIGGRAPH.

Approximating Shortest Paths in Arrangements of Lines

David G. Kirkpatrick, Prosenjit Bose, Jack Snoeyink, 1996, CCCG.

On arrangements of Jordan arcs with three intersections per pair

Leonidas J. Guibas, Micha Sharir, Raimund Seidel, 1989, Discret. Comput. Geom..

Frontiers in algorithmics

Jack Snoeyink, Pinyan Lu, 2014, Theor. Comput. Sci..

Practical Point-in-Polygon Tests Using CSG Representations of Polygons

Robert J. Walker, Jack Snoeyink, R. J. Walker, 1999, ALENEX.

Intersecting Red and Blue Line Segments in Optimal Time and Precision

Jack Snoeyink, Andrea Mantler, 2000, JCDCG.

Stabbing Parallel Segments with a Convex Polygon (Extended Abstract)

Michael T. Goodrich, Jack Snoeyink, M. Goodrich, 1989, WADS.

On the time bound for convex decomposition of simple polygons

Jack Snoeyink, J. Mark Keil, 1998, CCCG.

Some Aperture-Angle Optimization Problems

Prosenjit Bose, Godfried T. Toussaint, Jack Snoeyink, 2002, Algorithmica.

A prototype system for visualizing time-dependent volume data

Jack Snoeyink, Lutz Kettner, 2001, SCG '01.

The dilation of the Delaunay triangulation is greater than π/2 pdf

Maarten Löffler, Prosenjit Bose, Luc Devroye, 2010, ArXiv.

Sphere-based Computation of Delaunay Diagrams on Points from 4d Grids

Jack Snoeyink, Yuanxin Liu, J. Snoeyink, 2006, 2006 3rd International Symposium on Voronoi Diagrams in Science and Engineering.

Testing Shortcuts to Maintain Simplicity in Subdivision Simplification

Jack Snoeyink, Diane L. Souvaine, Yuanxin Liu, 2005, CCCG.

Simplicial subdivisions and sampling artifacts

Jack Snoeyink, Torsten Möller, Hamish A. Carr, 2001, Proceedings Visualization, 2001. VIS '01..

Efficient ray shooting and hidden surface removal

Mark de Berg, Mark H. Overmars, Marc J. van Kreveld, 1991, SCG '91.

Coding with ASCII: compact, yet text-based 3D content

Martin Isenburg, Jack Snoeyink, 2002, Proceedings. First International Symposium on 3D Data Processing Visualization and Transmission.

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

Jack Snoeyink, Deepak Bandyopadhyay, 2007, Comput. Geom..

ALENEX 2001 Program Committee

Jack Snoeyink, Adam L. Buchsbaum, 2001 .

Computing the largest inscribed isothetic rectangle

David Hsu, Helmut Alt, Jack Snoeyink, 1995, CCCG.

Proceedings of the 20th ACM Symposium on Computational Geometry, Brooklyn, New York, USA, June 8-11, 2004

Jean-Daniel Boissonnat, Jack Snoeyink, 2004, Symposium on Computational Geometry.

Interlocked open and closed linkages with few joints

Erik D. Demaine, Stefan Langerman, Jack Snoeyink, 2003, Comput. Geom..

Lossless compression of predicted floating-point geometry

Martin Isenburg, Peter Lindstrom, Jack Snoeyink, 2005, Comput. Aided Des..

Generating Random x-Monotone Polygons with Given Vertices

Joseph S. B. Mitchell, Jack Snoeyink, Gopalakrishnan Sundaram, 1994, Canadian Conference on Computational Geometry.

Artifacts caused by simplicial subdivision

Jack Snoeyink, Torsten Möller, Hamish A. Carr, 2006, IEEE Transactions on Visualization and Computer Graphics.

Algorithm engineering and experimentation : Third International Workshop, ALENEX 2001, Washington, DC, USA, January 5-6, 2001 : revised papers

Jack Snoeyink, Adam L. Buchsbaum, 2001 .

On the bit complexity of minimum link paths: superquadratic algorithms for problems solvable in linear time

Jack Snoeyink, Simon Kahan, Simon Kahan, 1996, SCG '96.

Computing Constrained Shortest Segments: Butterfly Wingspans in Logarithmic Time

David G. Kirkpatrick, Jack Snoeyink, J. Snoeyink, 1999, Int. J. Comput. Geom. Appl..

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

Jack Snoeyink, Michiel van de Panne, Hamish A. Carr, 2010, Comput. Geom..

The Safari Interface for Visualizing Time-Dependent Volume Data Using Iso-Surfaces and a Control Plane

Jack Snoeyink, Lutz Kettner, Jaroslaw R. Rossignac, 2001 .

On computing edges that are in all minimum-weight triangulations

Jack Snoeyink, Michael McAllister, Patrice Belleville, 1996, SCG '96.

Compressing the Property Mapping of Polygon Meshes

Martin Isenburg, Jack Snoeyink, 2002, Graph. Model..

Terrain Representation using Right-Triangulated Irregular Networks

Jack Snoeyink, Suddha Basu, 2007, CCCG.

Counting and Enumerating Pointed Pseudo-triangulations with the Greedy Flip Algorithm

Jack Snoeyink, Hervé Brönnimann, Michel Pocchiola, 2006, ALENEX/ANALCO.

Using CSG representations of polygons for practical point-in-polygon tests

Robert J. Walker, Jack Snoeyink, 1997, SIGGRAPH '97.

Maximum Independent Set for Intervals by Divide-Prune-and-Conquer

Jack Snoeyink, 2005, CCCG.

Cross-ratios and angles determine a polygon

Jack Snoeyink, 1998, SCG '98.

The arithmetic precision of ray-polygon intersection testing

Jack Snoeyink, J. Snoeyink, 2001, CCCG.

Polygonal path simplification with angle constraints

John Hershberger, Ovidiu Daescu, Jack Snoeyink, 2005, Comput. Geom..

Proceedings of the twentieth annual symposium on Computational geometry

Jean-Daniel Boissonnat, Jack Snoeyink, 2004, SoCG 2004.

Maintaining solvent accessible surface area under rotamer substitution for protein design

Jack Snoeyink, Andrew Leaver-Fay, Brian Kuhlman, 2007, J. Comput. Chem..

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

Jack Snoeyink, Vishal Verma, 2009, GIS.

Heaphull?

Jack Snoeyink, Andrea Mantler, 2001, CCCG.

Representing Interpolant Topology for Contour Tree Computation

Jack Snoeyink, Hamish Carr, 2009, Topology-Based Methods in Visualization II.

Spanning Trees Crossing Few Barriers (Algorithm Engineering as a New Paradigm)

Leonidas J. Guibas, Mark de Berg, Otfried Cheong, 1999 .

Defining and computing accessibility radius

Jack Snoeyink, Vishal Verma, Vishal Verma, 2009, CCCG.

Stabbing Parallel Segments with a Convex Polygon

Michael T. Goodrich, Jack Snoeyink, 1990, Comput. Vis. Graph. Image Process..

Compact Voronoi Diagrams for Moving Convex Polygons

Leonidas J. Guibas, Jack Snoeyink, Li Zhang, 2000, SWAT.

Faster placement of hydrogens in protein structures by dynamic programming

Jack Snoeyink, Andrew Leaver-Fay, Yuanxin Liu, 2008, JEAL.

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

Maarten Löffler, Prosenjit Bose, Luc Devroye, 2011, Comput. Geom..

Defining and Computing Optimum RMSD for Gapped Multiple Structure Alignment

Jack Snoeyink, Xueyi Wang, 2007, WABI.

Mining protein family specific residue packing patterns from protein structure graphs

Wei Wang, Jack Snoeyink, Jun Huan, 2004, RECOMB.

The Complexity of Rivers in Triangulated Terrains

Prosenjit Bose, Mark de Berg, Marko de Groot, 1996, CCCG.

Degree-Driven Design for Correct Geometric Algorithms

Jack Snoeyink, 2011, FAW-AAIM.

A trivial knot whose spanning disks have exponential size

Jack Snoeyink, J. Snoeyink, 1990, SCG '90.

Reconstructing polygons from scanner data

Stephane Durocher, Jack Snoeyink, Therese C. Biedl, 2011, Theor. Comput. Sci..

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

Christopher J. Williams, Jack Snoeyink, Vishal Verma, 2018, Protein science : a publication of the Protein Society.

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

Jarek Rossignac, Jack Snoeyink, Lutz Kettner, 2003, Comput. Geom..

Approximating Polygons and Subdivisions with Minimum Link Paths

Leonidas J. Guibas, Joseph S. B. Mitchell, John Hershberger, 1991, Int. J. Comput. Geom. Appl..

Minimum-link C-oriented paths: Single-source queries

Mark H. Overmars, Jack Snoeyink, John Adegeest, 1994, Int. J. Comput. Geom. Appl..

Covering Folded Shapes pdf

Michael Hoffmann, Erik D. Demaine, Sándor P. Fekete, 2013, CCCG.

Computing Numerically-Optimal Bounding Boxes for Constructive Solid Geometry (CSG) Components in Monte Carlo Particle Transport Calculations

David L. Millman, Jack Snoeyink, David P. Griesheimer, 2014, ICS 2014.

Probik: Protein Backbone Motion by Inverse Kinematics

Jack Snoeyink, Kimberly Noonan, David O'Brien, 2005, WAFR.

Guest Editors' Foreword

Jean-Daniel Boissonnat, Jack Snoeyink, 2006, Discret. Comput. Geom..

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

Jack Snoeyink, Andrew Leaver-Fay, Brian Kuhlman, 2008, ISBRA.

Generating Random Polygons with Given Vertices

Joseph S. B. Mitchell, Jack Snoeyink, Gopalakrishnan Sundaram, 1996, Comput. Geom..

Streaming computation of Delaunay triangulations

Martin Isenburg, Jack Snoeyink, Jonathan Richard Shewchuk, 2006, ACM Trans. Graph..

Rotamer-Pair Energy Calculations Using a Trie Data Structure

Jack Snoeyink, Andrew Leaver-Fay, Brian Kuhlman, 2005, WABI.

Approximating the geometric minimum-diameter spanning tree

Sergey Bereg, Michael Segal, Jack Snoeyink, 2003, CCCG.

Centralized path planning for multiple robots: Optimal decoupling into sequential plans

Dinesh Manocha, Ming C. Lin, Jack Snoeyink, 2009, Robotics: Science and Systems.

Objects that cannot be taken apart with two hands

Jorge Stolfi, Jack Snoeyink, J. Snoeyink, 1993, SCG '93.

Number of Crossing-Free Geometric Graphs vs. Triangulations

Jack Snoeyink, Emo Welzl, Andreas Razen, 2008, Electron. Notes Discret. Math..

Two- and Three-Dimensional Point Location in Rectangular Subdivisions

Mark de Berg, Marc J. van Kreveld, Jack Snoeyink, 1995, J. Algorithms.

An optimal algorithm for the on-line closest-pair problem

Michiel H. M. Smid, Jack Snoeyink, Christian Schwarz, 2005, Algorithmica.

Efficient algorithms for maximum regression depth

Bettina Speckmann, Joseph S. B. Mitchell, Micha Sharir, 1999, SCG '99.

Bumpy Pyramid Folding

Erik D. Demaine, Ryuhei Uehara, Jack Snoeyink, 2014, CCCG.

Algorithm Engineering and Experimentation

Jack Snoeyink, Adam L. Buchsbaum, 2001, Lecture Notes in Computer Science.

Spanning trees crossing few barriers

Leonidas J. Guibas, Mark de Berg, Otfried Cheong, 1999, SCG '99.

Finding the Medial Axis of a Simple Polygon in Linear Time

Francis Y. L. Chin, Jack Snoeyink, Cao An Wang, 1995, ISAAC.

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

Jack Snoeyink, Andrew Leaver-Fay, Xueyi Wang, 2007, Nucleic Acids Res..

Implicitly representing arrangements of lines or segments

Leonidas J. Guibas, Micha Sharir, Raimund Seidel, 2011, SCG '88.

Mesh collapse compression

Martin Isenburg, Jack Snoeyink, 1999, XII Brazilian Symposium on Computer Graphics and Image Processing (Cat. No.PR00481).

Approximating Polygons and Subdivisions with Minimum Link Paths

Leonidas J. Guibas, Joseph S. B. Mitchell, John Hershberger, 1991, ISA.

Proceedings of the 26th ACM Symposium on Computational Geometry, Snowbird, Utah, USA, June 13-16, 2010

Joseph S. B. Mitchell, Mark de Berg, Jack Snoeyink, 2010, Symposium on Computational Geometry.

Efficiently approximating polygonal paths in three and higher dimensions

Michael T. Goodrich, Ovidiu Daescu, Jack Snoeyink, 1998, SCG '98.

Computation of spatial skyline points

Otfried Cheong, Jack Snoeyink, Arindam Karmakar, 2021, Comput. Geom..

Scientific benchmarks for guiding macromolecular energy function improvement.

Jack Snoeyink, Yifan Song, James Thompson, 2013, Methods in enzymology.

Computing Common Tangents Without a Separating Line

David G. Kirkpatrick, Jack Snoeyink, 1995, WADS.

Point Location in Zones of K-flats in Arrangements

Mark de Berg, Otfried Cheong, Marc J. van Kreveld, 1996, Comput. Geom..

A 2-chain can interlock with a k-chain

Stefan Langerman, Jack Snoeyink, Joseph O'Rourke, 2004, ArXiv.

Reconstructing Polygons from Scanner Data

Stephane Durocher, Jack Snoeyink, Therese C. Biedl, 2009, ISAAC.

Categories and Subject Descriptors: I.3.5 Computational Geometry and Object Modeling: Geometric algorithms, languages, and systems General Terms: Algorithms

Martin Isenburg, Jack Snoeyink, Jonathan Richard Shewchuk, 2022 .

Two- and Three-Dimensional Point Location in Rectangular Subdivisions (Extended Abstract)

Mark de Berg, Marc J. van Kreveld, Jack Snoeyink, 1992, SWAT.

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

Wei Wang, Jack Snoeyink, Jun Huan, 2009, J. Comput. Aided Mol. Des..

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

Sergey Bereg, Michael Segal, Jack Snoeyink, 2003, Algorithmica.

Implementations of the LMT heuristic for minimum weight triangulation

Jack Snoeyink, Ronald Beirouti, 1998, SCG '98.

On exclusion regions for optimal triangulations

Jack Snoeyink, Robert L. Scot Drysdale, Scott A. McElfresh, 2001, Discret. Appl. Math..

Defining and Computing Optimum RMSD for Gapped and Weighted Multiple-Structure Alignment

Jack Snoeyink, Xueyi Wang, Xueyi Wang, 2008, IEEE ACM Trans. Comput. Biol. Bioinform..

Kinetic Collision Detection for Simple Polygons

Bettina Speckmann, David G. Kirkpatrick, Jack Snoeyink, 2002, Int. J. Comput. Geom. Appl..

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

Jack Snoeyink, Wei Wang, Jinze Liu, 2010, IEEE Trans. Inf. Technol. Biomed..

Computing a face in an arrangement of line segments

Leonidas J. Guibas, Bernard Chazelle, Micha Sharir, 1991, SODA '91.

Counting and cutting cycles of lines and rods in space

Leonidas J. Guibas, Bernard Chazelle, Micha Sharir, 1990, Proceedings [1990] 31st Annual Symposium on Foundations of Computer Science.

The reflex-free hull

Otfried Cheong, Hee-Kap Ahn, Jack Snoeyink, 2001, CCCG.

Efficient algorithm for approximating maximum inscribed sphere in high dimensional polytope

Yulai Xie, Jack Snoeyink, Jinhui Xu, 2006, SCG '06.

Recognizing an Envelope of Lines in Linear Time

Jack Snoeyink, Eric Guévremont, 1992, ISAAC.

Maximum geodesic routing in the plane with obstacles

David L. Millman, Jack Snoeyink, Vishal Verma, 2010, CCCG.

Cross-Ratios and Angles Determine a Polygon

Jack Snoeyink, 1999, Discret. Comput. Geom..

Delaunay triangulations of imprecise pointsin linear time after preprocessing

Maarten Löffler, Jack Snoeyink, 2008, SCG '08.

Convex Polygons Made from Few Lines and Convex Decompositions of Polyhedra

John Hershberger, Jack Snoeyink, 1992, SWAT.

Almost-Delaunay simplices: nearest neighbor relations for imprecise points

Jack Snoeyink, Deepak Bandyopadhyay, J. Snoeyink, 2004, SODA '04.

Interlocked open linkages with few joints

Erik D. Demaine, Stefan Langerman, Jack Snoeyink, 2002, SCG '02.

Erased arrangements of lines and convex decompositions of polyhedra

John Hershberger, Jack Snoeyink, J. Hershberger, 1998, Computational geometry.

Kinetic collision detection for simple polygons

Bettina Speckmann, David G. Kirkpatrick, Jack Snoeyink, 2000, SCG '00.

Counting and cutting cycles of lines and rods in space

Leonidas J. Guibas, Bernard Chazelle, Micha Sharir, 1990, Proceedings [1990] 31st Annual Symposium on Foundations of Computer Science.

Frontiers in Algorithmics and Algorithmic Aspects in Information and Management - Joint International Conference, FAW-AAIM 2011, Jinhua, China, May 28-31, 2011. Proceedings

Lusheng Wang, Kaile Su, Jack Snoeyink, 2011, FAW-AAIM.

Counting triangulations and pseudo-triangulations of wheels

Günter Rote, Dana Randall, Jack Snoeyink, 2001, CCCG.

Mining RNA Tertiary Motifs with Structure Graphs

Wei Wang, Jack Snoeyink, Jun Huan, 2007, 19th International Conference on Scientific and Statistical Database Management (SSDBM 2007).

Ununfoldable polyhedra with convex faces

David Eppstein, Erik D. Demaine, Marshall W. Bern, 1999, Comput. Geom..

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

Wei Wang, Jack Snoeyink, Jinze Liu, 2008, 2008 IEEE International Conference on Bioinformatics and Biomedicine.

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

Jack Snoeyink, Xueyi Wang, David Richardson, 2007, Journal of mathematical biology.

Emerging Challenges in Computational Topology

Leonidas J. Guibas, David Eppstein, David P. Dobkin, 1999, ArXiv.

A Comparison of Five Implementations of 3D Delaunay Tessellation

Jack Snoeyink, Yuanxin Liu, J. Snoeyink, 2005 .

Folding rulers inside triangles

Marc J. van Kreveld, Jack Snoeyink, Sue Whitesides, 1993, CCCG.

Point Location

Jack Snoeyink, 2004, Handbook of Discrete and Computational Geometry, 2nd Ed..

Early-split coding of triangle mesh connectivity

Martin Isenburg, Jack Snoeyink, 2006, Graphics Interface.

Creating a robust implementation for segment intersection by refinement: A multistage assignment that defines away degeneracies

Jack Snoeyink, 2016, CCCG.

Computing the Implicit Voronoi Diagram in Triple Precision

David L. Millman, Jack Snoeyink, 2009, WADS.

An optimal algorithm for the on-line closest-pair problem

Michiel H. M. Smid, Jack Snoeyink, Christian Schwarz, 1992, SCG '92.

Journal of Graph Algorithms and Applications

Prosenjit Bose, Jack Snoeyink, Michael McAllister, 2022 .

Counting and Reporting Red/Blue Segment Intersections

Jack Snoeyink, Larry F. Palazzi, 1993, WADS.

An O(nlogn) implementation of the Douglas-Peucker algorithm for line simplification

John Hershberger, Jack Snoeyink, J. Hershberger, 1994, SCG '94.

Isocontour based Visualization of Time-varying Scalar Fields

Jack Snoeyink, Ajith Mascarenhas, 2009, Mathematical Foundations of Scientific Visualization, Computer Graphics, and Massive Data Exploration.

Objects that cannot be taken apart with two hands

Jorge Stolfi, Jack Snoeyink, 1994, Discret. Comput. Geom..

Spirale Reversi: Reverse Decoding of the Edgebreaker Encoding

Martin Isenburg, Jack Snoeyink, J. Snoeyink, 1999, CCCG.

Tentative Prune-and-Search for Computing Fixed-Points with Applications to Geometric Computation

David G. Kirkpatrick, Jack Snoeyink, J. Snoeyink, 1995, Fundam. Informaticae.

Generalizing Ham Sandwich Cuts to Equitable Subdivisions

Sergey Bereg, David G. Kirkpatrick, Jack Snoeyink, 1999, SCG '99.

The spanning ratio of the Delaunay triangulation is greater than pi/2

Maarten Löffler, Prosenjit Bose, Luc Devroye, 2009, CCCG.

Sweeping Arrangements of Curves

John Hershberger, Jack Snoeyink, 1990, Discrete and Computational Geometry.

Computing Minimum Length Paths of a Given Homotopy Class (Extended Abstract)

John Hershberger, Jack Snoeyink, 1991, WADS.

Testing Homotopy for Paths in the Plane

Jack Snoeyink, Sergio Cabello, Yuanxin Liu, 2002, SCG '02.

Computing contour trees in all dimensions

Jack Snoeyink, Hamish A. Carr, Ulrike Axen, 2000, SODA '00.

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

Jack Snoeyink, Yuanxin Liu, 2007, SCG '07.

Generating Raster DEM from Mass Points Via TIN Streaming

Martin Isenburg, Jack Snoeyink, Jonathan Richard Shewchuk, 2006, GIScience.

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

Leonidas J. Guibas, David P. Dobkin, John Hershberger, 1988, Algorithmica.

A compact piecewise-linear voronoi diagram for convex sites in the plane

David G. Kirkpatrick, Jack Snoeyink, Michael McAllister, 1993, Proceedings of 1993 IEEE 34th Annual Foundations of Computer Science.

Computational Cartography (Dagstuhl Seminar 9645)

Jack Snoeyink, Christopher M. Gold, Frank Wagner, 2021 .

MEDIAL AXIS GENERALISATION OF HYDROLOGY NETWORKS

Jack Snoeyink, J. Snoeyink, M. McAllister, 2008 .

Tripod � a minimalist data structure for embedded triangulations

Bettina Speckmann, Jack Snoeyink, J. Snoeyink, 2005 .

Contour Tree Simplification With Local Geometric Measures

Jack Snoeyink, Hamish Carr, Michiel van de Panne, 2004 .

Generalizing Ham Sandwich Cuts to Equitable Subdivisions

David G. Kirkpatrick, Jack Snoeyink, Sergei Bespamyatnikh, 2000 .

ROBUST VOLUME CALCULATIONS FOR CONSTRUCTIVE SOLID GEOMETRY (CSG) COMPONENTS IN MONTE CARLO TRANSPORT CALCULATIONS

David L. Millman, Jack Snoeyink, David P. Griesheimer, 2012 .

Graph Coding and Connectivity Compression

Martin Isenburg, Jack Snoeyink, 2005 .

Structure‐based function inference using protein family‐specific fingerprints

Jinze Liu, Jack Snoeyink, Jun Huan, 2006, Protein science : a publication of the Protein Society.

Probik: Protein Backbone Motion by Inverse Kinematics

Jack Snoeyink, J. Snoeyink, Kimberly Noonan, 2005 .

A geometric framework for robust nearest neighbor analysis of protein structure and function

Jack Snoeyink, Deepak Bandyopadhyay, 2006 .

Uniformly optimal digraphs for strongly connected reliability

Jack Snoeyink, Jason I. Brown, Xiaohu Li, 2007 .

On the Non-Redundancy of Split Offsets in Degree Coding

Martin Isenburg, Jack Snoeyink, 2004 .

Streaming Extraction of Elevation Contours from LIDAR Points

Martin Isenburg, Jack Snoeyink, Yuanxin Liu, 2006 .

Multiple structure alignment by optimal RMSD implies that the average structure is a consensus.

Jack Snoeyink, J. Snoeyink, Xueyi Wang, 2006, Computational systems bioinformatics. Computational Systems Bioinformatics Conference.

Counting and enumerating pseudo-triangulations with the greedy flip algorithm ∗

Jack Snoeyink, Hervé Brönnimann, Michel Pocchiola, 2005 .

Theory and practice of sampling and reconstruction for manifolds with boundaries

Jack Snoeyink, Gopi Meenakshisundaram, J. Snoeyink, 2001 .