Coauthor Index - Ask others: ACM DL/Guide - CiteSeerX - CSB - MetaPress - Google - Bing - Yahoo

Home Page

* | 2009 | |
---|---|---|

194 | EE | David L. Millman, Jack Snoeyink: Computing the Implicit Voronoi Diagram in Triple Precision. WADS 2009: 495-506 |

193 | EE | 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 | ||

192 | EE | Andrew Leaver-Fay, Jack Snoeyink, Brian Kuhlman: On-the-Fly Rotamer Pair Energy Evaluation in Protein Design. ISBRA 2008: 343-354 |

191 | EE | Maarten Löffler, Jack Snoeyink: Delaunay triangulations of imprecise pointsin linear time after preprocessing. Symposium on Computational Geometry 2008: 298-304 |

190 | EE | 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 |

189 | EE | 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) |

188 | EE | 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) |

187 | EE | Marc J. van Kreveld, Joseph S. B. Mitchell, Peter Rousseeuw, Micha Sharir, Jack Snoeyink, Bettina Speckmann: Efficient Algorithms for Maximum Regression Depth. Discrete & Computational Geometry 39(4): 656-677 (2008) |

186 | EE | Andreas Razen, Jack Snoeyink, Emo Welzl: Number of Crossing-Free Geometric Graphs vs. Triangulations. Electronic Notes in Discrete Mathematics 31: 195-200 (2008) |

185 | EE | Xueyi Wang, Jack Snoeyink: Defining and Computing Optimum RMSD for Gapped and Weighted Multiple-Structure Alignment. IEEE/ACM Trans. Comput. Biology Bioinform. 5(4): 525-533 (2008) |

184 | EE | 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) |

183 | EE | Yuanxin Liu, Jack Snoeyink: Faraway Point: a Sentinel Point for Delaunay Computation. Int. J. Comput. Geometry Appl. 18(4): 343-355 (2008) |

2007 | ||

182 | Suddha Basu, Jack Snoeyink: Terrain Representation using Right-Triangulated Irregular Networks. CCCG 2007: 133-136 | |

181 | Esther M. Arkin, Joseph S. B. Mitchell, Jack Snoeyink: Capturing Crossings: Convex Hulls of Segment and Plane Intersections. CCCG 2007: 9-11 | |

180 | EE | Xueyi Wang, Jun Huan, Jack Snoeyink, Wei Wang: Mining RNA Tertiary Motifs with Structure Graphs. SSDBM 2007: 31 |

179 | EE | Yuanxin Liu, Jack Snoeyink: Quadratic and cubic b-splines by generalizing higher-order voronoi diagrams. Symposium on Computational Geometry 2007: 150-157 |

178 | EE | Xueyi Wang, Jack Snoeyink: Defining and Computing Optimum RMSD for Gapped Multiple Structure Alignment. WABI 2007: 196-207 |

177 | EE | Andrew Leaver-Fay, Yuanxin Liu, Jack Snoeyink, Xueyi Wang: Faster placement of hydrogens in protein structures by dynamic programming. ACM Journal of Experimental Algorithmics 12: (2007) |

176 | EE | Deepak Bandyopadhyay, Jack Snoeyink: Almost-Delaunay simplices: Robust neighbor relations for imprecise 3D points using CGAL. Comput. Geom. 38(1-2): 4-15 (2007) |

175 | EE | Andrew Leaver-Fay, Glenn L. Butterfoss, Jack Snoeyink, Brian Kuhlman: Maintaining solvent accessible surface area under rotamer substitution for protein design. Journal of Computational Chemistry 28(8): 1336-1341 (2007) |

174 | EE | Jack Snoeyink: Maximum independent set for intervals by divide and conquer with pruning. Networks 49(2): 158-159 (2007) |

173 | EE | 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 Research 35(Web-Server-Issue): 375-383 (2007) |

2006 | ||

172 | EE | Christopher G. Healey, Jack Snoeyink: VisTRE: A Visualization Tool to Evaluate Errors in Terrain Representation. 3DPVT 2006: 1056-1063 |

171 | EE | Martin Isenburg, Yuanxin Liu, Jonathan Richard Shewchuk, Jack Snoeyink, Tim Thirion: Generating Raster DEM from Mass Points Via TIN Streaming. GIScience 2006: 186-198 |

170 | EE | Martin Isenburg, Jack Snoeyink: Early-split coding of triangle mesh connectivity. Graphics Interface 2006: 89-97 |

169 | EE | Yulai Xie, Jack Snoeyink, Jinhui Xu: Efficient algorithm for approximating maximum inscribed sphere in high dimensional polytope. Symposium on Computational Geometry 2006: 21-29 |

