| 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.507 |
|
| 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.43 |
|
| 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.465 |
|
| 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.476 |
|
| 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, Snoeyink J. Early-split coding of triangle mesh connectivity Proceedings - Graphics Interface. 2006: 89-97. |
0.629 |
|
| 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, 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 |
|
| 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 |
|
| Low-probability matches (unlikely to be authored by this person) |
| 2002 |
Kirkpatrick D, Snoeyink J, Speckmann B. Kinetic collision detection for simple polygons International Journal of Computational Geometry and Applications. 12: 3-27. DOI: 10.1142/S0218195902000724 |
0.3 |
|
| 1997 |
Chan TM, Snoeyink J, Yap CK. Primal dividing and dual pruning: Output-sensitive construction of four-dimensional polytopes and three-dimensional Voronoi diagrams Discrete and Computational Geometry. 18: 433-454. DOI: 10.1007/Pl00009327 |
0.3 |
|
| 1996 |
De Berg M, Van Kreveld M, Schwarzkopf O, Snoeyink J. Point location in zones of k-flats in arrangements Computational Geometry: Theory and Applications. 6: 131-143. DOI: 10.1016/0925-7721(95)00021-6 |
0.293 |
|
| 2008 |
Löffler M, Snoeyink J. Delaunay triangulations of imprecise points in linear time after preprocessing Proceedings of the Annual Symposium On Computational Geometry. 298-304. DOI: 10.1145/1377676.1377727 |
0.292 |
|
| 2002 |
Bose P, Hurtado-Diaz F, Omaña-Pulido E, Snoeyink J, Toussaint GT. Some aperture-angle optimization problems Algorithmica. 33: 411-435. DOI: 10.1007/S00453-001-0112-9 |
0.292 |
|
| 2010 |
Carr H, Snoeyink J, Van De Panne M. Flexible isosurfaces: Simplifying and displaying scalar topology using the contour tree Computational Geometry: Theory and Applications. 43: 42-58. DOI: 10.1016/J.Comgeo.2006.05.009 |
0.29 |
|
| 1994 |
ADEGEEST J, OVERMARS M, SNOEYINK J. MINIMUM-LINK C-ORIENTED PATHS: SINGLE-SOURCE QUERIES International Journal of Computational Geometry & Applications. 4: 39-51. DOI: 10.1142/S0218195994000045 |
0.29 |
|
| 2011 |
Bose P, Devroye L, Löffler M, Snoeyink J, Verma V. Almost all Delaunay triangulations have stretch factor greater than φ/2 Computational Geometry: Theory and Applications. 44: 121-127. DOI: 10.1016/J.Comgeo.2010.09.009 |
0.287 |
|
| 2014 |
Aichholzer O, Aloupis G, Demaine ED, Demaine ML, Fekete SP, Hoffmann M, Lubiw A, Snoeyink J, Winslow A. Covering Folded Shapes Journal of Computational Geometry. 5: 150-167. DOI: 10.20382/Jocg.V5I1A8 |
0.283 |
|
| 2006 |
Xie Y, Snoeyink J, Xu J. Efficient algorithm for approximating maximum inscribed sphere in high dimensional polytope Proceedings of the Annual Symposium On Computational Geometry. 2006: 21-29. |
0.28 |
|
| 2002 |
Keil M, Snoeyink J. On the time bound for convex decomposition of simple polygons International Journal of Computational Geometry and Applications. 12: 181-192. DOI: 10.1142/S0218195902000803 |
0.279 |
|
| 2001 |
Speckmann B, Snoeyink J. Easy triangle strips for TIN terrain models International Journal of Geographical Information Science. 15: 379-386. DOI: 10.1080/136588101300304070 |
0.273 |
|
| 2006 |
Carr H, Möller T, Snoeyink J. Artifacts caused by simplicial subdivision. Ieee Transactions On Visualization and Computer Graphics. 12: 231-42. PMID 16509382 DOI: 10.1109/Tvcg.2006.22 |
0.26 |
|
| 2006 |
Boissonnat JD, Snoeyink J. Computational Geometry: Theory and Applications: Editorial Computational Geometry: Theory and Applications. 35: 1. DOI: 10.1016/J.Comgeo.2005.10.007 |
0.256 |
|
| 2003 |
Hass J, Snoeyink J, Thurston WP. The size of spanning disks for polygonal curves Discrete and Computational Geometry. 29: 1-17. DOI: 10.1007/S00454-002-2707-6 |
0.256 |
|
| 2002 |
Agarwal PK, Guibas LJ, Edelsbrunner H, Erickson J, Isard M, Har-Peled S, Hershberger J, Jensen C, Kavraki L, Koehl P, Lin M, Manocha D, Metaxas D, Mirtich B, Mount D, ... ... Snoeyink J, et al. Algorithmic issues in modeling motion Acm Computing Surveys. 34: 550-572. DOI: 10.1145/592642.592647 |
0.254 |
|
| 2003 |
Bern M, Demaine ED, Eppstein D, Kuo E, Mantler A, Snoeyink J. Ununfoldable polyhedra with convex faces Computational Geometry: Theory and Applications. 24: 51-62. DOI: 10.1016/S0925-7721(02)00091-3 |
0.252 |
|
| 2006 |
Brönnimann H, Kettner L, Pocchiola M, Snoeyink J. Counting and enumerating pointed pseudotriangulations with the greedy flip algorithm Siam Journal On Computing. 36: 721-739. DOI: 10.1137/050631008 |
0.251 |
|
| 1994 |
de Berg M, Halperin D, Overmars M, Snoeyink J, van Kreveld M. Efficient ray shooting and hidden surface removal Algorithmica. 12: 30-53. DOI: 10.1007/BF01377182 |
0.249 |
|
| 1996 |
Friedman J, Hershberger J, Snoeyink J. Efficiently planning compliant motion in the plane Siam Journal On Computing. 25: 562-599. DOI: 10.1137/S0097539794263191 |
0.243 |
|
| 2005 |
Mascarenhas A, Snoeyink J. Implementing time-varying contour trees Proceedings of the Annual Symposium On Computational Geometry. 370-371. DOI: 10.1145/1064092.1064151 |
0.239 |
|
| 2004 |
Bandyopadhyay D, Snoeyink J. Almost-Delaunay Simplices: Nearest Neighbor Relations for Imprecise Points Proceedings of the Annual Acm-Siam Symposium On Discrete Algorithms. 15: 403-412. |
0.238 |
|
| 2000 |
McAllister M, Snoeyink J. Medial axis generalization of river networks Cartography and Geographic Information Science. 27: 129-138. DOI: 10.1559/152304000783547966 |
0.237 |
|
| 1994 |
Snoeyink J, Stolfi J. Objects that cannot be taken apart with two hands Discrete &Amp; Computational Geometry. 12: 367-384. DOI: 10.1007/Bf02574386 |
0.233 |
|
| 2011 |
Snoeyink J. Degree-driven design for correct geometric algorithms Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 6681: 8-9. DOI: 10.1007/978-3-642-21204-8_4 |
0.23 |
|
| 2009 |
Verma V, Snoeyink J. Defining and computing accessibility radius Proceedings of the 21st Annual Canadian Conference On Computational Geometry, Cccg 2009. 119-122. |
0.227 |
|
| 1992 |
Chazelle B, Edelsbrunner H, Guibas LJ, Pollack R, Seidel R, Sharir M, Snoeyink J. Counting and cutting cycles of lines and rods in space Computational Geometry: Theory and Applications. 1: 305-323. DOI: 10.1016/0925-7721(92)90009-H |
0.226 |
|
| 2006 |
Liu Y, Snoeyink J. Sphere-based computation of Delaunay diagrams on points from 4d grids Proceedings - 3rd International Symposium On Voronoi Diagrams in Science and Engineering 2006, Isvd 2006. 60-65. DOI: 10.1109/ISVD.2006.32 |
0.224 |
|
| 2009 |
Verma V, Snoeyink J. Reducing the memory required to find a geodesic shortest path on a large mesh Gis: Proceedings of the Acm International Symposium On Advances in Geographic Information Systems. 227-235. DOI: 10.1145/1653771.1653804 |
0.223 |
|
| 2010 |
Constantin C, Brown S, Snoeyink J. Implementing streaming simplification for large labeled meshes 2010 Proceedings of the 12th Workshop On Algorithm Engineering and Experiments, Alenex 2010. 149-158. |
0.222 |
|
| 1996 |
Van Kreveld M, Snoeyink J, Whitesides S. Folding rulers inside triangles Discrete and Computational Geometry. 15: 265-285. DOI: 10.1007/Bf02711495 |
0.222 |
|
| 2012 |
Brown S, Snoeyink J. Modestly faster histogram computations on GPUs 2012 Innovative Parallel Computing, Inpar 2012. DOI: 10.1109/InPar.2012.6339589 |
0.221 |
|
| 2002 |
Barequet G, Chen DZ, Daescu O, Goodrich MT, Snoeyink J. Efficiently approximating polygonal paths in three and higher dimensions Algorithmica (New York). 33: 150-167. |
0.217 |
|
| 1999 |
Chin F, Snoeyink J, Wang CA. Finding the medial axis of a simple polygon in linear time Discrete and Computational Geometry. 21: 405-420. |
0.214 |
|
| 2003 |
Carr H, Snoeyink J, Axen U. Computing contour trees in all dimensions Computational Geometry: Theory and Applications. 24: 75-94. DOI: 10.1016/S0925-7721(02)00093-7 |
0.21 |
|
| 2004 |
Ahn HK, Cheng SW, Cheong O, Snoeyink J. The reflex-free hull International Journal of Computational Geometry and Applications. 14: 453-474. DOI: 10.1142/S0218195904001548 |
0.209 |
|
| 2004 |
Carr H, Snoeyink J, Van Panne MD. Simplifying flexible isosurfaces using local geometric measures Ieee Visualization 2004 - Proceedings, Vis 2004. 497-504. |
0.206 |
|
| 2003 |
Kettner L, Kirkpatrick D, Mantler A, Snoeyink J, Speckmann B, Takeuchi F. Tight degree bounds for pseudo-triangulations of points Computational Geometry: Theory and Applications. 25: 3-12. DOI: 10.1016/S0925-7721(02)00126-8 |
0.199 |
|
| 1999 |
Snoeyink J. Cross-ratios and angles determine a polygon Discrete and Computational Geometry. 22: 619-631. |
0.197 |
|
| 1989 |
Edelsbrunner H, Guibas L, Hershberger J, Seidel R, Sharir M, Snoeyink J, Welzl E. Implicitly representing arrangements of lines or segments Discrete &Amp; Computational Geometry. 4: 433-466. DOI: 10.1007/BF02187742 |
0.193 |
|
| 1999 |
Walker RJ, Snoeyink J. Practical point-in-polygon tests using CSG representations of polygons Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 1619: 114-128. |
0.19 |
|
| 1999 |
Kahan S, Snoeyink J. On the bit complexity of minimum link paths: Superquadratic algorithms for problem solvable in linear time Computational Geometry: Theory and Applications. 12: 33-44. |
0.189 |
|
| 1996 |
Bose P, McAllister M, Snoeyink J. Optimal algorithms to embed trees in a point set Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 1027: 64-75. |
0.183 |
|
| 1995 |
Kirkpatrick D, Snoeyink J. Computing common tangents without a separating line Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 955: 183-193. DOI: 10.1007/3-540-60220-8_61 |
0.182 |
|
| 2010 |
Bhattacharya B, Bishnu A, Cheong O, Das S, Karmakar A, Snoeyink J. Computation of non-dominated points using compact Voronoi diagrams Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 5942: 82-93. DOI: 10.1007/978-3-642-11440-3_8 |
0.175 |
|
| 2003 |
Kettner L, Rossignac J, Snoeyink J. The Safari interface for visualizing time-dependent volume data using iso-surfaces and contour spectra Computational Geometry: Theory and Applications. 25: 97-116. DOI: 10.1016/S0925-7721(02)00132-3 |
0.173 |
|
| 2001 |
Mantler A, Snoeyink J. Intersecting red and blue line segments in optimal time and precision Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 2098: 244-251. |
0.17 |
|
| 2017 |
Williams CJ, Headd JJ, Moriarty NW, Prisant MG, Videau LL, Deis LN, Verma V, Keedy DA, Hintze BJ, Chen VB, Jain S, Lewis SM, Arendall WB, Snoeyink J, Adams PD, et al. MolProbity: More and better reference data for improved all-atom structure validation. Protein Science : a Publication of the Protein Society. PMID 29067766 DOI: 10.1002/Pro.3330 |
0.168 |
|
| 2006 |
Amenta N, Cheong O, Snoeyink J. Proceedings of the Annual Symposium on Computational Geometry: Foreword Proceedings of the Annual Symposium On Computational Geometry. 2006. |
0.166 |
|
| 2014 |
Karaivanov B, Markov M, Snoeyink J, Vassilev TS. Decontaminating planar regions by sweeping with barrier curves 26th Canadian Conference On Computational Geometry, Cccg 2014. 206-211. |
0.164 |
|
| 2014 |
Lu P, Snoeyink J. Frontiers in algorithmics Theoretical Computer Science. 532: 1. DOI: 10.1016/j.tcs.2014.04.001 |
0.164 |
|
| 2008 |
Razen A, Snoeyink J, Welzl E. Number of Crossing-Free Geometric Graphs vs. Triangulations Electronic Notes in Discrete Mathematics. 31: 195-200. DOI: 10.1016/j.endm.2008.06.039 |
0.162 |
|
| 2008 |
Anuradha V, Jain C, Snoeyink J, Szabó T. How long can a graph be kept planar? Electronic Journal of Combinatorics. 15. |
0.16 |
|
| 2009 |
Bose P, Devroye L, Löpffler M, Snoeyink J, Verma V. The spanning ratio of the delaunay triangulation is greater than =2 Proceedings of the 21st Annual Canadian Conference On Computational Geometry, Cccg 2009. 165-167. |
0.157 |
|
| 2002 |
Bose P, Hurtado-Diaz F, Omaña-Pulido E, Snoeyink J, Toussaint GT. Some aperture-angle optimization problems Algorithmica (New York). 33: 411-435. |
0.156 |
|
| 1989 |
Edelsbrunner H, Guibas L, Hershberger J, Pach J, Pollack R, Seidel R, Sharir M, Snoeyink J. On arrangements of Jordan arcs with three intersections per pair Discrete &Amp; Computational Geometry. 4: 523-539. DOI: 10.1007/BF02187745 |
0.154 |
|
| 2010 |
Van Den Berg J, Snoeyink J, Lin M, Manocha D. Centralized path planning for multiple robots: Optimal decoupling into sequential plans Robotics: Science and Systems. 5: 137-144. |
0.15 |
|
| 2001 |
Carr H, Möller T, Snoeyink J. Simplicial subdivisions and sampling artifacts Proceedings of the Ieee Visualization Conference. 99-106. |
0.144 |
|
| 2013 |
Aichholzer O, Aloupis G, Demaine ED, Demaine ML, Fekete ͆P, Hoffmann M, Lubiw A, Snoeyink J, Winslow A. Covering folded shapes Cccg 2013 - 25th Canadian Conference On Computational Geometry. 73-78. |
0.143 |
|
| 2007 |
Basu S, Snoeyink J. Terrain representation using right-triangulated irregular networks Cccg 2007 - 19th Canadian Conference On Computational Geometry. 133-136. |
0.141 |
|
| 2001 |
Chen DZ, Daescu O, Hershberger J, Kogge PM, Snoeyink J. Polygonal path approximation with angle constraints Proceedings of the Annual Acm-Siam Symposium On Discrete Algorithms. 342-343. |
0.13 |
|
| 2003 |
Asano T, De Berg M, Cheong O, Guibas LJ, Snoeyink J, Tamaki H. Spanning Trees Crossing Few Barriers Discrete and Computational Geometry. 30: 591-606. DOI: 10.1007/s00454-003-2853-5 |
0.128 |
|
| 2007 |
Liu Y, Snoeyink J. Quadratic and cubic b-splines by generalizing higher-order voronoi diagrams Proceedings of the Annual Symposium On Computational Geometry. 150-157. DOI: 10.1145/1247069.1247100 |
0.128 |
|
| 2005 |
Snoeyink J, Suri S, Varghese G. A lower bound for multicast key distribution Computer Networks. 47: 429-441. DOI: 10.1016/j.comnet.2004.09.001 |
0.124 |
|
| 2011 |
Snoeyink J, Verma V. Fitting spheres to electron density Proceedings of the Annual Symposium On Computational Geometry. 291-292. DOI: 10.1145/1998196.1998242 |
0.122 |
|
| 2011 |
Dash S, Snoeyink J. On the energy of bifurcated hydrogen bonds for protein structure prediction 2011 Ieee International Conference On Bioinformatics and Biomedicine Workshops, Bibmw 2011. 334-337. DOI: 10.1109/BIBMW.2011.6112395 |
0.103 |
|
| 2001 |
Snoeyink J, Suri S, Varghese G. A lower bound for multicast key distribution Proceedings - Ieee Infocom. 1: 422-431. |
0.102 |
|
| 2001 |
Kettner L, Snoeyink J. A prototype system for visualizing time-dependent volume data Proceedings of the Annual Symposium On Computational Geometry. 327-328. |
0.1 |
|
| 1997 |
Hershberger J, Snoeyink J. Cartographic line simplication and polygon CSG formulae in O(n log* n) time Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 1272: 93-103. |
0.099 |
|
| 2000 |
Bespamyatnikh S, Kirkpatrick D, Snoeyink J. Generalizing Ham Sandwich Cuts to Equitable Subdivisions Discrete & Computational Geometry. 24: 605-622. DOI: 10.1007/s004540010065 |
0.092 |
|
| 2007 |
Healey CG, Snoeyink J. VisTRE: A visualization tool to evaluate errors in terrain representation Proceedings - Third International Symposium On 3d Data Processing, Visualization, and Transmission, 3dpvt 2006. 1056-1063. DOI: 10.1109/3DPVT.2006.146 |
0.091 |
|
| 2002 |
Demaine ED, Langerman S, O'Rourke J, Snoeyink J. Interlocked open linkages with few joints Proceedings of the Annual Symposium On Computational Geometry. 189-198. |
0.09 |
|
| 1997 |
Snoeyink J, van Kreveldt M. Linear-time reconstruction of delaunay triangulations with applications Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 1284: 459-471. |
0.086 |
|
| 2003 |
Demaine ED, Langerman S, O'Rourke J, Snoeyink J. Interlocked open and closed linkages with few joints Computational Geometry: Theory and Applications. 26: 37-45. DOI: 10.1016/S0925-7721(02)00171-2 |
0.071 |
|
| 2000 |
Bespamyatnikh S, Snoeyink J. Queries with segments in Voronoi diagrams Computational Geometry. 16: 23-33. DOI: 10.1016/S0925-7721(99)00055-3 |
0.07 |
|
| 1998 |
Hershberger JE, Snoeyink JS. Erased arrangements of lines and convex decompositions of polyhedra Computational Geometry: Theory and Applications. 9: 129-143. |
0.063 |
|
| 1985 |
Cole D, Haarsma L, Snoeyink J, Klaasen GA. The problem of managing a strategic reserve Mathematical Modelling. 6: 549-560. DOI: 10.1016/0270-0255(85)90053-3 |
0.063 |
|
| 2014 |
Rivera S, Band LE, Lee JS, McHenry K, Schmidt AR, Snoeyink J, Sullivan WC, Whitton MC, Minsker B. Proposing a framework for crowd-sourced green infrastructure design Proceedings - 7th International Congress On Environmental Modelling and Software: Bold Visions For Environmental Modeling, Iemss 2014. 2: 1129-1137. |
0.053 |
|
| 2005 |
Noonan K, O'Brien D, Snoeyink J. Probik: Protein backbone motion by inverse kinematics Springer Tracts in Advanced Robotics. 17: 377-392. DOI: 10.1177/0278364905059108 |
0.049 |
|
| 2005 |
Noonan K, O'Brien D, Snoeyink J. Probik: Protein backbone motion by inverse kinematics Springer Tracts in Advanced Robotics. 17: 377-392. |
0.049 |
|
| 2001 |
Buchsbaum A, Snoeyink J. Preface Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 2153: V. |
0.046 |
|
| 2001 |
Drysdale RL, McElfresh S, Snoeyink JS. On exclusion regions for optimal triangulations Discrete Applied Mathematics. 109: 49-65. DOI: 10.1016/S0166-218X(00)00236-5 |
0.044 |
|
| 2008 |
Nussinov R, Ju T, Bhat T, Snoeyink J, Ramani K. Bio-geometry: Challenges, approaches, and future opportunities in proteomics and drug discovery Proceedings of the 2008 Acm Symposium On Solid and Physical Modeling 2008, Spm'08. 417-418. DOI: 10.1145/1364901.1364961 |
0.044 |
|
| 2012 |
Snoeyink J, Lu P, Su K, Wang L. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics): Preface Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 7285. |
0.037 |
|
| 2007 |
Applegate D, Brodal GS, Aardal K, Blelloch GE, Fagerberg R, Hershberger J, Kaplan H, Munro I, Navarro G, Phillips C, Stoye J, Suri S, Venkatasubramanian S, Werneck R, Arge L, ... ... Snoeyink J, et al. Alenex workshop preface Proceedings of the 9th Workshop On Algorithm Engineering and Experiments and the 4th Workshop On Analytic Algorithms and Combinatorics. vii-viii. |
0.021 |
|
| 2007 |
Applegate D, Brodal GS, Aardal K, Blelloch GE, Fagerberg R, Hershberger J, Kaplan H, Munro I, Navarro G, Phillips C, Stoye J, Suri S, Venkatasubramanian S, Werneck R, Arge L, ... ... Snoeyink J, et al. Alenex workshop preface Proceedings of the 9th Workshop On Algorithm Engineering and Experiments and the 4th Workshop On Analytic Algorithms and Combinatorics. vii-viii. |
0.021 |
|
| 2005 |
Applegate D, Brandes U, Demetrescu C, Gabow H, Maheshwari A, Pettie S, Pruhs K, Tamassia R, Teillaud M, Warnow T, Arge L, Battiti R, Buchsbaum A, Goldberg AV, Goodrich MT, ... ... Snoeyink J, et al. Alenex workshop preface Proceedings of the Seventh Workshop On Algorithm Engineering and Experiments and the Second Workshop On Analytic Algorithms and Combinatorics. |
0.021 |
|
| 2005 |
Snoeyink J. Editorial Computational Geometry: Theory and Applications. 31: 149. DOI: 10.1016/j.comgeo.2004.12.001 |
0.01 |
|
| Hide low-probability matches. |