| Year |
Citation |
Score |
| 2021 |
Bhattacharya B, Bishnu A, Cheong O, Das S, Karmakar A, Snoeyink J. Computation of spatial skyline points Computational Geometry: Theory and Applications. 93: 101698. DOI: 10.1016/J.Comgeo.2020.101698 |
0.301 |
|
| 2015 |
O'Meara MJ, Leaver-Fay A, Tyka M, Stein A, Houlihan K, DiMaio F, Bradley P, Kortemme T, Baker D, Snoeyink J, Kuhlman B. A Combined Covalent-Electrostatic Model of Hydrogen Bonding Improves Structure Prediction with Rosetta. Journal of Chemical Theory and Computation. 11: 609-622. PMID 25866491 DOI: 10.1021/Ct500864R |
0.707 |
|
| 2014 |
Abel ZR, Demaine ED, Demaine ML, Ito H, Snoeyink J, Uehara R. Bumpy pyramid folding 26th Canadian Conference On Computational Geometry, Cccg 2014. 258-266. DOI: 10.1016/J.Comgeo.2018.06.007 |
0.352 |
|
| 2014 |
Lubiw A, Snoeyink J, Vosoughpour H. Visibility graphs, dismantlability, and the cops and robbers game 26th Canadian Conference On Computational Geometry, Cccg 2014. 355-366. DOI: 10.1016/J.Comgeo.2017.07.001 |
0.304 |
|
| 2013 |
Leaver-Fay A, O'Meara MJ, Tyka M, Jacak R, Song Y, Kellogg EH, Thompson J, Davis IW, Pache RA, Lyskov S, Gray JJ, Kortemme T, Richardson JS, Havranek JJ, Snoeyink J, et al. Scientific benchmarks for guiding macromolecular energy function improvement. Methods in Enzymology. 523: 109-43. PMID 23422428 DOI: 10.1016/B978-0-12-394292-0.00006-0 |
0.689 |
|
| 2012 |
Millman DL, Love S, Chan TM, Snoeyink J. Computing the nearest neighbor transform exactly with only double precision Proceedings of the 2012 9th International Symposium On Voronoi Diagrams in Science and Engineering, Isvd 2012. 66-74. DOI: 10.1109/ISVD.2012.13 |
0.738 |
|
| 2012 |
Millman DL, Griesheimer DP, Nease BR, Snoeyink J. Robust volume calculations for Constructive Solid Geometry (CSG) components in Monte Carlo transport calculations International Conference On the Physics of Reactors 2012, Physor 2012: Advances in Reactor Physics. 1: 826-841. |
0.732 |
|
| 2011 |
Biedl T, Durocher S, Snoeyink J. Reconstructing polygons from scanner data Theoretical Computer Science. 412: 4161-4172. DOI: 10.1016/J.Tcs.2010.10.026 |
0.323 |
|
| 2010 |
Bandyopadhyay D, Huan J, Liu J, Prins J, Snoeyink J, Wang W, Tropsha A. Functional neighbors: inferring relationships between nonhomologous protein families using family-specific packing motifs. Ieee Transactions On Information Technology in Biomedicine : a Publication of the Ieee Engineering in Medicine and Biology Society. 14: 1137-43. PMID 20570776 DOI: 10.1109/TITB.2010.2053550 |
0.473 |
|
| 2010 |
Millman DL, Snoeyink J. Computing planar Voronoi diagrams in double precision: A further example of degree-driven algorithm design Proceedings of the Annual Symposium On Computational Geometry. 386-392. DOI: 10.1145/1810959.1811024 |
0.731 |
|
| 2010 |
Löffler M, Snoeyink J. Delaunay triangulation of imprecise points in linear time after preprocessing Computational Geometry: Theory and Applications. 43: 234-242. DOI: 10.1016/J.Comgeo.2008.12.007 |
0.414 |
|
| 2010 |
O'meara M, Millman DL, Snoeyink J, Verma V. Maximum geodesic routing in the plane with obstacles Proceedings of the 22nd Annual Canadian Conference On Computational Geometry, Cccg 2010. 107-108. |
0.698 |
|
| 2009 |
Bandyopadhyay D, Huan J, Prins J, Snoeyink J, Wang W, Tropsha A. Identification of family-specific residue packing motifs and their use for structure-based protein function prediction: II. Case studies and applications. Journal of Computer-Aided Molecular Design. 23: 785-97. PMID 19548090 DOI: 10.1007/S10822-009-9277-0 |
0.551 |
|
| 2009 |
Bandyopadhyay D, Huan J, Prins J, Snoeyink J, Wang W, Tropsha A. Identification of family-specific residue packing motifs and their use for structure-based protein function prediction: I. Method development. Journal of Computer-Aided Molecular Design. 23: 773-84. PMID 19543979 DOI: 10.1007/S10822-009-9273-4 |
0.536 |
|
| 2009 |
Millman DL, Snoeyink J. Computing the implicit voronoi diagram in triple precision Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 5664: 495-506. DOI: 10.1007/978-3-642-03367-4_43 |
0.716 |
|
| 2008 |
Wang X, Snoeyink J. Defining and computing optimum RMSD for gapped and weighted multiple-structure alignment. Ieee/Acm Transactions On Computational Biology and Bioinformatics / Ieee, Acm. 5: 525-33. PMID 18989040 DOI: 10.1109/Tcbb.2008.92 |
0.508 |
|
| 2008 |
Wang X, Kapral G, Murray L, Richardson D, Richardson J, Snoeyink J. RNABC: forward kinematics to reduce all-atom steric clashes in RNA backbone. Journal of Mathematical Biology. 56: 253-78. PMID 17401565 DOI: 10.1007/S00285-007-0082-X |
0.486 |
|
| 2008 |
Leaver-Fay A, Liu Y, Snoeyink J, Wang X. Faster placement of hydrogens in protein structures by dynamic programming Journal of Experimental Algorithmics. 12. DOI: 10.1145/1227161.1227167 |
0.634 |
|
| 2008 |
Liu Y, Snoeyink J. Faraway point: A sentinel point for delaunay computation International Journal of Computational Geometry and Applications. 18: 343-355. DOI: 10.1142/S0218195908002660 |
0.574 |
|
| 2008 |
Bandyopadhyay D, Huan J, Liu J, Prins J, Snoeyink J, Wang W, Tropsha A. Functional neighbors: Inferring relationships between non-homologous protein families using family-specific packing motifs Proceedings - Ieee International Conference On Bioinformatics and Biomedicine, Bibm 2008. 199-206. DOI: 10.1109/BIBM.2008.84 |
0.473 |
|
| 2008 |
Arkin EM, Mitchell JSB, Snoeyink J. Capturing crossings: Convex hulls of segment and plane intersections Information Processing Letters. 107: 194-197. DOI: 10.1016/J.Ipl.2008.03.024 |
0.323 |
|
| 2008 |
Edelsbrunner H, Harer J, Mascarenhas A, Pascucci V, Snoeyink J. Time-varying Reeb graphs for continuous space-time data Computational Geometry: Theory and Applications. 41: 149-166. DOI: 10.1016/J.Comgeo.2007.11.001 |
0.751 |
|
| 2008 |
Van Kreveld M, Mitchell JSB, Rousseeuw P, Sharir M, Snoeyink J, Speckmann B. Efficient algorithms for maximum regression depth Discrete and Computational Geometry. 39: 656-677. DOI: 10.1007/S00454-007-9046-6 |
0.377 |
|
| 2008 |
Reinbacher I, Benkert M, Van Kreveld M, Mitchell JSB, Snoeyink J, Wolff A. Delineating boundaries for imprecise regions Algorithmica (New York). 50: 386-414. DOI: 10.1007/S00453-007-9042-5 |
0.329 |
|
| 2008 |
Leaver-Fay A, Snoeyink J, Kuhlman B. On-the-fly rotamer pair energy evaluation in protein design Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 4983: 343-354. DOI: 10.1007/978-3-540-79450-9_32 |
0.451 |
|
| 2007 |
Davis IW, Leaver-Fay A, Chen VB, Block JN, Kapral GJ, Wang X, Murray LW, Arendall WB, Snoeyink J, Richardson JS, Richardson DC. MolProbity: all-atom contacts and structure validation for proteins and nucleic acids. Nucleic Acids Research. 35: W375-83. PMID 17452350 DOI: 10.1093/Nar/Gkm216 |
0.502 |
|
| 2007 |
Leaver-Fay A, Butterfoss GL, Snoeyink J, Kuhlman B. Maintaining solvent accessible surface area under rotamer substitution for protein design. Journal of Computational Chemistry. 28: 1336-41. PMID 17285560 DOI: 10.1002/Jcc.20626 |
0.573 |
|
| 2007 |
Wang X, Huan J, Snoeyink JS, Wang W. Mining RNA tertiary motifs with structure graphs Proceedings of the International Conference On Scientific and Statistical Database Management, Ssdbm. DOI: 10.1109/SSDBM.2007.38 |
0.431 |
|
| 2007 |
Bandyopadhyay D, Snoeyink J. Almost-Delaunay simplices: Robust neighbor relations for imprecise 3D points using CGAL Computational Geometry: Theory and Applications. 38: 4-15. DOI: 10.1016/J.Comgeo.2006.11.003 |
0.594 |
|
| 2007 |
Snoeyink J. Maximum independent set for intervals by divide and conquer with pruning Networks. 49: 158-159. DOI: 10.1002/Net.V49:2 |
0.329 |
|
| 2007 |
Wang X, Snoeyink J. Defining and computing optimum RMSD for gapped multiple structure alignment Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 4645: 196-207. |
0.466 |
|
| 2006 |
Huan J, Bandyopadhyay D, Prins J, Snoeyink J, Tropsha A, Wang W. Distance-based identification of structure motifs in proteins using constrained frequent subgraph mining. Computational Systems Bioinformatics / Life Sciences Society. Computational Systems Bioinformatics Conference. 227-38. PMID 17369641 |
0.529 |
|
| 2006 |
Wang X, Snoeyink J. Multiple structure alignment by optimal RMSD implies that the average structure is a consensus. Computational Systems Bioinformatics / Life Sciences Society. Computational Systems Bioinformatics Conference. 79-87. PMID 17369627 |
0.477 |
|
| 2006 |
Bandyopadhyay D, Huan J, Liu J, Prins J, Snoeyink J, Wang W, Tropsha A. Structure-based function inference using protein family-specific fingerprints. Protein Science : a Publication of the Protein Society. 15: 1537-43. PMID 16731985 DOI: 10.1110/Ps.062189906 |
0.49 |
|
| 2006 |
Isenburg M, Liu Y, Shewchuk J, Snoeyink J. Streaming computation of Delaunay triangulations Acm Siggraph 2006 Papers, Siggraph '06. 1049-1056. DOI: 10.1145/1179352.1141992 |
0.691 |
|
| 2006 |
Boissonnat JD, Snoeyink J. Discrete and Computational Geometry: Guest editors' foreword Discrete and Computational Geometry. 36: 501-502. DOI: 10.1007/S00454-006-1261-Z |
0.315 |
|
| 2006 |
Isenburg M, Liu Y, Shewchuk J, Snoeyink J, Thirion T. Generating raster DEM from mass points via TIN streaming Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 4197: 186-198. |
0.641 |
|
| 2006 |
Isenburg M, Liu Y, Shewchuk J, Snoeyink J. Illustrating the streaming construction of 2D delaunay triangulations Proceedings of the Annual Symposium On Computational Geometry. 2006: 481-482. |
0.61 |
|
| 2006 |
Isenburg M, Snoeyink J. Early-split coding of triangle mesh connectivity Proceedings - Graphics Interface. 2006: 89-97. |
0.629 |
|
| 2005 |
Huan J, Bandyopadhyay D, Wang W, Snoeyink J, Prins J, Tropsha A. Comparing graph representations of protein structure for mining family-specific residue-based packing motifs. Journal of Computational Biology : a Journal of Computational Molecular Cell Biology. 12: 657-71. PMID 16108709 DOI: 10.1089/Cmb.2005.12.657 |
0.58 |
|
| 2005 |
Leaver-Fay A, Kuhlman B, Snoeyink J. An adaptive dynamic programming algorithm for the side chain placement problem. Pacific Symposium On Biocomputing. Pacific Symposium On Biocomputing. 16-27. PMID 15759610 |
0.504 |
|
| 2005 |
Isenburg M, Lindstrom P, Snoeyink J. Streaming compression of triangle meshes Acm Siggraph 2005 Sketches, Siggraph 2005. 136. DOI: 10.1145/1187112.1187276 |
0.638 |
|
| 2005 |
Brönnimann H, Kettner L, Pocchiola M, Snoeyink J. Counting and enumerating pointed pseudo-triangulations with the greedy flip algorithm Proceedings of the Seventh Workshop On Algorithm Engineering and Experiments and the Second Workshop On Analytic Algorithms and Combinatorics. 98-110. DOI: 10.1137/050631008 |
0.374 |
|
| 2005 |
Chen DZ, Daescu O, Hershberger J, Kogge PM, Mi N, Snoeyink J. Polygonal path simplification with angle constraints Computational Geometry: Theory and Applications. 32: 173-187. DOI: 10.1016/J.Comgeo.2004.09.003 |
0.345 |
|
| 2005 |
Isenburg M, Lindstrom P, Snoeyink J. Lossless compression of predicted floating-point geometry Cad Computer Aided Design. 37: 869-877. DOI: 10.1016/J.Cad.2004.09.015 |
0.695 |
|
| 2005 |
Leaver-Fay A, Kuhlman B, Snoeyink J. Rotamer-pair energy calculations using a trie data structure Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 3692: 389-400. DOI: 10.1007/11557067_32 |
0.473 |
|
| 2004 |
Mascarenhas A, Isenburg M, Pascucci V, Snoeyink J. Encoding volumetric grids for streaming isosurface extraction Proceedings - 2nd International Symposium On 3d Data Processing, Visualization, and Transmission. 3dpvt 2004. 665-672. DOI: 10.1109/TDPVT.2004.1335302 |
0.651 |
|
| 2004 |
Isenburg M, Lindstrom P, Snoeyink J. Lossless compression of floating-point geometry Computer-Aided Design and Applications. 1: 495-502. DOI: 10.1080/16864360.2004.10738292 |
0.698 |
|
| 2004 |
Spriggs MJ, Keil JM, Bespamyatnikh S, Segal M, Snoeyink J. Computing a (1+ε)-approximate geometric minimum-diameter spanning tree Algorithmica (New York). 38: 577-589. DOI: 10.1007/S00453-003-1056-Z |
0.394 |
|
| 2004 |
Huan J, Wang W, Bandyopadhyay D, Snoeyink J, Prins J, Tropsha A. Mining protein family specific residue packing patterns from protein structure graphs Proceedings of the Annual International Conference On Computational Molecular Biology, Recomb. 8: 308-315. |
0.531 |
|
| 2003 |
Isenburg M, Lindstrom P, Gumhold S, Snoeyink J. Large Mesh Simplification using Processing Sequences Proceedings of the Ieee Visualization Conference. 465-472. DOI: 10.1109/VISUAL.2003.1250408 |
0.67 |
|
| 2003 |
Isenburg M, Snoeyink J. Compressing texture coordinates with selective linear predictions Proceedings of Computer Graphics International Conference, Cgi. 2003: 126-131. DOI: 10.1109/CGI.2003.1214457 |
0.64 |
|
| 2003 |
Isenburg M, Snoeyink J. Binary compression rates for ASCII formats Web3d Symposium Proceedings. |
0.662 |
|
| 2002 |
Isenburg M, Snoeyink J. Coding polygon meshes as compressable ASCII Proceedings of the 7th International Conference On 3d Web Technology, Web3d '02. 1-10. DOI: 10.1145/504502.504503 |
0.673 |
|
| 2002 |
Isenburg M, Snoeyink J. Coding with ASCII: Compact, yet text-based 3D content Proceedings - 1st International Symposium On 3d Data Processing Visualization and Transmission, 3dpvt 2002. 609-616. DOI: 10.1109/TDPVT.2002.1024125 |
0.668 |
|
| 2002 |
Cabello S, Liu Y, Mantler A, Snoeyink J. Testing homotopy for paths in the plane Proceedings of the Annual Symposium On Computational Geometry. 160-169. DOI: 10.1007/S00454-003-2949-Y |
0.499 |
|
| 2002 |
Barequet G, Chen DZ, Daescu O, Goodrich MT, Snoeyink J. Efficiently Approximating Polygonal Paths in Three and Higher Dimensions Algorithmica. 33: 150-167. DOI: 10.1007/S00453-001-0096-5 |
0.321 |
|
| 2001 |
Isenburg M, Snoeyink J. Compressing the property mapping of polygon meshes Proceedings - Pacific Conference On Computer Graphics and Applications. 2001: 4-11. DOI: 10.1109/PCCGA.2001.962852 |
0.642 |
|
| 2001 |
Isenburg M, Snoeyink J. Spirale Reversi: Reverse decoding of the Edgebreaker encoding Computational Geometry: Theory and Applications. 20: 39-52. DOI: 10.1016/S0925-7721(01)00034-7 |
0.694 |
|
| 2001 |
Gold C, Snoeyink J. A one-step crust and skeleton extraction algorithm Algorithmica (New York). 30: 144-163. DOI: 10.1007/S00453-001-0014-X |
0.315 |
|
| 2000 |
Alliez P, Devillers O, Snoeyink J. Removing Degeneracies by Perturbing the Problem or Perturbing the World Reliable Computing. 6: 61-79. DOI: 10.1023/A:1009942427413 |
0.319 |
|
| 2000 |
Boissonnat JD, Snoeyink J. Efficient algorithms for line and curve segment intersection using restricted predicates Computational Geometry: Theory and Applications. 16: 35-52. DOI: 10.1016/S0925-7721(99)00057-7 |
0.353 |
|
| 2000 |
Bespamyatnikh S, Snoeyink J. Queries with segments in Voronoi diagrams Computational Geometry: Theory and Applications. 16: 23-33. DOI: 10.1016/S0925-7721(99)00055-3 |
0.316 |
|
| 2000 |
Bespamyatnikh S, Kirkpatrick D, Snoeyink J. Generalizing Ham Sandwich Cuts to Equitable Subdivisions Discrete and Computational Geometry. 24: 605-622. DOI: 10.1007/S4540010065 |
0.335 |
|
| 2000 |
Isenburg M, Snoeyink J. Face fixer: Compressing polygon meshes with properties Proceedings of the Acm Siggraph Conference On Computer Graphics. 263-270. |
0.652 |
|
| 1999 |
Kirkpatrick D, Snoeyink J. Computing constrained shortest segments: Butterfly wingspans in logarithmic time International Journal of Computational Geometry and Applications. 9: 53-62. DOI: 10.1142/S0218195999000054 |
0.369 |
|
| 1999 |
Chin FYL, Snoeyink J, Wang CA. Finding the Medial Axis of a Simple Polygon in Linear Time Discrete and Computational Geometry. 21: 405-420. DOI: 10.1007/Pl00009429 |
0.341 |
|
| 1998 |
Hershberger J, Snoeyink J. Cartographic line simplification and polygon CSG formulæ in O(n log* n) time Computational Geometry: Theory and Applications. 11: 175-185. DOI: 10.1016/S0925-7721(98)00027-3 |
0.335 |
|
| 1998 |
García-López J, Ramos PA, Snoeyink J. Fitting a set of points by a circle Discrete and Computational Geometry. 20: 389-402. DOI: 10.1007/Pl00009392 |
0.368 |
|
| 1997 |
Bose P, McAllister M, Snoeyink J. Optimal algorithms to embed trees in a point set Journal of Graph Algorithms and Applications. 1: 1-15. DOI: 10.7155/Jgaa.00002 |
0.332 |
|
| 1996 |
Zhu C, Sundaram G, Snoeyink J, Mitchell JSB. Generating random polygons with given vertices Computational Geometry: Theory and Applications. 6: 277-290. DOI: 10.1016/0925-7721(95)00031-3 |
0.332 |
|
| 1996 |
McAllister M, Kirkpatrick D, Snoeyink J. A compact piecewise-linear Voronoi diagram for convex sites in the plane Discrete and Computational Geometry. 15: 73-105. DOI: 10.1007/Bf02716580 |
0.304 |
|
| 1995 |
Kirkpatrick D, Snoeyink J. Tentative prune-and-search for computing fixed-points with applications to geometric computation Fundamenta Informaticae. 22: 353-370. DOI: 10.3233/Fi-1995-2243 |
0.362 |
|
| 1995 |
Deberg M, Vankreveld M, Snoeyink J. Two-Dimensional and Three-Dimensional Point Location in Rectangular Subdivisions Journal of Algorithms. 18: 256-277. DOI: 10.1006/Jagm.1995.1010 |
0.338 |
|
| 1994 |
Hershberger J, Snoeyink J. Computing minimum length paths of a given homotopy class Computational Geometry: Theory and Applications. 4: 63-97. DOI: 10.1016/0925-7721(94)90010-8 |
0.383 |
|
| 1994 |
Chazelle B, Edelsbrunner H, Grigni M, Guibas L, Hershberger J, Sharir M, Snoeyink J. Ray shooting in polygons using geodesic triangulations Algorithmica. 12: 54-68. DOI: 10.1007/Bf01377183 |
0.309 |
|
| 1994 |
Schwarz C, Smid M, Snoeyink J. An optimal algorithm for the on-line closest-pair problem Algorithmica. 12: 18-29. DOI: 10.1007/Bf01377181 |
0.368 |
|
| 1994 |
Palazzi L, Snoeyink J. Counting and Reporting Red/Blue Segment Intersections Cvgip: Graphical Models and Image Processing. 56: 304-310. DOI: 10.1006/Cgip.1994.1027 |
0.317 |
|
| 1993 |
Chazelle B, Edelsbrunner H, Guibas L, Sharir M, Snoeyink J. Computing a Face in an Arrangement of Line Segments and Related Problems Siam Journal On Computing. 22: 1286-1302. DOI: 10.1137/0222077 |
0.372 |
|
| 1993 |
Dobkin D, Guibas L, Hershberger J, Snoeyink J. An efficient algorithm for finding the CSG representation of a simple polygon Algorithmica. 10: 1-23. DOI: 10.1007/Bf01908629 |
0.347 |
|
| 1993 |
GUIBAS LJ, HERSHBERGER JE, MITCHELL JS, SNOEYINK JS. APPROXIMATING POLYGONS AND SUBDIVISIONS WITH MINIMUM-LINK PATHS International Journal of Computational Geometry & Applications. 3: 383-415. DOI: 10.1007/3-540-54945-5_59 |
0.341 |
|
| 1991 |
GUIBAS L, HERSHBERGER J, SNOEYINK J. COMPACT INTERVAL TREES: A DATA STRUCTURE FOR CONVEX HULLS International Journal of Computational Geometry & Applications. 1: 1-22. DOI: 10.1142/S0218195991000025 |
0.347 |
|
| Show low-probability matches. |