168 | EE | Martin Isenburg, Yuanxin Liu, Jonathan Richard Shewchuk, Jack Snoeyink: Illustrating the streaming construction of 2D delaunay triangulations. Symposium on Computational Geometry 2006: 481-482 |

167 | EE | Martin Isenburg, Yuanxin Liu, Jonathan Richard Shewchuk, Jack Snoeyink: Streaming computation of Delaunay triangulations. ACM Trans. Graph. 25(3): 1049-1056 (2006) |

166 | EE | Jean-Daniel Boissonnat, Jack Snoeyink: Editorial. Comput. Geom. 35(1-2): 1 (2006) |

165 | EE | Jean-Daniel Boissonnat, Jack Snoeyink: Guest Editors' Foreword. Discrete & Computational Geometry 36(4): 501-502 (2006) |

164 | EE | Hamish Carr, Torsten Möller, Jack Snoeyink: Artifacts Caused by Simplicial Subdivision. IEEE Trans. Vis. Comput. Graph. 12(2): 231-242 (2006) |

163 | EE | 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) |

2005 | ||

162 | EE | 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 |

161 | EE | Jack Snoeyink, Ileana Streinu: Computing Rigid Components of Pseudo-triangulation Mechanisms in Linear Time. CCCG 2005: 223-226 |

160 | EE | Jack Snoeyink: Maximum Independent Set for Intervals by Divide-Prune-and-Conquer. CCCG 2005: 264-265 |

159 | EE | Craig Falls, Yuanxin Liu, Jack Snoeyink, Diane L. Souvaine: Testing Shortcuts to Maintain Simplicity in Subdivision Simplification. CCCG 2005: 35-38 |

158 | EE | 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 |

157 | EE | Ajith Mascarenhas, Jack Snoeyink: Implementing time-varying contour trees. Symposium on Computational Geometry 2005: 370-371 |

156 | Martin Isenburg, Peter Lindstrom, Jack Snoeyink: Streaming Compression of Triangle Meshes. Symposium on Geometry Processing 2005: 111-118 | |

155 | EE | Andrew Leaver-Fay, Brian Kuhlman, Jack Snoeyink: Rotamer-Pair Energy Calculations Using a Trie Data Structure. WABI 2005: 389-400 |

154 | EE | Jack Snoeyink: Editorial. Comput. Geom. 31(3): 149- (2005) |

153 | EE | 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) |

152 | EE | Jack Snoeyink, Subhash Suri, George Varghese: A lower bound for multicast key distribution. Computer Networks 47(3): 429-441 (2005) |

151 | EE | Martin Isenburg, Peter Lindstrom, Jack Snoeyink: Lossless compression of predicted floating-point geometry. Computer-Aided Design 37(8): 869-877 (2005) |

150 | EE | Kimberly Noonan, David O'Brien, Jack Snoeyink: Probik: Protein Backbone Motion by Inverse Kinematics. I. J. Robotic Res. 24(11): 971-982 (2005) |

149 | EE | Jun Huan, Deepak Bandyopadhyay, Wei Wang, Jack Snoeyink, Jan Prins, Alexander Tropsha: Comparing Graph Representations of Protein Structure for Mining Family-Specific Residue-Based Packing Motifs. Journal of Computational Biology 12(6): 657-671 (2005) |

2004 | ||

148 | Jack Snoeyink, Jean-Daniel Boissonnat: Proceedings of the 20th ACM Symposium on Computational Geometry, Brooklyn, New York, USA, June 8-11, 2004 ACM 2004 | |

147 | EE | Ajith Mascarenhas, Martin Isenburg, Valerio Pascucci, Jack Snoeyink: Encoding Volumetric Grids For Streaming Isosurface Extraction. 3DPVT 2004: 665-672 |

146 | Andrew Leaver-Fay, Yuanxin Liu, Jack Snoeyink: Faster Placement of Hydrogens in Protein Structures by Dynamic Programming. ALENEX/ANALC 2004: 39-48 | |

145 | EE | Andrea Mantler, Jack Snoeyink: Banana spiders: A study of connectivity in 3d combinatorial rigidity. CCCG 2004: 44-47 |

144 | EE | Hamish Carr, Jack Snoeyink, Michiel van de Panne: Simplifying Flexible Isosurfaces Using Local Geometric Measures. IEEE Visualization 2004: 497-504 |

143 | EE | Jun Huan, Wei Wang, Deepak Bandyopadhyay, Jack Snoeyink, Jan Prins, Alexander Tropsha: Mining protein family specific residue packing patterns from protein structure graphs. RECOMB 2004: 308-315 |

