Google
Google Scholar
Semantic Scholar
MS Academic
CiteSeerX
ORCIDJack Snoeyink
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2010 – 2019
- 2018
[j90]Zachary Abel, Erik D. Demaine, Martin L. Demaine, Hiro Ito, Jack Snoeyink, Ryuhei Uehara:
Bumpy pyramid folding. Comput. Geom. 75: 22-31 (2018)- 2017
- [j89]Anna Lubiw, Jack Snoeyink, Hamideh Vosoughpour:
Visibility graphs, dismantlability, and the cops and robbers game. Comput. Geom. 66: 14-27 (2017) - 2016
- [c140]Michael Deakin, Jack Snoeyink:
On the Precision to Sort Line-Quadric Intersections. CCCG 2016: 122-127 - [c139]Jack Snoeyink:
Creating a robust implementation for segment intersection by refinement: A multistage assignment that defines away degeneracies. CCCG 2016: 309-314 - [i8]Anna Lubiw, Jack Snoeyink, Hamideh Vosoughpour:
Visibility Graphs, Dismantlability, and the Cops and Robbers Game. CoRR abs/1601.01298 (2016) - [i7]Michael Deakin, Jack Snoeyink:
On the Precision to Sort Line-Quadric Intersections. CoRR abs/1605.05629 (2016) - 2014
- [j88]Oswin Aichholzer, Greg Aloupis, Erik D. Demaine, Martin L. Demaine, Sándor P. Fekete, Michael Hoffmann, Anna Lubiw, Jack Snoeyink, Andrew Winslow:
Covering Folded Shapes. J. Comput. Geom. 5(1): 150-167 (2014) - [j87]Pinyan Lu, Jack Snoeyink
:
Frontiers in algorithmics. Theor. Comput. Sci. 532: 1 (2014) - [c138]Zachary Abel, Erik D. Demaine, Martin L. Demaine, Hiro Ito, Jack Snoeyink, Ryuhei Uehara:
Bumpy Pyramid Folding. CCCG 2014 - [c137]Borislav Karaivanov, Minko Markov, Jack Snoeyink, Tzvetalin S. Vassilev:
Decontaminating Planar Regions by Sweeping with Barrier Curves. CCCG 2014 - [c136]Anna Lubiw, Jack Snoeyink, Hamideh Vosoughpour:
Visibility Graphs, Dismantlability, and the Cops and Robbers Game. CCCG 2014 - [c135]Jack Snoeyink:
Time, Space, and Precision: Revisiting Classic Problems in Computational Geometry with Degree-Driven Analysis, pp. 280. CCCG 2014 - [i6]Oswin Aichholzer, Greg Aloupis, Erik D. Demaine, Martin L. Demaine, Sándor P. Fekete, Michael Hoffmann, Anna Lubiw, Jack Snoeyink, Andrew Winslow:
Covering Folded Shapes. CoRR abs/1405.2378 (2014) - 2013
- [c134]Oswin Aichholzer, Greg Aloupis, Erik D. Demaine, Martin L. Demaine, Sándor P. Fekete, Michael Hoffmann, Anna Lubiw, Jack Snoeyink, Andrew Winslow:
Covering Folded Shapes. CCCG 2013 - 2012
- [c133]David L. Millman, Steven Love, Timothy M. Chan, Jack Snoeyink:
Computing the Nearest Neighbor Transform Exactly with Only Double Precision. ISVD 2012: 66-74 - [e4]Jack Snoeyink, Pinyan Lu, Kaile Su, Lusheng Wang:
Frontiers in Algorithmics and Algorithmic Aspects in Information and Management - Joint International Conference, FAW-AAIM 2012, Beijing, China, May 14-16, 2012. Proceedings. Lecture Notes in Computer Science 7285, Springer 2012, ISBN 978-3-642-29699-4 [contents] - 2011
- [j86]Prosenjit Bose, Luc Devroye, Maarten Löffler, Jack Snoeyink, Vishal Verma:
Almost all Delaunay triangulations have stretch factor greater than pi/2. Comput. Geom. 44(2): 121-127 (2011) - [j85]Therese C. Biedl, Stephane Durocher, Jack Snoeyink:
Reconstructing polygons from scanner data. Theor. Comput. Sci. 412(32): 4161-4172 (2011) - [c132]Jack Snoeyink:
Degree-Driven Design for Correct Geometric Algorithms. FAW-AAIM 2011: 8-9 - [c131]Sajal Dash, Jack Snoeyink:
On the energy of bifurcated hydrogen bonds for protein structure prediction. BIBM Workshops 2011: 334-337 - [c130]Jack Snoeyink, Vishal Verma:
Fitting spheres to electron density. Symposium on Computational Geometry 2011: 291-292 - 2010
- [j84]Hamish A. Carr, Jack Snoeyink, Michiel van de Panne:
Flexible isosurfaces: Simplifying and displaying scalar topology using the contour tree. Comput. Geom. 43(1): 42-58 (2010) - [j83]Maarten Löffler, Jack Snoeyink:
Delaunay triangulation of imprecise points in linear time after preprocessing. Comput. Geom. 43(3): 234-242 (2010) - [j82]Deepak Bandyopadhyay, Jun Huan, Jinze Liu, Jan F. Prins, Jack Snoeyink, Wei Wang, Alexander Tropsha:
Functional neighbors: inferring relationships between nonhomologous protein families using family-specific packing motifs. IEEE Trans. Inf. Technol. Biomed. 14(5): 1137-1143 (2010) - [c129]Catalin Constantin, Shawn Brown, Jack Snoeyink:
Implementing Streaming Simplification for large Labeled Meshes. ALENEX 2010: 149-158 - [c128]David L. Millman, Matthew O'Meara, Jack Snoeyink, Vishal Verma:
Maximum geodesic routing in the plane with obstacles. CCCG 2010: 107-108 - [c127]David L. Millman, Jack Snoeyink:
Computing planar Voronoi diagrams in double precision: a further example of degree-driven algorithm design. Symposium on Computational Geometry 2010: 386-392 - [c126]Binay K. Bhattacharya, Arijit Bishnu, Otfried Cheong, Sandip Das, Arindam Karmakar, Jack Snoeyink:
Computation of Non-dominated Points Using Compact Voronoi Diagrams. WALCOM 2010: 82-93 - [i5]Prosenjit Bose, Luc Devroye, Maarten Löffler, Jack Snoeyink, Vishal Verma:
The dilation of the Delaunay triangulation is greater than π/2. CoRR abs/1006.0291 (2010)
2000 – 2009
- 2009
- [j81]Deepak Bandyopadhyay, Jun Huan, Jan F. Prins, Jack Snoeyink, Wei Wang, Alexander Tropsha:
Identification of family-specific residue packing motifs and their use for structure-based protein function prediction: I. Method development. J. Comput. Aided Mol. Des. 23(11): 773-784 (2009) - [j80]Deepak Bandyopadhyay, Jun Huan, Jan F. Prins, Jack Snoeyink, Wei Wang, Alexander Tropsha:
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. 23(11): 785-797 (2009) - [c125]Vishal Verma, Jack Snoeyink:
Defining and computing accessibility radius. CCCG 2009: 123-126 - [c124]Prosenjit Bose, Luc Devroye, Maarten Löffler, Jack Snoeyink, Vishal Verma:
The spanning ratio of the Delaunay triangulation is greater than pi/2. CCCG 2009: 165-167 - [c123]Vishal Verma, Jack Snoeyink:
Reducing the memory required to find a geodesic shortest path on a large mesh. GIS 2009: 227-235 - [c122]Therese C. Biedl, Stephane Durocher, Jack Snoeyink:
Reconstructing Polygons from Scanner Data. ISAAC 2009: 862-871 - [c121]Jur van den Berg, Jack Snoeyink, Ming C. Lin, Dinesh Manocha:
Centralized path planning for multiple robots: Optimal decoupling into sequential plans. Robotics: Science and Systems 2009 - [c120]David L. Millman, Jack Snoeyink:
Computing the Implicit Voronoi Diagram in Triple Precision. WADS 2009: 495-506 - [p2]Ajith Mascarenhas, Jack Snoeyink:
Isocontour based Visualization of Time-varying Scalar Fields. Mathematical Foundations of Scientific Visualization, Computer Graphics, and Massive Data Exploration 2009: 41-68 - [p1]Hamish A. Carr, Jack Snoeyink:
Representing Interpolant Topology for Contour Tree Computation. Topology-Based Methods in Visualization II 2009: 59-73 - [i4]Binay K. Bhattacharya, Arijit Bishnu, Otfried Cheong, Sandip Das, Arindam Karmakar, Jack Snoeyink:
On Finding Non-dominated Points using Compact Voronoi Diagrams. CoRR abs/0909.0814 (2009) - 2008
- [j79]Iris Reinbacher, Marc Benkert, Marc J. van Kreveld, Joseph S. B. Mitchell, Jack Snoeyink, Alexander Wolff:
Delineating Boundaries for Imprecise Regions. Algorithmica 50(3): 386-414 (2008) - [j78]V. Anuradha, Chinmay Jain, Jack Snoeyink, Tibor Szabó:
How Long Can a Graph be Kept Planar? Electron. J. Comb. 15(1) (2008) - [j77]Herbert Edelsbrunner, John Harer, Ajith Mascarenhas, Valerio Pascucci, Jack Snoeyink:
Time-varying Reeb graphs for continuous space-time data. Comput. Geom. 41(3): 149-166 (2008) - [j76]Marc J. van Kreveld, Joseph S. B. Mitchell, Peter Rousseeuw, Micha Sharir, Jack Snoeyink, Bettina Speckmann:
Efficient Algorithms for Maximum Regression Depth. Discret. Comput. Geom. 39(4): 656-677 (2008) - [j75]Andreas Razen, Jack Snoeyink, Emo Welzl:
Number of Crossing-Free Geometric Graphs vs. Triangulations. Electron. Notes Discret. Math. 31: 195-200 (2008) - [j74]Yuanxin Liu, Jack Snoeyink:
Faraway Point: a Sentinel Point for Delaunay Computation. Int. J. Comput. Geom. Appl. 18(4): 343-355 (2008) - [j73]Esther M. Arkin, Joseph S. B. Mitchell, Jack Snoeyink:
Capturing crossings: Convex hulls of segment and plane intersections. Inf. Process. Lett. 107(5): 194-197 (2008) - [j72]Xueyi Wang, Jack Snoeyink:
Defining and Computing Optimum RMSD for Gapped and Weighted Multiple-Structure Alignment. IEEE ACM Trans. Comput. Biol. Bioinform. 5(4): 525-533 (2008) - [c119]Deepak Bandyopadhyay, Jun Huan, Jinze Liu, Jan F. Prins, Jack Snoeyink, Wei Wang, Alexander Tropsha:
Functional Neighbors: Inferring Relationships between Non-Homologous Protein Families Using Family-Specific Packing Motifs. BIBM 2008: 199-206 - [c118]Maarten Löffler, Jack Snoeyink:
Delaunay triangulations of imprecise pointsin linear time after preprocessing. Symposium on Computational Geometry 2008: 298-304 - [c117]Andrew Leaver-Fay, Jack Snoeyink, Brian Kuhlman:
On-the-Fly Rotamer Pair Energy Evaluation in Protein Design. ISBRA 2008: 343-354 - [c116]Ruth Nussinov, Tao Ju, Talapady Bhat, Jack Snoeyink, Karthik Ramani:
Bio-geometry: challenges, approaches, and future opportunities in proteomics and drug discovery. Symposium on Solid and Physical Modeling 2008: 417-418 - 2007
- [j71]Deepak Bandyopadhyay, Jack Snoeyink:
Almost-Delaunay simplices: Robust neighbor relations for imprecise 3D points using CGAL. Comput. Geom. 38(1-2): 4-15 (2007) - [j70]Andrew Leaver-Fay, Glenn L. Butterfoss, Jack Snoeyink, Brian Kuhlman:
Maintaining solvent accessible surface area under rotamer substitution for protein design. J. Comput. Chem. 28(8): 1336-1341 (2007) - [j69]Andrew Leaver-Fay, Yuanxin Liu, Jack Snoeyink, Xueyi Wang:
Faster placement of hydrogens in protein structures by dynamic programming. ACM J. Exp. Algorithmics 12: 2.5:1-2.5:16 (2007) - [j68]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:
MolProbity: all-atom contacts and structure validation for proteins and nucleic acids. Nucleic Acids Res. 35(Web-Server-Issue): 375-383 (2007) - [j67]Jack Snoeyink:
Maximum independent set for intervals by divide and conquer with pruning. Networks 49(2): 158-159 (2007) - [c115]Esther M. Arkin, Joseph S. B. Mitchell, Jack Snoeyink:
Capturing Crossings: Convex Hulls of Segment and Plane Intersections. CCCG 2007: 9-11 - [c114]Suddha Basu, Jack Snoeyink:
Terrain Representation using Right-Triangulated Irregular Networks. CCCG 2007: 133-136 - [c113]Yuanxin Liu, Jack Snoeyink:
Quadratic and cubic b-splines by generalizing higher-order voronoi diagrams. Symposium on Computational Geometry 2007: 150-157 - [c112]Xueyi Wang, Jun Huan, Jack Snoeyink, Wei Wang:
Mining RNA Tertiary Motifs with Structure Graphs. SSDBM 2007: 31 - [c111]Xueyi Wang, Jack Snoeyink:
Defining and Computing Optimum RMSD for Gapped Multiple Structure Alignment. WABI 2007: 196-207 - 2006
- [j66]Jean-Daniel Boissonnat, Jack Snoeyink:
Editorial. Comput. Geom. 35(1-2): 1 (2006) - [j65]Jean-Daniel Boissonnat, Jack Snoeyink:
Guest Editors' Foreword. Discret. Comput. Geom. 36(4): 501-502 (2006) - [j64]Hervé Brönnimann, Lutz Kettner, Michel Pocchiola, Jack Snoeyink:
Counting and Enumerating Pointed Pseudotriangulations with the Greedy Flip Algorithm. SIAM J. Comput. 36(3): 721-739 (2006) - [j63]Martin Isenburg, Yuanxin Liu, Jonathan Richard Shewchuk, Jack Snoeyink:
Streaming computation of Delaunay triangulations. ACM Trans. Graph. 25(3): 1049-1056 (2006) - [j62]Hamish A. Carr, Torsten Möller, Jack Snoeyink:
Artifacts Caused by Simplicial Subdivision. IEEE Trans. Vis. Comput. Graph. 12(2): 231-242 (2006) - [c110]Christopher G. Healey, Jack Snoeyink:
VisTRE: A Visualization Tool to Evaluate Errors in Terrain Representation. 3DPVT 2006: 1056-1063 - [c109]Yulai Xie, Jack Snoeyink, Jinhui Xu:
Efficient algorithm for approximating maximum inscribed sphere in high dimensional polytope. Symposium on Computational Geometry 2006: 21-29 - [c108]Martin Isenburg, Yuanxin Liu, Jonathan Richard Shewchuk, Jack Snoeyink:
Illustrating the streaming construction of 2D delaunay triangulations. Symposium on Computational Geometry 2006: 481-482 - [c107]Martin Isenburg, Yuanxin Liu, Jonathan Richard Shewchuk, Jack Snoeyink, Tim Thirion:
Generating Raster DEM from Mass Points Via TIN Streaming. GIScience 2006: 186-198 - [c106]Martin Isenburg, Jack Snoeyink:
Early-split coding of triangle mesh connectivity. Graphics Interface 2006: 89-97 - [c105]Yuanxin Liu, Jack Snoeyink:
Sphere-based Computation of Delaunay Diagrams on Points from 4d Grids. ISVD 2006: 60-65 - 2005
- [j61]Martin Isenburg, Peter Lindstrom, Jack Snoeyink:
Lossless compression of predicted floating-point geometry. Comput. Aided Des. 37(8): 869-877 (2005) - [j60]Jack Snoeyink, Subhash Suri, George Varghese:
A lower bound for multicast key distribution. Comput. Networks 47(3): 429-441 (2005) - [j59]Jack Snoeyink:
Editorial. Comput. Geom. 31(3): 149 (2005) - [j58]Danny Z. Chen, Ovidiu Daescu, John Hershberger, Peter M. Kogge, Ningfang Mi, Jack Snoeyink:
Polygonal path simplification with angle constraints. Comput. Geom. 32(3): 173-187 (2005) - [j57]Kimberly Noonan, David O'Brien, Jack Snoeyink:
Probik: Protein Backbone Motion by Inverse Kinematics. Int. J. Robotics Res. 24(11): 971-982 (2005) - [j56]Jun Huan, Deepak Bandyopadhyay, Wei Wang, Jack Snoeyink, Jan F. Prins, Alexander Tropsha:
Comparing Graph Representations of Protein Structure for Mining Family-Specific Residue-Based Packing Motifs. J. Comput. Biol. 12(6): 657-671 (2005) - [c104]Hervé Brönnimann, Lutz Kettner, Michel Pocchiola, Jack Snoeyink:
Counting and Enumerating Pointed Pseudo-triangulations with the Greedy Flip Algorithm. ALENEX/ANALCO 2005: 98-110 - [c103]Craig Falls, Yuanxin Liu, Jack Snoeyink, Diane L. Souvaine:
Testing Shortcuts to Maintain Simplicity in Subdivision Simplification. CCCG 2005: 35-38 - [c102]Jack Snoeyink, Ileana Streinu:
Computing Rigid Components of Pseudo-triangulation Mechanisms in Linear Time. CCCG 2005: 223-226 - [c101]Jack Snoeyink:
Maximum Independent Set for Intervals by Divide-Prune-and-Conquer. CCCG 2005: 264-265 - [c100]Ajith Mascarenhas, Jack Snoeyink:
Implementing time-varying contour trees. Symposium on Computational Geometry 2005: 370-371 - [c99]Andrew Leaver-Fay, Brian Kuhlman, Jack Snoeyink:
An Adaptive Dynamic Programming Algorithm for the Side Chain Placement Problem. Pacific Symposium on Biocomputing 2005: 17-28 - [c98]Martin Isenburg, Peter Lindstrom, Jack Snoeyink:
Streaming Compression of Triangle Meshes. Symposium on Geometry Processing 2005: 111-118 - [c97]Martin Isenburg, Peter Lindstrom, Jack Snoeyink:
Streaming compression of triangle meshes. SIGGRAPH Sketches 2005: 136 - [c96]Andrew Leaver-Fay, Brian Kuhlman, Jack Snoeyink:
Rotamer-Pair Energy Calculations Using a Trie Data Structure. WABI 2005: 389-400 - 2004
- [j55]Michael J. Spriggs, J. Mark Keil, Sergei Bespamyatnikh, Michael Segal, Jack Snoeyink:
Computing a (1+epsilon)-Approximate Geometric Minimum-Diameter Spanning Tree. Algorithmica 38(4): 577-589 (2004) - [j54]Sergio Cabello, Yuanxin Liu, Andrea Mantler, Jack Snoeyink:
Testing Homotopy for Paths in the Plane. Discret. Comput. Geom. 31(1): 61-81 (2004) - [j53]Hee-Kap Ahn, Siu-Wing Cheng, Otfried Cheong, Jack Snoeyink:
The reflex-free hull. Int. J. Comput. Geom. Appl. 14(6): 453-474 (2004) - [c95]Ajith Mascarenhas, Martin Isenburg, Valerio Pascucci, Jack Snoeyink:
Encoding Volumetric Grids For Streaming Isosurface Extraction. 3DPVT 2004: 665-672 - [c94]Andrew Leaver-Fay, Yuanxin Liu, Jack Snoeyink:
Faster Placement of Hydrogens in Protein Structures by Dynamic Programming. ALENEX/ANALC 2004: 39-48 - [c93]Andrea Mantler, Jack Snoeyink:
Banana spiders: A study of connectivity in 3d combinatorial rigidity. CCCG 2004: 44-47 - [c92]Jun Huan, Wei Wang, Deepak Bandyopadhyay, Jack Snoeyink, Jan F. Prins, Alexander Tropsha:
Mining protein family specific residue packing patterns from protein structure graphs. RECOMB 2004: 308-315 - [c91]Yuanxin Liu, Jack Snoeyink:
Flooding Triangulated Terrain. SDH 2004: 137-148 - [c90]Deepak Bandyopadhyay, Jack Snoeyink:
Almost-Delaunay simplices: nearest neighbor relations for imprecise points. SODA 2004: 410-419 - [c89]Hamish A. Carr, Jack Snoeyink, Michiel van de Panne:
Simplifying Flexible Isosurfaces Using Local Geometric Measures. IEEE Visualization 2004: 497-504 - [c88]Kimberly Noonan, David O'Brien, Jack Snoeyink:
Probik: Protein Backbone Motion by Inverse Kinematics. WAFR 2004: 377-392 - [e3]Jack Snoeyink, Jean-Daniel Boissonnat:
Proceedings of the 20th ACM Symposium on Computational Geometry, Brooklyn, New York, USA, June 8-11, 2004. ACM 2004, ISBN 1-58113-885-7 [contents] - [r1]Jack Snoeyink:
Point Location. Handbook of Discrete and Computational Geometry, 2nd Ed. 2004: 767-785 - [i3]Julie Glass, Stefan Langerman, Joseph O'Rourke, Jack Snoeyink, Jianyuan K. Zhong:
A 2-chain can interlock with a k-chain. CoRR cs.CG/0410052 (2004) - 2003
- [j52]Marshall W. Bern, Erik D. Demaine, David Eppstein, Eric Kuo, Andrea Mantler, Jack Snoeyink:
Ununfoldable polyhedra with convex faces. Comput. Geom. 24(2): 51-62 (2003) - [j51]Hamish A. Carr, Jack Snoeyink, Ulrike Axen:
Computing contour trees in all dimensions. Comput. Geom. 24(2): 75-94 (2003) - [j50]Lutz Kettner, David G. Kirkpatrick, Andrea Mantler, Jack Snoeyink, Bettina Speckmann, Fumihiko Takeuchi:
Tight degree bounds for pseudo-triangulations of points. Comput. Geom. 25(1-2): 3-12 (2003) - [j49]Lutz Kettner, Jarek Rossignac, Jack Snoeyink:
The Safari interface for visualizing time-dependent volume data using iso-surfaces and contour spectra. Comput. Geom. 25(1-2): 97-116 (2003) - [j48]Erik D. Demaine, Stefan Langerman, Joseph O'Rourke, Jack Snoeyink:
Interlocked open and closed linkages with few joints. Comput. Geom. 26(1): 37-45 (2003) - [j47]Joel Hass, Jack Snoeyink, William P. Thurston:
The Size of Spanning Disks for Polygonal Curves. Discret. Comput. Geom. 29(1): 1-17 (2003) - [j46]Tetsuo Asano, Mark de Berg, Otfried Cheong, Leonidas J. Guibas, Jack Snoeyink, Hisao Tamaki:
Spanning Trees Crossing Few Barriers. Discret. Comput. Geom. 30(4): 591-606 (2003) - [c87]Michael J. Spriggs, J. Mark Keil, Sergei Bespamyatnikh, Michael Segal, Jack Snoeyink:
Approximating the geometric minimum-diameter spanning tree. CCCG 2003: 39-42 - [c86]Martin Isenburg, Jack Snoeyink:
Compressing Texture Coordinates with Selective Linear Predictions. Computer Graphics International 2003: 126-133 - [c85]Hamish A. Carr, Jack Snoeyink:
Path Seeds and Flexible Isosurfaces - Using Topology for Exploratory Visualization. VisSym 2003: 49-58 - [c84]Martin Isenburg, Peter Lindstrom, Stefan Gumhold, Jack Snoeyink:
Large Mesh Simplification using Processing Sequences. IEEE Visualization 2003: 465-472 - [c83]Martin Isenburg, Jack Snoeyink:
Binary compression rates for ASCII formats. Web3D 2003: 173-178 - 2002
- [j45]Gill Barequet, Danny Z. Chen, Ovidiu Daescu, Michael T. Goodrich, Jack Snoeyink:
Efficiently Approximating Polygonal Paths in Three and Higher Dimensions. Algorithmica 33(2): 150-167 (2002) - [j44]Prosenjit Bose, Ferran Hurtado, Elsa Omaña-Pulido, Jack Snoeyink, Godfried T. Toussaint:
Some Aperture-Angle Optimization Problems. Algorithmica 33(4): 411-435 (2002) - [j43]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:
Algorithmic issues in modeling motion. ACM Comput. Surv. 34(4): 550-572 (2002) - [j42]Martin Isenburg, Jack Snoeyink:
Compressing the Property Mapping of Polygon Meshes. Graph. Model. 64(2): 114-127 (2002) - [j41]David G. Kirkpatrick, Jack Snoeyink, Bettina Speckmann:
Kinetic Collision Detection for Simple Polygons. Int. J. Comput. Geom. Appl. 12(1-2): 3-27 (2002) - [j40]J. Mark Keil, Jack Snoeyink:
On the Time Bound for Convex Decomposition of Simple Polygons. Int. J. Comput. Geom. Appl. 12(3): 181-192 (2002) - [c82]Martin Isenburg, Jack Snoeyink:
Coding with ASCII: compact, yet text-based 3D content. 3DPVT 2002: 609-617 - [c81]Sergio Cabello, Yuanxin Liu, Andrea Mantler, Jack Snoeyink:
Testing Homotopy for paths in the plane. Symposium on Computational Geometry 2002: 160-169 - [c80]Erik D. Demaine, Stefan Langerman, Joseph O'Rourke, Jack Snoeyink:
Interlocked open linkages with few joints. Symposium on Computational Geometry 2002: 189-198 - [c79]Martin Isenburg, Jack Snoeyink:
Coding polygon meshes as compressable ASCII. Web3D 2002: 1-10 - 2001
- [j39]Christopher M. Gold, Jack Snoeyink:
A One-Step Crust and Skeleton Extraction Algorithm. Algorithmica 30(2): 144-163 (2001) - [j38]Martin Isenburg, Jack Snoeyink:
Spirale Reversi: Reverse decoding of the Edgebreaker encoding. Comput. Geom. 20(1-2): 39-52 (2001) - [j37]Robert L. (Scot) Drysdale III, Scott A. McElfresh, Jack Snoeyink:
On exclusion regions for optimal triangulations. Discret. Appl. Math. 109(1-2): 49-65 (2001) - [j36]