Jack Snoeyink - RankMe

247 papers A* 13A 8B 14C 5Misc 2Journal 99Unranked 99

Year	Rank	Type	Title / Venue / Authors
2021	J	`jnl`	Computation of spatial skyline points. Comput. Geom. Binay Bhattacharya, Arijit Bishnu, Otfried Cheong, Sandip Das, Arindam Karmakar, Jack Snoeyink
2018	J	`jnl`	Bumpy pyramid folding. Comput. Geom. Zachary Abel, Erik D. Demaine, Martin L. Demaine, Hiro Ito, Jack Snoeyink, Ryuhei Uehara
2017	J	`jnl`	Visibility graphs, dismantlability, and the cops and robbers game. Comput. Geom. Anna Lubiw, Jack Snoeyink, Hamideh Vosoughpour
2016	—	`conf`	Creating a robust implementation for segment intersection by refinement: A multistage assignment that defines away degeneracies. CCCG Jack Snoeyink
2016	—	`conf`	On the Precision to Sort Line-Quadric Intersections. CCCG Michael Deakin, Jack Snoeyink
2016	J	`jnl`	On the Precision to Sort Line-Quadric Intersections. CoRR Michael Deakin, Jack Snoeyink
2016	J	`jnl`	Visibility Graphs, Dismantlability, and the Cops and Robbers Game. CoRR Anna Lubiw, Jack Snoeyink, Hamideh Vosoughpour
2014	—	`conf`	Bumpy Pyramid Folding. CCCG Zachary Abel, Erik D. Demaine, Martin L. Demaine, Hiro Ito, Jack Snoeyink, Ryuhei Uehara
2014	J	`jnl`	Covering Folded Shapes. CoRR Oswin Aichholzer, Greg Aloupis, Erik D. Demaine, Martin L. Demaine, Sándor P. Fekete, Michael Hoffmann, Anna Lubiw, Jack Snoeyink, Andrew Winslow
2014	J	`jnl`	Covering Folded Shapes. J. Comput. Geom. Oswin Aichholzer, Greg Aloupis, Erik D. Demaine, Martin L. Demaine, Sándor P. Fekete, Michael Hoffmann, Anna Lubiw, Jack Snoeyink, Andrew Winslow
2014	—	`conf`	Decontaminating Planar Regions by Sweeping with Barrier Curves. CCCG Borislav Karaivanov, Minko Markov, Jack Snoeyink, Tzvetalin S. Vassilev
2014	J	`jnl`	Frontiers in algorithmics. Theor. Comput. Sci. Pinyan Lu, Jack Snoeyink
2014	—	`conf`	Time, Space, and Precision: Revisiting Classic Problems in Computational Geometry with Degree-Driven Analysis, pp. 280. CCCG Jack Snoeyink
2014	—	`conf`	Visibility Graphs, Dismantlability, and the Cops and Robbers Game. CCCG Anna Lubiw, Jack Snoeyink, Hamideh Vosoughpour
2013	—	`conf`	Covering Folded Shapes. CCCG Oswin Aichholzer, Greg Aloupis, Erik D. Demaine, Martin L. Demaine, Sándor P. Fekete, Michael Hoffmann, Anna Lubiw, Jack Snoeyink, Andrew Winslow
2012	—	`conf`	Computing the Nearest Neighbor Transform Exactly with Only Double Precision. ISVD David L. Millman, Steven Love, Timothy M. Chan, Jack Snoeyink
2012	—	`ed.`	Frontiers in Algorithmics and Algorithmic Aspects in Information and Management - Joint International Conference, FAW-AAIM 2012, Beijing, China, May 14-16, 2012. Proceedings FAW-AAIM Jack Snoeyink, Pinyan Lu, Kaile Su, Lusheng Wang
2011	J	`jnl`	Almost all Delaunay triangulations have stretch factor greater than pi/2. Comput. Geom. Prosenjit Bose, Luc Devroye, Maarten Löffler, Jack Snoeyink, Vishal Verma
2011	—	`conf`	Degree-Driven Design for Correct Geometric Algorithms. FAW-AAIM Jack Snoeyink
2011	—	`conf`	Fitting spheres to electron density. SCG Jack Snoeyink, Vishal Verma
2011	—	`conf`	On the energy of bifurcated hydrogen bonds for protein structure prediction. BIBM Workshops Sajal Dash, Jack Snoeyink
2011	J	`jnl`	Reconstructing polygons from scanner data. Theor. Comput. Sci. Therese Biedl, Stephane Durocher, Jack Snoeyink
2010	B	`conf`	Computation of Non-dominated Points Using Compact Voronoi Diagrams. WALCOM Binay K. Bhattacharya, Arijit Bishnu, Otfried Cheong, Sandip Das, Arindam Karmakar, Jack Snoeyink
2010	—	`conf`	Computing planar Voronoi diagrams in double precision: a further example of degree-driven algorithm design. SCG David L. Millman, Jack Snoeyink
2010	J	`jnl`	Delaunay triangulation of imprecise points in linear time after preprocessing. Comput. Geom. Maarten Löffler, Jack Snoeyink
2010	J	`jnl`	Flexible isosurfaces: Simplifying and displaying scalar topology using the contour tree. Comput. Geom. Hamish A. Carr, Jack Snoeyink, Michiel van de Panne
2010	J	`jnl`	Functional neighbors: inferring relationships between nonhomologous protein families using family-specific packing motifs. IEEE Trans. Inf. Technol. Biomed. Deepak Bandyopadhyay, Jun Huan, Jinze Liu, Jan F. Prins, Jack Snoeyink, Wei Wang, Alexander Tropsha
2010	A	`conf`	Implementing Streaming Simplification for large Labeled Meshes. ALENEX Catalin Constantin, Shawn Brown, Jack Snoeyink
2010	—	`conf`	Maximum geodesic routing in the plane with obstacles. CCCG David L. Millman, Matthew O'Meara, Jack Snoeyink, Vishal Verma
2010	J	`jnl`	The dilation of the Delaunay triangulation is greater than π/2 CoRR Prosenjit Bose, Luc Devroye, Maarten Löffler, Jack Snoeyink, Vishal Verma
2009	—	`conf`	Centralized path planning for multiple robots: Optimal decoupling into sequential plans. Robotics: Science and Systems Jur van den Berg, Jack Snoeyink, Ming C. Lin, Dinesh Manocha
2009	B	`conf`	Computing the Implicit Voronoi Diagram in Triple Precision. WADS David L. Millman, Jack Snoeyink
2009	—	`conf`	Defining and computing accessibility radius. CCCG Vishal Verma, Jack Snoeyink
2009	J	`jnl`	Identification of family-specific residue packing motifs and their use for structure-based protein function prediction: I. Method development. J. Comput. Aided Mol. Des. Deepak Bandyopadhyay, Jun Huan, Jan F. Prins, Jack Snoeyink, Wei Wang, Alexander Tropsha
2009	J	`jnl`	Identification of family-specific residue packing motifs and their use for structure-based protein function prediction: II. Case studies and applications. J. Comput. Aided Mol. Des. Deepak Bandyopadhyay, Jun Huan, Jan F. Prins, Jack Snoeyink, Wei Wang, Alexander Tropsha
2009	—	`ch.`	Isocontour based Visualization of Time-varying Scalar Fields. Mathematical Foundations of Scientific Visualization, Computer Graphics, and Massive Data Exploration Ajith Mascarenhas, Jack Snoeyink
2009	J	`jnl`	On Finding Non-dominated Points using Compact Voronoi Diagrams CoRR Binay K. Bhattacharya, Arijit Bishnu, Otfried Cheong, Sandip Das, Arindam Karmakar, Jack Snoeyink
2009	B	`conf`	Reconstructing Polygons from Scanner Data. ISAAC Therese Biedl, Stephane Durocher, Jack Snoeyink
2009	—	`conf`	Reducing the memory required to find a geodesic shortest path on a large mesh. GIS Vishal Verma, Jack Snoeyink
2009	—	`ch.`	Representing Interpolant Topology for Contour Tree Computation. Topology-Based Methods in Visualization II Hamish A. Carr, Jack Snoeyink
2009	—	`conf`	The spanning ratio of the Delaunay triangulation is greater than pi/2. CCCG Prosenjit Bose, Luc Devroye, Maarten Löffler, Jack Snoeyink, Vishal Verma
2008	—	`conf`	Bio-geometry: challenges, approaches, and future opportunities in proteomics and drug discovery. Symposium on Solid and Physical Modeling Ruth Nussinov, Tao Ju, Talapady Bhat, Jack Snoeyink, Karthik Ramani
2008	J	`jnl`	Capturing crossings: Convex hulls of segment and plane intersections. Inf. Process. Lett. Esther M. Arkin, Joseph S. B. Mitchell, Jack Snoeyink
2008	J	`jnl`	Defining and Computing Optimum RMSD for Gapped and Weighted Multiple-Structure Alignment. IEEE ACM Trans. Comput. Biol. Bioinform. Xueyi Wang, Jack Snoeyink
2008	—	`conf`	Delaunay triangulations of imprecise pointsin linear time after preprocessing. SCG Maarten Löffler, Jack Snoeyink
2008	J	`jnl`	Delineating Boundaries for Imprecise Regions. Algorithmica Iris Reinbacher, Marc Benkert, Marc J. van Kreveld, Joseph S. B. Mitchell, Jack Snoeyink, Alexander Wolff
2008	J	`jnl`	Efficient Algorithms for Maximum Regression Depth. Discret. Comput. Geom. Marc J. van Kreveld, Joseph S. B. Mitchell, Peter J. Rousseeuw, Micha Sharir, Jack Snoeyink, Bettina Speckmann
2008	J	`jnl`	Faraway Point: a Sentinel Point for Delaunay Computation. Int. J. Comput. Geom. Appl. Yuanxin Liu, Jack Snoeyink
2008	—	`conf`	Functional Neighbors: Inferring Relationships between Non-Homologous Protein Families Using Family-Specific Packing Motifs. BIBM Deepak Bandyopadhyay, Jun Huan, Jinze Liu, Jan F. Prins, Jack Snoeyink, Wei Wang, Alexander Tropsha
2008	J	`jnl`	How Long Can a Graph be Kept Planar? Electron. J. Comb. V. Anuradha, Chinmay Jain, Jack Snoeyink, Tibor Szabó
2008	J	`jnl`	Number of Crossing-Free Geometric Graphs vs. Triangulations. Electron. Notes Discret. Math. Andreas Razen, Jack Snoeyink, Emo Welzl
2008	—	`conf`	On-the-Fly Rotamer Pair Energy Evaluation in Protein Design. ISBRA Andrew Leaver-Fay, Jack Snoeyink, Brian Kuhlman
2008	J	`jnl`	Time-varying Reeb graphs for continuous space-time data. Comput. Geom. Herbert Edelsbrunner, John Harer, Ajith Mascarenhas, Valerio Pascucci, Jack Snoeyink
2007	J	`jnl`	Almost-Delaunay simplices: Robust neighbor relations for imprecise 3D points using CGAL. Comput. Geom. Deepak Bandyopadhyay, Jack Snoeyink
2007	—	`conf`	Capturing Crossings: Convex Hulls of Segment and Plane Intersections. CCCG Esther M. Arkin, Joseph S. B. Mitchell, Jack Snoeyink
2007	C	`conf`	Defining and Computing Optimum RMSD for Gapped Multiple Structure Alignment. WABI Xueyi Wang, Jack Snoeyink
2007	J	`jnl`	Faster placement of hydrogens in protein structures by dynamic programming. ACM J. Exp. Algorithmics Andrew Leaver-Fay, Yuanxin Liu, Jack Snoeyink, Xueyi Wang
2007	J	`jnl`	Maintaining solvent accessible surface area under rotamer substitution for protein design. J. Comput. Chem. Andrew Leaver-Fay, Glenn L. Butterfoss, Jack Snoeyink, Brian Kuhlman
2007	J	`jnl`	Maximum independent set for intervals by divide and conquer with pruning. Networks Jack Snoeyink
2007	B	`conf`	Mining RNA Tertiary Motifs with Structure Graphs. SSDBM Xueyi Wang, Jun Huan, Jack Snoeyink, Wei Wang
2007	J	`jnl`	MolProbity: all-atom contacts and structure validation for proteins and nucleic acids. Nucleic Acids Res. Ian W. Davis, Andrew Leaver-Fay, Vincent B. Chen, Jeremy N. Block, Gary J. Kapral, Xueyi Wang, Laura Weston Murray, W. Bryan Arendall III, Jack Snoeyink, Jane S. Richardson, David C. Richardson
2007	—	`conf`	Quadratic and cubic b-splines by generalizing higher-order voronoi diagrams. SCG Yuanxin Liu, Jack Snoeyink
2007	—	`conf`	Terrain Representation using Right-Triangulated Irregular Networks. CCCG Suddha Basu, Jack Snoeyink
2006	J	`jnl`	Artifacts Caused by Simplicial Subdivision. IEEE Trans. Vis. Comput. Graph. Hamish A. Carr, Torsten Möller, Jack Snoeyink
2006	J	`jnl`	Counting and Enumerating Pointed Pseudotriangulations with the Greedy Flip Algorithm. SIAM J. Comput. Hervé Brönnimann, Lutz Kettner, Michel Pocchiola, Jack Snoeyink
2006	B	`conf`	Early-split coding of triangle mesh connectivity. Graphics Interface Martin Isenburg, Jack Snoeyink
2006	J	`jnl`	Editorial. Comput. Geom. Jean-Daniel Boissonnat, Jack Snoeyink
2006	—	`conf`	Efficient algorithm for approximating maximum inscribed sphere in high dimensional polytope. SCG Yulai Xie, Jack Snoeyink, Jinhui Xu
2006	—	`conf`	Generating Raster DEM from Mass Points Via TIN Streaming. GIScience Martin Isenburg, Yuanxin Liu, Jonathan Richard Shewchuk, Jack Snoeyink, Tim Thirion
2006	J	`jnl`	Guest Editors' Foreword. Discret. Comput. Geom. Jean-Daniel Boissonnat, Jack Snoeyink
2006	—	`conf`	Illustrating the streaming construction of 2D delaunay triangulations. SCG Martin Isenburg, Yuanxin Liu, Jonathan Richard Shewchuk, Jack Snoeyink
2006	—	`conf`	Sphere-based Computation of Delaunay Diagrams on Points from 4d Grids. ISVD Yuanxin Liu, Jack Snoeyink
2006	J	`jnl`	Streaming computation of Delaunay triangulations. ACM Trans. Graph. Martin Isenburg, Yuanxin Liu, Jonathan Richard Shewchuk, Jack Snoeyink
2006	—	`conf`	VisTRE: A Visualization Tool to Evaluate Errors in Terrain Representation. 3DPVT Christopher G. Healey, Jack Snoeyink
2005	J	`jnl`	A lower bound for multicast key distribution. Comput. Networks Jack Snoeyink, Subhash Suri, George Varghese
2005	Misc	`conf`	An Adaptive Dynamic Programming Algorithm for the Side Chain Placement Problem. Pacific Symposium on Biocomputing Andrew Leaver-Fay, Brian Kuhlman, Jack Snoeyink
2005	J	`jnl`	Comparing Graph Representations of Protein Structure for Mining Family-Specific Residue-Based Packing Motifs. J. Comput. Biol. Jun Huan, Deepak Bandyopadhyay, Wei Wang, Jack Snoeyink, Jan F. Prins, Alexander Tropsha
2005	—	`conf`	Computing Rigid Components of Pseudo-triangulation Mechanisms in Linear Time. CCCG Jack Snoeyink, Ileana Streinu
2005	—	`conf`	Counting and Enumerating Pointed Pseudo-triangulations with the Greedy Flip Algorithm. ALENEX/ANALCO Hervé Brönnimann, Lutz Kettner, Michel Pocchiola, Jack Snoeyink
2005	J	`jnl`	Editorial. Comput. Geom. Jack Snoeyink
2005	—	`conf`	Implementing time-varying contour trees. SCG Ajith Mascarenhas, Jack Snoeyink
2005	J	`jnl`	Lossless compression of predicted floating-point geometry. Comput. Aided Des. Martin Isenburg, Peter Lindstrom, Jack Snoeyink
2005	—	`conf`	Maximum Independent Set for Intervals by Divide-Prune-and-Conquer. CCCG Jack Snoeyink
2005	J	`jnl`	Polygonal path simplification with angle constraints. Comput. Geom. Danny Z. Chen, Ovidiu Daescu, John Hershberger, Peter M. Kogge, Ningfang Mi, Jack Snoeyink
2005	J	`jnl`	Probik: Protein Backbone Motion by Inverse Kinematics. Int. J. Robotics Res. Kimberly Noonan, David O'Brien, Jack Snoeyink
2005	C	`conf`	Rotamer-Pair Energy Calculations Using a Trie Data Structure. WABI Andrew Leaver-Fay, Brian Kuhlman, Jack Snoeyink
2005	B	`conf`	Streaming Compression of Triangle Meshes. Symposium on Geometry Processing Martin Isenburg, Peter Lindstrom, Jack Snoeyink
2005	—	`conf`	Streaming compression of triangle meshes. SIGGRAPH Sketches Martin Isenburg, Peter Lindstrom, Jack Snoeyink
2005	—	`conf`	Testing Shortcuts to Maintain Simplicity in Subdivision Simplification. CCCG Craig Falls, Yuanxin Liu, Jack Snoeyink, Diane L. Souvaine
2004	J	`jnl`	A 2-chain can interlock with a k-chain CoRR Julie Glass, Stefan Langerman, Joseph O'Rourke, Jack Snoeyink, Jianyuan K. Zhong
2004	A*	`conf`	Almost-Delaunay simplices: nearest neighbor relations for imprecise points. SODA Deepak Bandyopadhyay, Jack Snoeyink
2004	—	`conf`	Banana spiders: A study of connectivity in 3d combinatorial rigidity. CCCG Andrea Mantler, Jack Snoeyink
2004	J	`jnl`	Computing a (1+epsilon)-Approximate Geometric Minimum-Diameter Spanning Tree. Algorithmica Michael J. Spriggs, J. Mark Keil, Sergei Bespamyatnikh, Michael Segal, Jack Snoeyink
2004	—	`conf`	Encoding Volumetric Grids For Streaming Isosurface Extraction. 3DPVT Ajith Mascarenhas, Martin Isenburg, Valerio Pascucci, Jack Snoeyink
2004	—	`conf`	Faster Placement of Hydrogens in Protein Structures by Dynamic Programming. ALENEX/ANALC Andrew Leaver-Fay, Yuanxin Liu, Jack Snoeyink
2004	C	`conf`	Flooding Triangulated Terrain. SDH Yuanxin Liu, Jack Snoeyink
2004	B	`conf`	Mining protein family specific residue packing patterns from protein structure graphs. RECOMB Jun Huan, Wei Wang, Deepak Bandyopadhyay, Jack Snoeyink, Jan F. Prins, Alexander Tropsha
2004	—	`ch.`	Point Location. Handbook of Discrete and Computational Geometry, 2nd Ed. Jack Snoeyink
2004	C	`conf`	Probik: Protein Backbone Motion by Inverse Kinematics. WAFR Kimberly Noonan, David O'Brien, Jack Snoeyink
2004	—	`ed.`	Proceedings of the 20th ACM Symposium on Computational Geometry, Brooklyn, New York, USA, June 8-11, 2004 SCG Jack Snoeyink, Jean-Daniel Boissonnat
2004	A	`conf`	Simplifying Flexible Isosurfaces Using Local Geometric Measures. IEEE Visualization Hamish A. Carr, Jack Snoeyink, Michiel van de Panne
2004	J	`jnl`	Testing Homotopy for Paths in the Plane. Discret. Comput. Geom. Sergio Cabello, Yuanxin Liu, Andrea Mantler, Jack Snoeyink
2004	J	`jnl`	The reflex-free hull. Int. J. Comput. Geom. Appl. Hee-Kap Ahn, Siu-Wing Cheng, Otfried Cheong, Jack Snoeyink
2003	—	`conf`	Approximating the geometric minimum-diameter spanning tree. CCCG Michael J. Spriggs, J. Mark Keil, Sergei Bespamyatnikh, Michael Segal, Jack Snoeyink
2003	—	`conf`	Binary compression rates for ASCII formats. Web3D Martin Isenburg, Jack Snoeyink
2003	C	`conf`	Compressing Texture Coordinates with Selective Linear Predictions. Computer Graphics International Martin Isenburg, Jack Snoeyink
2003	J	`jnl`	Computing contour trees in all dimensions. Comput. Geom. Hamish A. Carr, Jack Snoeyink, Ulrike Axen
2003	J	`jnl`	Interlocked open and closed linkages with few joints. Comput. Geom. Erik D. Demaine, Stefan Langerman, Joseph O'Rourke, Jack Snoeyink
2003	A	`conf`	Large Mesh Simplification using Processing Sequences. IEEE Visualization Martin Isenburg, Peter Lindstrom, Stefan Gumhold, Jack Snoeyink
2003	—	`conf`	Path Seeds and Flexible Isosurfaces - Using Topology for Exploratory Visualization. VisSym Hamish A. Carr, Jack Snoeyink
2003	J	`jnl`	Spanning Trees Crossing Few Barriers. Discret. Comput. Geom. Tetsuo Asano, Mark de Berg, Otfried Cheong, Leonidas J. Guibas, Jack Snoeyink, Hisao Tamaki
2003	J	`jnl`	The Safari interface for visualizing time-dependent volume data using iso-surfaces and contour spectra. Comput. Geom. Lutz Kettner, Jarek Rossignac, Jack Snoeyink
2003	J	`jnl`	The Size of Spanning Disks for Polygonal Curves. Discret. Comput. Geom. Joel Hass, Jack Snoeyink, William P. Thurston
2003	J	`jnl`	Tight degree bounds for pseudo-triangulations of points. Comput. Geom. Lutz Kettner, David G. Kirkpatrick, Andrea Mantler, Jack Snoeyink, Bettina Speckmann, Fumihiko Takeuchi
2003	J	`jnl`	Ununfoldable polyhedra with convex faces. Comput. Geom. Marshall W. Bern, Erik D. Demaine, David Eppstein, Eric Kuo, Andrea Mantler, Jack Snoeyink
2002	J	`jnl`	Algorithmic issues in modeling motion. ACM Comput. Surv. Pankaj K. Agarwal, Leonidas J. Guibas, Herbert Edelsbrunner, Jeff Erickson, Michael Isard, Sariel Har-Peled, John Hershberger, Christian S. Jensen, Lydia E. Kavraki, Patrice Koehl, Ming C. Lin, Dinesh Manocha, Dimitris N. Metaxas, Brian Mirtich, David M. Mount, S. Muthukrishnan, Dinesh K. Pai, Elisha Sacks, Jack Snoeyink, Subhash Suri, Ouri Wolfson
2002	—	`conf`	Coding polygon meshes as compressable ASCII. Web3D Martin Isenburg, Jack Snoeyink
2002	—	`conf`	Coding with ASCII: compact, yet text-based 3D content. 3DPVT Martin Isenburg, Jack Snoeyink
2002	J	`jnl`	Compressing the Property Mapping of Polygon Meshes. Graph. Model. Martin Isenburg, Jack Snoeyink
2002	J	`jnl`	Efficiently Approximating Polygonal Paths in Three and Higher Dimensions. Algorithmica Gill Barequet, Danny Z. Chen, Ovidiu Daescu, Michael T. Goodrich, Jack Snoeyink
2002	—	`conf`	Interlocked open linkages with few joints. SCG Erik D. Demaine, Stefan Langerman, Joseph O'Rourke, Jack Snoeyink
2002	J	`jnl`	Kinetic Collision Detection for Simple Polygons. Int. J. Comput. Geom. Appl. David G. Kirkpatrick, Jack Snoeyink, Bettina Speckmann
2002	J	`jnl`	On the Time Bound for Convex Decomposition of Simple Polygons. Int. J. Comput. Geom. Appl. J. Mark Keil, Jack Snoeyink
2002	J	`jnl`	Some Aperture-Angle Optimization Problems. Algorithmica Prosenjit Bose, Ferran Hurtado, Elsa Omaña-Pulido, Jack Snoeyink, Godfried T. Toussaint
2002	—	`conf`	Testing Homotopy for paths in the plane. SCG Sergio Cabello, Yuanxin Liu, Andrea Mantler, Jack Snoeyink
2001	A*	`conf`	A Lower Bound for Multicast Key Distribution. INFOCOM Jack Snoeyink, Subhash Suri, George Varghese
2001	J	`jnl`	A One-Step Crust and Skeleton Extraction Algorithm. Algorithmica Christopher M. Gold, Jack Snoeyink
2001	—	`conf`	A prototype system for visualizing time-dependent volume data. SCG Lutz Kettner, Jack Snoeyink
2001	A	`ed.`	Algorithm Engineering and Experimentation, Third International Workshop, ALENEX 2001, Washington, DC, USA, January 5-6, 2001, Revised Papers ALENEX Adam L. Buchsbaum, Jack Snoeyink
2001	Misc	`conf`	Compressing the Property Mapping of Polygon Meshes. PG Martin Isenburg, Jack Snoeyink
2001	—	`conf`	Counting triangulations and pseudo-triangulations of wheels. CCCG Dana Randall, Günter Rote, Francisco Santos, Jack Snoeyink
2001	J	`jnl`	Easy triangle strips for TIN terrain models. Int. J. Geogr. Inf. Sci. Bettina Speckmann, Jack Snoeyink
2001	—	`conf`	Heaphull?. CCCG Andrea Mantler, Jack Snoeyink
2001	J	`jnl`	On exclusion regions for optimal triangulations. Discret. Appl. Math. Robert L. (Scot) Drysdale III, Scott A. McElfresh, Jack Snoeyink
2001	A*	`conf`	Polygonal path approximation with angle constraints. SODA Danny Z. Chen, Ovidiu Daescu, John Hershberger, Peter M. Kogge, Jack Snoeyink
2001	A	`conf`	Simplicial Subdivisions and Sampling Artifacts. IEEE Visualization Hamish A. Carr, Torsten Möller, Jack Snoeyink
2001	J	`jnl`	Spirale Reversi: Reverse decoding of the Edgebreaker encoding. Comput. Geom. Martin Isenburg, Jack Snoeyink
2001	—	`conf`	The arithmetic precision of ray-polygon intersection testing. CCCG Jack Snoeyink
2001	—	`conf`	The reflex-free hull. CCCG Hee-Kap Ahn, Siu-Wing Cheng, Otfried Cheong, Jack Snoeyink
2000	—	`conf`	Compact Voronoi Diagrams for Moving Convex Polygons. SWAT Leonidas J. Guibas, Jack Snoeyink, Li Zhang
2000	A*	`conf`	Computing contour trees in all dimensions. SODA Hamish A. Carr, Jack Snoeyink, Ulrike Axen
2000	J	`jnl`	Efficient algorithms for line and curve segment intersection using restricted predicates. Comput. Geom. Jean-Daniel Boissonnat, Jack Snoeyink
2000	A*	`conf`	Face fixer: compressing polygon meshes with properties. SIGGRAPH Martin Isenburg, Jack Snoeyink
2000	J	`jnl`	Generalizing Ham Sandwich Cuts to Equitable Subdivisions. Discret. Comput. Geom. Sergei Bespamyatnikh, David G. Kirkpatrick, Jack Snoeyink
2000	—	`conf`	Intersecting Red and Blue Line Segments in Optimal Time and Precision. JCDCG Andrea Mantler, Jack Snoeyink
2000	—	`conf`	Kinetic collision detection for simple polygons. SCG David G. Kirkpatrick, Jack Snoeyink, Bettina Speckmann
2000	J	`jnl`	Queries with segments in Voronoi diagrams. Comput. Geom. Sergei Bespamyatnikh, Jack Snoeyink
2000	J	`jnl`	Removing Degeneracies by Perturbing the Problem or Perturbing the World. Reliab. Comput. Pierre Alliez, Olivier Devillers, Jack Snoeyink
2000	—	`conf`	Spirale Reversi: Reverse Decoding of the Edgebreaker Encoding. CCCG Martin Isenburg, Jack Snoeyink
2000	—	`conf`	The face fixer video. SCG Martin Isenburg, Jack Snoeyink
1999	J	`jnl`	Computing Constrained Shortest Segments: Butterfly Wingspans in Logarithmic Time. Int. J. Comput. Geom. Appl. David G. Kirkpatrick, Jack Snoeyink
1999	J	`jnl`	Cross-Ratios and Angles Determine a Polygon. Discret. Comput. Geom. Jack Snoeyink
1999	—	`conf`	Efficient Algorithms for Line and Curve Segment Intersection Using Restricted Predicates. SCG Jean-Daniel Boissonnat, Jack Snoeyink
1999	—	`conf`	Efficient Algorithms for Maximum Regression Depth. SCG Marc J. van Kreveld, Joseph S. B. Mitchell, Peter J. Rousseeuw, Micha Sharir, Jack Snoeyink, Bettina Speckmann
1999	J	`jnl`	Emerging Challenges in Computational Topology CoRR Marshall W. Bern, David Eppstein, Pankaj K. Agarwal, Nina Amenta, L. Paul Chew, Tamal K. Dey, David P. Dobkin, Herbert Edelsbrunner, Cindy Grimm, Leonidas J. Guibas, John Harer, Joel Hass, Andrew Hicks, Carroll K. Johnson, Gilad Lerman, David Letscher, Paul E. Plassmann, Eric Sedgwick, Jack Snoeyink, Jeff Weeks, Chee-Keng Yap, Denis Zorin
1999	J	`jnl`	Finding the Medial Axis of a Simple Polygon in Linear Time. Discret. Comput. Geom. Francis Y. L. Chin, Jack Snoeyink, Cao An Wang
1999	—	`conf`	Generalizing Ham Sandwich Cuts to Equitable Subdivisions. SCG Sergei Bespamyatnikh, David G. Kirkpatrick, Jack Snoeyink
1999	—	`conf`	Mesh Collapse Compression. SCG Martin Isenburg, Jack Snoeyink
1999	—	`conf`	Mesh Collapse Compression. SIBGRAPI Martin Isenburg, Jack Snoeyink
1999	J	`jnl`	On the bit complexity of minimum link paths: Superquadratic algorithms for problem solvable in linear time. Comput. Geom. Simon Kahan, Jack Snoeyink
1999	A	`conf`	Practical Point-in-Polygon Tests Using CSG Representations of Polygons. ALENEX Robert J. Walker, Jack Snoeyink
1999	A*	`conf`	Queries with Segments in Voronoi Diagrams. SODA Sergei Bespamyatnikh, Jack Snoeyink
1999	—	`conf`	Spanning Trees Crossing Few Barriers. SCG Tetsuo Asano, Mark de Berg, Otfried Cheong, Leonidas J. Guibas, Jack Snoeyink, Hisao Tamaki
1999	J	`jnl`	Ununfoldable Polyhedra with Convex Faces CoRR Marshall W. Bern, Erik D. Demaine, David Eppstein, Eric Kuo, Andrea Mantler, Jack Snoeyink
1998	J	`jnl`	Cartographic line simplification and polygon CSG formulæ in O(nlog * n) time. Comput. Geom. John Hershberger, Jack Snoeyink
1998	—	`conf`	Cross-Ratios and Angles Determine a Polygon. SCG Jack Snoeyink
1998	—	`conf`	Efficiently Approximating Polygonal Paths in Three and Higher Dimensions. SCG Gill Barequet, Michael T. Goodrich, Danny Z. Chen, Ovidiu Daescu, Jack Snoeyink
1998	J	`jnl`	Erased arrangements of lines and convex decompositions of polyhedra. Comput. Geom. John Hershberger, Jack Snoeyink
1998	J	`jnl`	Fitting a Set of Points by a Circle. Discret. Comput. Geom. Jesus Garcia-Lopez, Pedro A. Ramos, Jack Snoeyink
1998	—	`conf`	Implementations of the LMT Heuristic for Minimum Weight Triangulation. SCG Ronald Beirouti, Jack Snoeyink
1998	—	`conf`	On the time bound for convex decomposition of simple polygons. CCCG J. Mark Keil, Jack Snoeyink
1998	—	`conf`	Removing degeneracies by perturbing the problem or perturbing the world. CCCG Pierre Alliez, Olivier Devillers, Jack Snoeyink
1997	B	`conf`	Cartographic Line Simplification and Polygon CSG Formulae and in O(n log* n) Time. WADS John Hershberger, Jack Snoeyink
1997	—	`conf`	Easy triangle strips for tin terrain models. CCCG Bettina Speckmann, Jack Snoeyink
1997	—	`conf`	Good Orders for Incremental (Re)construction. SCG Jack Snoeyink, Marc J. van Kreveld
1997	A	`conf`	Linear-Time Reconstruction of Delaunay Triangulations with Applications. ESA Jack Snoeyink, Marc J. van Kreveld
1997	J	`jnl`	Optimal Algorithms to Embed Trees in a Point Set. J. Graph Algorithms Appl. Prosenjit Bose, Michael McAllister, Jack Snoeyink
1997	J	`jnl`	Primal Dividing and Dual Pruning: Output-Sensitive Construction of Four-Dimensional Polytopes and Three-Dimensional Voronoi Diagrams. Discret. Comput. Geom. Timothy M. Chan, Jack Snoeyink, Chee-Keng Yap
1997	—	`conf`	Using CSG representations of polygons for practical point-in-polygon tests. SIGGRAPH Visual Proceedings Robert J. Walker, Jack Snoeyink
1996	J	`jnl`	A Compact Piecewise-Linear Voronoi Diagram for Convex Sites in the Plane. Discret. Comput. Geom. Michael McAllister, David G. Kirkpatrick, Jack Snoeyink
1996	—	`conf`	Approximating Shortest Paths in Arrangements of Lines. CCCG Prosenjit Bose, William S. Evans, David G. Kirkpatrick, Michael McAllister, Jack Snoeyink
1996	J	`jnl`	Efficiently Planning Compliant Motion in the Plane. SIAM J. Comput. Joseph Friedman, John Hershberger, Jack Snoeyink
1996	J	`jnl`	Folding Rulers Inside Triangles. Discret. Comput. Geom. Marc J. van Kreveld, Jack Snoeyink, Sue Whitesides
1996	J	`jnl`	Generating Random Polygons with Given Vertices. Comput. Geom. Chong Zhu, Gopalakrishnan Sundaram, Jack Snoeyink, Joseph S. B. Mitchell
1996	—	`conf`	On Computing Edges That Are In All Minimum-Weight Triangulations. SCG Patrice Belleville, J. Mark Keil, Michael McAllister, Jack Snoeyink
1996	—	`conf`	On the Bit Complexity of Minimum Link Paths: Superquadratic Algorithms for Problems Solvable in Linear Time. SCG Simon Kahan, Jack Snoeyink
1996	—	`conf`	On the Sectional Area of Convex Polytopes. SCG David Avis, Prosenjit Bose, Godfried T. Toussaint, Thomas C. Shermer, Binhai Zhu, Jack Snoeyink
1996	J	`jnl`	Point Location in Zones of K-flats in Arrangements. Comput. Geom. Mark de Berg, Marc J. van Kreveld, Otfried Schwarzkopf, Jack Snoeyink
1996	—	`conf`	The Complexity of Rivers in Triangulated Terrains. CCCG Mark de Berg, Prosenjit Bose, Katrin Dobrindt, Marc J. van Kreveld, Mark H. Overmars, Marko de Groot, Thomas Roos, Jack Snoeyink, Sidi Yu
1995	B	`conf`	Computing Common Tangents Without a Separating Line. WADS David G. Kirkpatrick, Jack Snoeyink
1995	—	`conf`	Computing the largest inscribed isothetic rectangle. CCCG Helmut Alt, David Hsu, Jack Snoeyink
1995	B	`conf`	Finding the Medial Axis of a Simple Polygon in Linear Time. ISAAC Francis Y. L. Chin, Jack Snoeyink, Cao An Wang
1995	—	`conf`	Geometry in GIS is not Combinatorial: Segment Intersection for Polygon Overlay. SCG D. S. Andrews, Jack Snoeyink
1995	A	`conf`	Optimal Algorithms to Embed Trees in a Point Set. GD Prosenjit Bose, Michael McAllister, Jack Snoeyink
1995	A*	`conf`	Output-Sensitive Construction of Polytopes in Four Dimensions and Clipped Voronoi Diagrams in Three. SODA Timothy M. Chan, Jack Snoeyink, Chee-Keng Yap
1995	—	`ed.`	Proceedings of the Eleventh Annual Symposium on Computational Geometry, Vancouver, B.C., Canada, June 5-12, 1995 SCG Jack Snoeyink
1995	J	`jnl`	Tentative Prune-and-Search for Computing Fixed-Points with Applications to Geometric Computation. Fundam. Informaticae David G. Kirkpatrick, Jack Snoeyink
1995	—	`conf`	The complexity of a single face of a minkowski sum. CCCG Sariel Har-Peled, Timothy M. Chan, Boris Aronov, Dan Halperin, Jack Snoeyink
1995	J	`jnl`	Two- and Three-Dimensional Point Location in Rectangular Subdivisions. J. Algorithms Mark de Berg, Marc J. van Kreveld, Jack Snoeyink
1994	—	`conf`	An Efficient Solution to the Zookeeper's Problem. CCCG John Hershberger, Jack Snoeyink
1994	—	`conf`	An O(n log n) Implementation of the Douglas-Peucker Algorithm for Line Simplification. SCG John Hershberger, Jack Snoeyink
1994	J	`jnl`	An Optimal Algorithm for the On-Line Closest-Pair Problem. Algorithmica Christian Schwarz, Michiel H. M. Smid, Jack Snoeyink
1994	J	`jnl`	Computing Minimum Length Paths of a Given Homotopy Class. Comput. Geom. John Hershberger, Jack Snoeyink
1994	J	`jnl`	Counting and Reporting Red/Blue Segment Intersections. CVGIP Graph. Model. Image Process. Larry F. Palazzi, Jack Snoeyink
1994	J	`jnl`	Efficient Ray Shooting and Hidden Surface Removal. Algorithmica Mark de Berg, Dan Halperin, Mark H. Overmars, Jack Snoeyink, Marc J. van Kreveld
1994	—	`conf`	Generating Random x-Monotone Polygons with Given Vertices. CCCG Chong Zhu, Gopalakrishnan Sundaram, Jack Snoeyink, Joseph S. B. Mitchell
1994	J	`jnl`	Minimum-link C-oriented paths: Single-source queries. Int. J. Comput. Geom. Appl. John Adegeest, Mark H. Overmars, Jack Snoeyink
1994	J	`jnl`	Objects that Cannot Be Taken Apart with Two Hands. Discret. Comput. Geom. Jack Snoeyink, Jorge Stolfi
1994	J	`jnl`	Ray Shooting in Polygons Using Geodesic Triangulations. Algorithmica Bernard Chazelle, Herbert Edelsbrunner, Michelangelo Grigni, Leonidas J. Guibas, John Hershberger, Micha Sharir, Jack Snoeyink
1993	A*	`conf`	A Compact Piecewise-Linear Voronoi Diagram for Convex Sites in the Plane FOCS Michael McAllister, David G. Kirkpatrick, Jack Snoeyink
1993	J	`jnl`	An Efficient Algorithm for Finding the CSG Representation of a Simple Polygon. Algorithmica David P. Dobkin, Leonidas J. Guibas, John Hershberger, Jack Snoeyink
1993	J	`jnl`	Approximating Polygons and Subdivisions with Minimum Link Paths. Int. J. Comput. Geom. Appl. Leonidas J. Guibas, John Hershberger, Joseph S. B. Mitchell, Jack Snoeyink
1993	—	`conf`	Computing Constrained Shortest Segments: Butterfly Wingspans in Logarithmic Time. CCCG David G. Kirkpatrick, Jack Snoeyink
1993	J	`jnl`	Computing a Face in an Arrangement of Line Segments and Related Problems. SIAM J. Comput. Bernard Chazelle, Herbert Edelsbrunner, Leonidas J. Guibas, Micha Sharir, Jack Snoeyink
1993	B	`conf`	Counting and Reporting Red/Blue Segment Intersections. WADS Larry F. Palazzi, Jack Snoeyink
1993	—	`conf`	Folding Rulers inside Triangles. CCCG Marc J. van Kreveld, Jack Snoeyink, Sue Whitesides
1993	—	`conf`	Maintaining the Approximate Width of a Set of Points in the Plane. CCCG Günter Rote, Christian Schwarz, Jack Snoeyink
1993	—	`conf`	Objects That Cannot be Taken Apart with Two Hands. SCG Jack Snoeyink, Jorge Stolfi
1993	—	`conf`	Tentative Prune-and-Search for Computing Voronoi Vertices. SCG David G. Kirkpatrick, Jack Snoeyink
1993	—	`conf`	Two-dimensional Computation of the Three-dimensional Reachable Region for a Welding Head. CCCG Michael McAllister, Jack Snoeyink
1993	—	`conf`	Video: Objects that Cannot be Taken Apart with Two Hands. SCG Jack Snoeyink
1992	—	`conf`	An Optimal Algorithm for the On-Line Closest-Pair Problem. SCG Christian Schwarz, Michiel H. M. Smid, Jack Snoeyink
1992	—	`conf`	Convex Polygons Made from Few Lines and Convex Decompositions of Polyhedra. SWAT John Hershberger, Jack Snoeyink
1992	B	`conf`	Recognizing an Envelope of Lines in Linear Time. ISAAC Eric Guévremont, Jack Snoeyink
1992	—	`conf`	Two- and Three-Dimensional Point Location in Rectangular Subdivisions (Extended Abstract). SWAT Mark de Berg, Marc J. van Kreveld, Jack Snoeyink
1991	—	`conf`	Approximating Polygons and Subdivisions with Minimum Link Paths. ISA Leonidas J. Guibas, John Hershberger, Joseph S. B. Mitchell, Jack Snoeyink
1991	J	`jnl`	Compact interval trees: a data structure for convex hulls. Int. J. Comput. Geom. Appl. Leonidas J. Guibas, John Hershberger, Jack Snoeyink
1991	B	`conf`	Computing Minimum Length Paths of a Given Homotopy Class (Extended Abstract). WADS John Hershberger, Jack Snoeyink
1991	A*	`conf`	Computing a Face in an Arrangement of Line Segments. SODA Bernard Chazelle, Herbert Edelsbrunner, Leonidas J. Guibas, Micha Sharir, Jack Snoeyink
1991	J	`jnl`	Counting and Cutting Cycles of Lines and Rods in Space. Comput. Geom. Bernard Chazelle, Herbert Edelsbrunner, Leonidas J. Guibas, Richard Pollack, Raimund Seidel, Micha Sharir, Jack Snoeyink
1991	—	`conf`	Efficient Ray Shooting and Hidden Surface Removal. SCG Mark de Berg, Dan Halperin, Mark H. Overmars, Jack Snoeyink, Marc J. van Kreveld
1991	A*	`conf`	Ray Shooting in Polygons Using Geodesic Triangulations. ICALP Bernard Chazelle, Herbert Edelsbrunner, Michelangelo Grigni, Leonidas J. Guibas, John Hershberger, Micha Sharir, Jack Snoeyink
1990	—	`conf`	A Trivial Knot Whose Spanning Disks Have Exponential Size. SCG Jack Snoeyink
1990	A*	`conf`	Compact Interval Trees: A Data Structure for Convex Hulls. SODA Leonidas J. Guibas, John Hershberger, Jack Snoeyink
1990	A*	`conf`	Counting and Cutting Cycles of Lines and Rods in Space FOCS Bernard Chazelle, Herbert Edelsbrunner, Leonidas J. Guibas, Richard Pollack, Raimund Seidel, Micha Sharir, Jack Snoeyink
1990	—	`conf`	Input-Sensitive Compliant Motion in the Plane. SWAT Joseph Friedman, John Hershberger, Jack Snoeyink
1990	J	`jnl`	Stabbing Parallel Segments with a Convex Polygon. Comput. Vis. Graph. Image Process. Michael T. Goodrich, Jack Snoeyink
1990	—	`conf`	Sweeping Arrangements of Curves. Discrete and Computational Geometry Jack Snoeyink, John Hershberger
1990	—	`—`	Topological approaches in computational geometry. Jack Snoeyink
1989	—	`conf`	Compliant Motion in a Simple Polygon. SCG Joseph Friedman, John Hershberger, Jack Snoeyink
1989	J	`jnl`	Implicitly Representing Arrangements of Lines or Segments. Discret. Comput. Geom. Herbert Edelsbrunner, Leonidas J. Guibas, John Hershberger, Raimund Seidel, Micha Sharir, Jack Snoeyink, Emo Welzl
1989	J	`jnl`	On Arrangement of Jordan Arcs with Three Intersection per Pair. Discret. Comput. Geom. Herbert Edelsbrunner, Leonidas J. Guibas, John Hershberger, János Pach, Richard Pollack, Raimund Seidel, Micha Sharir, Jack Snoeyink
1989	B	`conf`	Stabbing Parallel Segments with a Convex Polygon (Extended Abstract). WADS Michael T. Goodrich, Jack Snoeyink
1989	—	`conf`	Sweeping Arrangements of Curves. SCG Jack Snoeyink, John Hershberger
1988	A*	`conf`	An efficient algorithm for finding the CSG representation of a simple polygon. SIGGRAPH David P. Dobkin, Leonidas J. Guibas, John Hershberger, Jack Snoeyink
1988	—	`conf`	Implicitly Representing Arrangements of Lines or Segments. SCG Herbert Edelsbrunner, Leonidas J. Guibas, John Hershberger, Raimund Seidel, Micha Sharir, Jack Snoeyink, Emo Welzl
1988	—	`conf`	On Arrangements of Jordan Arcs with Three Intersections per Pair. SCG Herbert Edelsbrunner, Leonidas J. Guibas, John Hershberger, János Pach, Richard Pollack, Raimund Seidel, Micha Sharir, Jack Snoeyink