142 | EE | Deepak Bandyopadhyay, Jack Snoeyink: Almost-Delaunay simplices: nearest neighbor relations for imprecise points. SODA 2004: 410-419 |

141 | EE | 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) |

140 | EE | 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) |

139 | EE | Sergio Cabello, Yuanxin Liu, Andrea Mantler, Jack Snoeyink: Testing Homotopy for Paths in the Plane. Discrete & Computational Geometry 31(1): 61-81 (2004) |

138 | EE | Hee-Kap Ahn, Siu-Wing Cheng, Otfried Cheong, Jack Snoeyink: The reflex-free hull. Int. J. Comput. Geometry Appl. 14(6): 453-474 (2004) |

2003 | ||

137 | Michael J. Spriggs, J. Mark Keil, Sergei Bespamyatnikh, Michael Segal, Jack Snoeyink: Approximating the geometric minimum-diameter spanning tree. CCCG 2003: 39-42 | |

136 | EE | Martin Isenburg, Jack Snoeyink: Compressing Texture Coordinates with Selective Linear Predictions. Computer Graphics International 2003: 126-133 |

135 | Martin Isenburg, Peter Lindstrom, Stefan Gumhold, Jack Snoeyink: Large Mesh Simplification using Processing Sequences. IEEE Visualization 2003: 465-472 | |

134 | Hamish Carr, Jack Snoeyink: Path Seeds and Flexible Isosurfaces - Using Topology for Exploratory Visualization. VisSym 2003 | |

133 | EE | Martin Isenburg, Jack Snoeyink: Binary compression rates for ASCII formats. Web3D 2003: 173-178 |

132 | 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) | |

131 | Hamish Carr, Jack Snoeyink, Ulrike Axen: Computing contour trees in all dimensions. Comput. Geom. 24(2): 75-94 (2003) | |

130 | 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) | |

129 | 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) | |

128 | EE | 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) |

127 | EE | Joel Hass, Jack Snoeyink, William P. Thurston: The Size of Spanning Disks for Polygonal Curves. Discrete & Computational Geometry 29(1): 1-17 (2003) |

126 | EE | Tetsuo Asano, Mark de Berg, Otfried Cheong, Leonidas J. Guibas, Jack Snoeyink, Hisao Tamaki: Spanning Trees Crossing Few Barriers. Discrete & Computational Geometry 30(4): 591-606 (2003) |

2002 | ||

125 | EE | Martin Isenburg, Jack Snoeyink: Coding with ASCII: compact, yet text-based 3D content. 3DPVT 2002: 609-617 |

124 | EE | Sergio Cabello, Yuanxin Liu, Andrea Mantler, Jack Snoeyink: Testing Homotopy for paths in the plane. Symposium on Computational Geometry 2002: 160-169 |

123 | EE | Erik D. Demaine, Stefan Langerman, Joseph O'Rourke, Jack Snoeyink: Interlocked open linkages with few joints. Symposium on Computational Geometry 2002: 189-198 |

122 | EE | Martin Isenburg, Jack Snoeyink: Coding polygon meshes as compressable ASCII. Web3D 2002: 1-10 |

121 | EE | 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) |

120 | EE | 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) |

119 | EE | Prosenjit Bose, Ferran Hurtado, Elsa Omaña-Pulido, Jack Snoeyink, Godfried T. Toussaint: Some Aperture-Angle Optimization Problems. Algorithmica 33(4): 411-435 (2002) |

118 | EE | Martin Isenburg, Jack Snoeyink: Compressing the Property Mapping of Polygon Meshes. Graphical Models 64(2): 114-127 (2002) |

117 | David G. Kirkpatrick, Jack Snoeyink, Bettina Speckmann: Kinetic Collision Detection for Simple Polygons. Int. J. Comput. Geometry Appl. 12(1-2): 3-27 (2002) | |

116 | EE | J. Mark Keil, Jack Snoeyink: On the Time Bound for Convex Decomposition of Simple Polygons. Int. J. Comput. Geometry Appl. 12(3): 181-192 (2002) |

2001 | ||

115 | Adam L. Buchsbaum, Jack Snoeyink: Algorithm Engineering and Experimentation, Third International Workshop, ALENEX 2001, Washington, DC, USA, January 5-6, 2001, Revised Papers Springer 2001 | |

114 | EE | Andrea Mantler, Jack Snoeyink: Heaphull?. CCCG 2001: 129-131 |

113 | EE | Dana Randall, Günter Rote, Francisco Santos, Jack Snoeyink: Counting triangulations and pseudo-triangulations of wheels. CCCG 2001: 149-152 |

112 | EE | Jack Snoeyink: The arithmetic precision of ray-polygon intersection testing. CCCG 2001: 161-164 |

111 | EE | Hee-Kap Ahn, Siu-Wing Cheng, Otfried Cheong, Jack Snoeyink: The reflex-free hull. CCCG 2001: 9-12 |

110 | EE | Hamish Carr, Torsten Möller, Jack Snoeyink: Simplicial Subdivisions and Sampling Artifacts. IEEE Visualization 2001 |

109 | EE | Jack Snoeyink, Subhash Suri, George Varghese: A Lower Bound for Multicast Key Distribution. INFOCOM 2001: 422-431 |

108 | EE | Martin Isenburg, Jack Snoeyink: Compressing the Property Mapping of Polygon Meshes. Pacific Conference on Computer Graphics and Applications 2001: 4-11 |

107 | EE | Danny Z. Chen, Ovidiu Daescu, John Hershberger, Peter M. Kogge, Jack Snoeyink: Polygonal path approximation with angle constraints. SODA 2001: 342-343 |

106 | EE | Lutz Kettner, Jack Snoeyink: A prototype system for visualizing time-dependent volume data. Symposium on Computational Geometry 2001: 327-328 |

105 | EE | Christopher M. Gold, Jack Snoeyink: A One-Step Crust and Skeleton Extraction Algorithm. Algorithmica 30(2): 144-163 (2001) |

104 | Martin Isenburg, Jack Snoeyink: Spirale Reversi: Reverse decoding of the Edgebreaker encoding. Comput. Geom. 20(1-2): 39-52 (2001) | |

103 | Robert L. (Scot) Drysdale III, Scott A. McElfresh, Jack Snoeyink: On exclusion regions for optimal triangulations. Discrete Applied Mathematics 109(1-2): 49-65 (2001) | |

102 | EE | Bettina Speckmann, Jack Snoeyink: Easy triangle strips for TIN terrain models. International Journal of Geographical Information Science 15(4): 379-386 (2001) |

2000 | ||

101 | EE | Martin Isenburg, Jack Snoeyink: Spirale Reversi: Reverse Decoding of the Edgebreaker Encoding. CCCG 2000 |

100 | EE | Andrea Mantler, Jack Snoeyink: Intersecting Red and Blue Line Segments in Optimal Time and Precision. JCDCG 2000: 244-251 |

99 | EE | Martin Isenburg, Jack Snoeyink: Face fixer: compressing polygon meshes with properties. SIGGRAPH 2000: 263-270 |

98 | EE | Hamish Carr, Jack Snoeyink, Ulrike Axen: Computing contour trees in all dimensions. SODA 2000: 918-926 |

97 | EE | Leonidas J. Guibas, Jack Snoeyink, Li Zhang: Compact Voronoi Diagrams for Moving Convex Polygons. SWAT 2000: 339-352 |

96 | EE | David G. Kirkpatrick, Jack Snoeyink, Bettina Speckmann: Kinetic collision detection for simple polygons. Symposium on Computational Geometry 2000: 322-330 |

95 | EE | Martin Isenburg, Jack Snoeyink: The face fixer video. Symposium on Computational Geometry 2000: 377-378 |

94 | Sergei Bespamyatnikh, Jack Snoeyink: Queries with segments in Voronoi diagrams. Comput. Geom. 16(1): 23-33 (2000) | |

93 | Jean-Daniel Boissonnat, Jack Snoeyink: Efficient algorithms for line and curve segment intersection using restricted predicates. Comput. Geom. 16(1): 35-52 (2000) | |

92 | EE | Sergei Bespamyatnikh, David G. Kirkpatrick, Jack Snoeyink: Generalizing Ham Sandwich Cuts to Equitable Subdivisions. Discrete & Computational Geometry 24(4): 605-622 (2000) |

91 | EE | Pierre Alliez, Olivier Devillers, Jack Snoeyink: Removing Degeneracies by Perturbing the Problem or Perturbing the World. Reliable Computing 6(1): 61-79 (2000) |

1999 | ||

90 | EE | Robert J. Walker, Jack Snoeyink: Practical Point-in-Polygon Tests Using CSG Representations of Polygons. ALENEX 1999: 114-123 |

89 | EE | Martin Isenburg, Jack Snoeyink: Mesh Collapse Compression. SIBGRAPI 1999: 27-28 |

88 | EE | Sergei Bespamyatnikh, Jack Snoeyink: Queries with Segments in Voronoi Diagrams. SODA 1999: 122-129 |

87 | EE | Marc J. van Kreveld, Joseph S. B. Mitchell, Peter Rousseeuw, Micha Sharir, Jack Snoeyink, Bettina Speckmann: Efficient Algorithms for Maximum Regression Depth. Symposium on Computational Geometry 1999: 31-40 |

86 | EE | Jean-Daniel Boissonnat, Jack Snoeyink: Efficient Algorithms for Line and Curve Segment Intersection Using Restricted Predicates. Symposium on Computational Geometry 1999: 370-379 |

85 | EE | Tetsuo Asano, Mark de Berg, Otfried Cheong, Leonidas J. Guibas, Jack Snoeyink, Hisao Tamaki: Spanning Trees Crossing Few Barriers. Symposium on Computational Geometry 1999: 41-48 |

84 | EE | Martin Isenburg, Jack Snoeyink: Mesh Collapse Compression. Symposium on Computational Geometry 1999: 419-420 |

83 | EE | Sergei Bespamyatnikh, David G. Kirkpatrick, Jack Snoeyink: Generalizing Ham Sandwich Cuts to Equitable Subdivisions. Symposium on Computational Geometry 1999: 49-58 |

82 | EE | Marshall W. Bern, Erik D. Demaine, David Eppstein, Eric Kuo, Andrea Mantler, Jack Snoeyink: Ununfoldable Polyhedra with Convex Faces CoRR cs.CG/9908003: (1999) |

81 | EE | 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: Emerging Challenges in Computational Topology CoRR cs.CG/9909001: (1999) |

80 | Simon Kahan, Jack Snoeyink: On the bit complexity of minimum link paths: Superquadratic algorithms for problem solvable in linear time. Comput. Geom. 12(1-2): 33-44 (1999) | |

79 | EE | Francis Y. L. Chin, Jack Snoeyink, Cao An Wang: Finding the Medial Axis of a Simple Polygon in Linear Time. Discrete & Computational Geometry 21(3): 405-420 (1999) |

78 | EE | Jack Snoeyink: Cross-Ratios and Angles Determine a Polygon. Discrete & Computational Geometry 22(4): 619-631 (1999) |

77 | David G. Kirkpatrick, Jack Snoeyink: Computing Constrained Shortest Segments: Butterfly Wingspans in Logarithmic Time. Int. J. Comput. Geometry Appl. 9(1): 53- (1999) | |

1998 | ||

76 | EE | J. Mark Keil, Jack Snoeyink: On the time bound for convex decomposition of simple polygons. CCCG 1998 |

75 | EE | Pierre Alliez, Olivier Devillers, Jack Snoeyink: Removing degeneracies by perturbing the problem or perturbing the world. CCCG 1998 |

74 | EE | Jack Snoeyink: Cross-Ratios and Angles Determine a Polygon. Symposium on Computational Geometry 1998: 49-57 |

73 | EE | Ronald Beirouti, Jack Snoeyink: Implementations of the LMT Heuristic for Minimum Weight Triangulation. Symposium on Computational Geometry 1998: 96-105 |

72 | John Hershberger, Jack Snoeyink: Cartographic line simplification and polygon CSG formulæ in O(nlog * n) time. Comput. Geom. 11(3-4): 175-185 (1998) | |

71 | John Hershberger, Jack Snoeyink: Erased arrangements of lines and convex decompositions of polyhedra. Comput. Geom. 9(3): 129-143 (1998) | |

70 | EE | Jesus Garcia-Lopez, Pedro A. Ramos, Jack Snoeyink: Fitting a Set of Points by a Circle. Discrete & Computational Geometry 20(3): 389-402 (1998) |

1997 | ||

69 | Bettina Speckmann, Jack Snoeyink: Easy triangle strips for tin terrain models. CCCG 1997 | |

68 | EE | Jack Snoeyink, Marc J. van Kreveld: Linear-Time Reconstruction of Delaunay Triangulations with Applications. ESA 1997: 459-471 |

67 | EE | Jack Snoeyink, Marc J. van Kreveld: Good Orders for Incremental (Re)construction. Symposium on Computational Geometry 1997: 400-402 |

66 | John Hershberger, Jack Snoeyink: Cartographic Line Simplification and Polygon CSG Formulae and in O(n log* n) Time. WADS 1997: 93-103 | |

65 | EE | Timothy M. Chan, Jack Snoeyink, Chee-Keng Yap: Primal Dividing and Dual Pruning: Output-Sensitive Construction of Four-Dimensional Polytopes and Three-Dimensional Voronoi Diagrams. Discrete & Computational Geometry 18(4): 433-454 (1997) |

64 | EE | Prosenjit Bose, Michael McAllister, Jack Snoeyink: Optimal Algorithms to Embed Trees in a Point Set. J. Graph Algorithms Appl. 1: (1997) |

1996 | ||

63 | Prosenjit Bose, William S. Evans, David G. Kirkpatrick, Michael McAllister, Jack Snoeyink: Approximating Shortest Paths in Arrangements of Lines. CCCG 1996: 143-148 | |

62 | Mark de Berg, Prosenjit Bose, Katrin Dobrindt, Marc J. van Kreveld, Mark H. Overmars, Marko de Groot, Thomas Roos, Jack Snoeyink, Sidi Yu: The Complexity of Rivers in Triangulated Terrains. CCCG 1996: 325-330 | |

61 | EE | Simon Kahan, Jack Snoeyink: On the Bit Complexity of Minimum Link Paths: Superquadratic Algorithms for Problems Solvable in Linear Time. Symposium on Computational Geometry 1996: 151-158 |

60 | EE | David Avis, Prosenjit Bose, Godfried T. Toussaint, Thomas C. Shermer, Binhai Zhu, Jack Snoeyink: On the Sectional Area of Convex Polytopes. Symposium on Computational Geometry 1996: C-11-C-12 |

59 | EE | Patrice Belleville, J. Mark Keil, Michael McAllister, Jack Snoeyink: On Computing Edges That Are In All Minimum-Weight Triangulations. Symposium on Computational Geometry 1996: V-7-V-8 |

58 | Mark de Berg, Marc J. van Kreveld, Otfried Schwarzkopf, Jack Snoeyink: Point Location in Zones of K-flats in Arrangements. Comput. Geom. 6: 131-143 (1996) | |

57 | Zhu Chong, Gopalakrishnan Sundaram, Jack Snoeyink, Joseph S. B. Mitchell: Generating Random Polygons with Given Vertices. Comput. Geom. 6: 277-290 (1996) | |

56 | EE | Michael McAllister, David G. Kirkpatrick, Jack Snoeyink: A Compact Piecewise-Linear Voronoi Diagram for Convex Sites in the Plane. Discrete & Computational Geometry 15(1): 73-105 (1996) |

55 | EE | Marc J. van Kreveld, Jack Snoeyink, Sue Whitesides: Folding Rulers Inside Triangles. Discrete & Computational Geometry 15(3): 265-285 (1996) |

54 | Joseph Friedman, John Hershberger, Jack Snoeyink: Efficiently Planning Compliant Motion in the Plane. SIAM J. Comput. 25(3): 562-599 (1996) | |

1995 | ||

53 | Prosenjit Bose, Michael McAllister, Jack Snoeyink: Optimal Algorithms to Embed Trees in a Point Set. Graph Drawing 1995: 64-75 | |

52 | EE | Francis Y. L. Chin, Jack Snoeyink, Cao An Wang: Finding the Medial Axis of a Simple Polygon in Linear Time. ISAAC 1995: 382-391 |

51 | Timothy M. Chan, Jack Snoeyink, Chee-Keng Yap: Output-Sensitive Construction of Polytopes in Four Dimensions and Clipped Voronoi Diagrams in Three. SODA 1995: 282-291 | |

50 | EE | D. S. Andrews, Jack Snoeyink: Geometry in GIS is not Combinatorial: Segment Intersection for Polygon Overlay. Symposium on Computational Geometry 1995: C24-C25 |

49 | David G. Kirkpatrick, Jack Snoeyink: Computing Common Tangents Without a Separating Line. WADS 1995: 183-193 | |

48 | David G. Kirkpatrick, Jack Snoeyink: Tentative Prune-and-Search for Computing Fixed-Points with Applications to Geometric Computation. Fundam. Inform. 22(4): 353-370 (1995) | |

47 | Mark de Berg, Marc J. van Kreveld, Jack Snoeyink: Two- and Three-Dimensional Point Location in Rectangular Subdivisions. J. Algorithms 18(2): 256-277 (1995) | |

1994 | ||

46 | John Hershberger, Jack Snoeyink: An Efficient Solution to the Zookeeper's Problem. CCCG 1994: 104-109 | |

45 | Chong Zhu, Gopalakrishnan Sundaram, Jack Snoeyink, Joseph S. B. Mitchell: Generating Random x-Monotone Polygons with Given Vertices. CCCG 1994: 189-194 | |

44 | EE | John Hershberger, Jack Snoeyink: An O(n log n) Implementation of the Douglas-Peucker Algorithm for Line Simplification. Symposium on Computational Geometry 1994: 383-384 |

43 | Christian Schwarz, Michiel H. M. Smid, Jack Snoeyink: An Optimal Algorithm for the On-Line Closest-Pair Problem. Algorithmica 12(1): 18-29 (1994) | |

42 | Mark de Berg, Dan Halperin, Mark H. Overmars, Jack Snoeyink, Marc J. van Kreveld: Efficient Ray Shooting and Hidden Surface Removal. Algorithmica 12(1): 30-53 (1994) | |

41 | Bernard Chazelle, Herbert Edelsbrunner, Michelangelo Grigni, Leonidas J. Guibas, John Hershberger, Micha Sharir, Jack Snoeyink: Ray Shooting in Polygons Using Geodesic Triangulations. Algorithmica 12(1): 54-68 (1994) | |

40 | Larry Palazzi, Jack Snoeyink: Counting and Reporting Red/Blue Segment Intersections. CVGIP: Graphical Model and Image Processing 56(4): 304-310 (1994) | |

39 | John Hershberger, Jack Snoeyink: Computing Minimum Length Paths of a Given Homotopy Class. Comput. Geom. 4: 63-97 (1994) | |

38 | Jack Snoeyink, Jorge Stolfi: Objects that Cannot Be Taken Apart with Two Hands. Discrete & Computational Geometry 12: 367-384 (1994) | |

37 | John Adegeest, Mark H. Overmars, Jack Snoeyink: Minimum-link C-oriented paths: Single-source queries. Int. J. Comput. Geometry Appl. 4(1): 39-51 (1994) | |

1993 | ||

36 | Marc J. van Kreveld, Jack Snoeyink, Sue Whitesides: Folding Rulers inside Triangles. CCCG 1993: 1-6 | |

35 | David G. Kirkpatrick, Jack Snoeyink: Computing Constrained Shortest Segments: Butterfly Wingspans in Logarithmic Time. CCCG 1993: 163-168 | |

34 | Günter Rote, Christian Schwarz, Jack Snoeyink: Maintaining the Approximate Width of a Set of Points in the Plane. CCCG 1993: 258-263 | |

33 | Michael McAllister, Jack Snoeyink: Two-dimensional Computation of the Three-dimensional Reachable Region for a Welding Head. CCCG 1993: 437-442 | |

32 | Michael McAllister, David G. Kirkpatrick, Jack Snoeyink: A Compact Piecewise-Linear Voronoi Diagram for Convex Sites in the Plane FOCS 1993: 573-582 | |

31 | EE | David G. Kirkpatrick, Jack Snoeyink: Tentative Prune-and-Search for Computing Voronoi Vertices. Symposium on Computational Geometry 1993: 133-142 |

30 | EE | Jack Snoeyink, Jorge Stolfi: Objects That Cannot be Taken Apart with Two Hands. Symposium on Computational Geometry 1993: 247-256 |

29 | EE | Jack Snoeyink: Video: Objects that Cannot be Taken Apart with Two Hands. Symposium on Computational Geometry 1993: 405 |

28 | Larry Palazzi, Jack Snoeyink: Counting and Reporting Red/Blue Segment Intersections. WADS 1993: 530-540 | |

27 | David P. Dobkin, Leonidas J. Guibas, John Hershberger, Jack Snoeyink: An Efficient Algorithm for Finding the CSG Representation of a Simple Polygon. Algorithmica 10(1): 1-23 (1993) | |

26 | Leonidas J. Guibas, John Hershberger, Joseph S. B. Mitchell, Jack Snoeyink: Approximating Polygons and Subdivisions with Minimum Link Paths. Int. J. Comput. Geometry Appl. 3(4): 383-415 (1993) | |

25 | Bernard Chazelle, Herbert Edelsbrunner, Leonidas J. Guibas, Micha Sharir, Jack Snoeyink: Computing a Face in an Arrangement of Line Segments and Related Problems. SIAM J. Comput. 22(6): 1286-1302 (1993) | |

1992 | ||

24 | EE | Eric Guévremont, Jack Snoeyink: Recognizing an Envelope of Lines in Linear Time. ISAAC 1992: 370-377 |

23 | EE | Mark de Berg, Marc J. van Kreveld, Jack Snoeyink: Two- and Three-Dimensional Point Location in Rectangular Subdivisions (Extended Abstract). SWAT 1992: 352-363 |

22 | EE | John Hershberger, Jack Snoeyink: Convex Polygons Made from Few Lines and Convex Decompositions of Polyhedra. SWAT 1992: 376-387 |

21 | EE | Christian Schwarz, Michiel H. M. Smid, Jack Snoeyink: An Optimal Algorithm for the On-Line Closest-Pair Problem. Symposium on Computational Geometry 1992: 330-336 |

1991 | ||

20 | EE | Bernard Chazelle, Herbert Edelsbrunner, Michelangelo Grigni, Leonidas J. Guibas, John Hershberger, Micha Sharir, Jack Snoeyink: Ray Shooting in Polygons Using Geodesic Triangulations. ICALP 1991: 661-646 |

19 | Leonidas J. Guibas, John Hershberger, Joseph S. B. Mitchell, Jack Snoeyink: Approximating Polygons and Subdivisions with Minimum Link Paths. ISA 1991: 151-162 | |

18 | Bernard Chazelle, Herbert Edelsbrunner, Leonidas J. Guibas, Micha Sharir, Jack Snoeyink: Computing a Face in an Arrangement of Line Segments. SODA 1991: 441-448 | |

17 | EE | Mark de Berg, Dan Halperin, Mark H. Overmars, Jack Snoeyink, Marc J. van Kreveld: Efficient Ray Shooting and Hidden Surface Removal. Symposium on Computational Geometry 1991: 21-30 |

16 | John Hershberger, Jack Snoeyink: Computing Minimum Length Paths of a Given Homotopy Class (Extended Abstract). WADS 1991: 331-342 | |

15 | Bernard Chazelle, Herbert Edelsbrunner, Leonidas J. Guibas, Richard Pollack, Raimund Seidel, Micha Sharir, Jack Snoeyink: Counting and Cutting Cycles of Lines and Rods in Space. Comput. Geom. 1: 305-323 (1991) | |

14 | Leonidas J. Guibas, John Hershberger, Jack Snoeyink: Compact interval trees: a data structure for convex hulls. Int. J. Comput. Geometry Appl. 1(1): 1-22 (1991) | |

1990 | ||

13 | Bernard Chazelle, Herbert Edelsbrunner, Leonidas J. Guibas, Richard Pollack, Raimund Seidel, Micha Sharir, Jack Snoeyink: Counting and Cutting Cycles of Lines and Rods in Space FOCS 1990: 242-251 | |

12 | Leonidas J. Guibas, John Hershberger, Jack Snoeyink: Compact Interval Trees: A Data Structure for Convex Hulls. SODA 1990: 169-178 | |

11 | EE | Joseph Friedman, John Hershberger, Jack Snoeyink: Input-Sensitive Compliant Motion in the Plane. SWAT 1990: 225-237 |

10 | EE | Jack Snoeyink: A Trivial Knot Whose Spanning Disks Have Exponential Size. Symposium on Computational Geometry 1990: 139-147 |

9 | Michael T. Goodrich, Jack Snoeyink: Stabbing Parallel Segments with a Convex Polygon. Computer Vision, Graphics, and Image Processing 49(2): 152-170 (1990) | |

1989 | ||

8 | EE | Joseph Friedman, John Hershberger, Jack Snoeyink: Compliant Motion in a Simple Polygon. Symposium on Computational Geometry 1989: 175-186 |

7 | EE | Jack Snoeyink, John Hershberger: Sweeping Arrangements of Curves. Symposium on Computational Geometry 1989: 354-363 |

6 | Michael T. Goodrich, Jack Snoeyink: Stabbing Parallel Segments with a Convex Polygon (Extended Abstract). WADS 1989: 231-242 | |

5 | Herbert Edelsbrunner, Leonidas J. Guibas, John Hershberger, Raimund Seidel, Micha Sharir, Jack Snoeyink, Emo Welzl: Implicitly Representing Arrangements of Lines or Segments. Discrete & Computational Geometry 4: 433-466 (1989) | |

4 | Herbert Edelsbrunner, Leonidas J. Guibas, John Hershberger, János Pach, Richard Pollack, Raimund Seidel, Micha Sharir, Jack Snoeyink: On Arrangement of Jordan Arcs with Three Intersection per Pair. Discrete & Computational Geometry 4: 523-539 (1989) | |

1988 | ||

3 | EE | David P. Dobkin, Leonidas J. Guibas, John Hershberger, Jack Snoeyink: An efficient algorithm for finding the CSG representation of a simple polygon. SIGGRAPH 1988: 31-40 |

2 | EE | Herbert Edelsbrunner, Leonidas J. Guibas, John Hershberger, János Pach, Richard Pollack, Raimund Seidel, Micha Sharir, Jack Snoeyink: On Arrangements of Jordan Arcs with Three Intersections per Pair. Symposium on Computational Geometry 1988: 258-265 |

1 | EE | Herbert Edelsbrunner, Leonidas J. Guibas, John Hershberger, Raimund Seidel, Micha Sharir, Jack Snoeyink, Emo Welzl: Implicitly Representing Arrangements of Lines or Segments. Symposium on Computational Geometry 1988: 56-69 |