The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Jack Snoeyink: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Martin Isenburg, Jack Snoeyink
    Coding with ASCII: compact, yet text-based 3D content. [Citation Graph (0, 0)][DBLP]
    3DPVT, 2002, pp:609-617 [Conf]
  2. Ajith Mascarenhas, Martin Isenburg, Valerio Pascucci, Jack Snoeyink
    Encoding Volumetric Grids For Streaming Isosurface Extraction. [Citation Graph (0, 0)][DBLP]
    3DPVT, 2004, pp:665-672 [Conf]
  3. Christopher G. Healey, Jack Snoeyink
    VisTRE: A Visualization Tool to Evaluate Errors in Terrain Representation. [Citation Graph (0, 0)][DBLP]
    3DPVT, 2006, pp:1056-1063 [Conf]
  4. Robert J. Walker, Jack Snoeyink
    Practical Point-in-Polygon Tests Using CSG Representations of Polygons. [Citation Graph (0, 0)][DBLP]
    ALENEX, 1999, pp:114-123 [Conf]
  5. Hervé Brönnimann, Lutz Kettner, Michel Pocchiola, Jack Snoeyink
    Counting and Enumerating Pointed Pseudo-triangulations with the Greedy Flip Algorithm. [Citation Graph (0, 0)][DBLP]
    ALENEX/ANALCO, 2005, pp:98-110 [Conf]
  6. Andrew Leaver-Fay, Yuanxin Liu, Jack Snoeyink
    Faster Placement of Hydrogens in Protein Structures by Dynamic Programming. [Citation Graph (0, 0)][DBLP]
    ALENEX/ANALC, 2004, pp:39-48 [Conf]
  7. Hee-Kap Ahn, Siu-Wing Cheng, Otfried Cheong, Jack Snoeyink
    The reflex-free hull. [Citation Graph (0, 0)][DBLP]
    CCCG, 2001, pp:9-12 [Conf]
  8. Pierre Alliez, Olivier Devillers, Jack Snoeyink
    Removing degeneracies by perturbing the problem or perturbing the world. [Citation Graph (0, 0)][DBLP]
    CCCG, 1998, pp:- [Conf]
  9. 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. [Citation Graph (0, 0)][DBLP]
    CCCG, 1996, pp:325-330 [Conf]
  10. Prosenjit Bose, William S. Evans, David G. Kirkpatrick, Michael McAllister, Jack Snoeyink
    Approximating Shortest Paths in Arrangements of Lines. [Citation Graph (0, 0)][DBLP]
    CCCG, 1996, pp:143-148 [Conf]
  11. Craig Falls, Yuanxin Liu, Jack Snoeyink, Diane L. Souvaine
    Testing Shortcuts to Maintain Simplicity in Subdivision Simplification. [Citation Graph (0, 0)][DBLP]
    CCCG, 2005, pp:35-38 [Conf]
  12. John Hershberger, Jack Snoeyink
    An Efficient Solution to the Zookeeper's Problem. [Citation Graph (0, 0)][DBLP]
    CCCG, 1994, pp:104-109 [Conf]
  13. Martin Isenburg, Jack Snoeyink
    Spirale Reversi: Reverse Decoding of the Edgebreaker Encoding. [Citation Graph (0, 0)][DBLP]
    CCCG, 2000, pp:- [Conf]
  14. J. Mark Keil, Jack Snoeyink
    On the time bound for convex decomposition of simple polygons. [Citation Graph (0, 0)][DBLP]
    CCCG, 1998, pp:- [Conf]
  15. David G. Kirkpatrick, Jack Snoeyink
    Computing Constrained Shortest Segments: Butterfly Wingspans in Logarithmic Time. [Citation Graph (0, 0)][DBLP]
    CCCG, 1993, pp:163-168 [Conf]
  16. Marc J. van Kreveld, Jack Snoeyink, Sue Whitesides
    Folding Rulers inside Triangles. [Citation Graph (0, 0)][DBLP]
    CCCG, 1993, pp:1-6 [Conf]
  17. Andrea Mantler, Jack Snoeyink
    Heaphull?. [Citation Graph (0, 0)][DBLP]
    CCCG, 2001, pp:129-131 [Conf]
  18. Andrea Mantler, Jack Snoeyink
    Banana spiders: A study of connectivity in 3d combinatorial rigidity. [Citation Graph (0, 0)][DBLP]
    CCCG, 2004, pp:44-47 [Conf]
  19. Michael McAllister, Jack Snoeyink
    Two-dimensional Computation of the Three-dimensional Reachable Region for a Welding Head. [Citation Graph (0, 0)][DBLP]
    CCCG, 1993, pp:437-442 [Conf]
  20. Dana Randall, Günter Rote, Francisco Santos, Jack Snoeyink
    Counting triangulations and pseudo-triangulations of wheels. [Citation Graph (0, 0)][DBLP]
    CCCG, 2001, pp:149-152 [Conf]
  21. Günter Rote, Christian Schwarz, Jack Snoeyink
    Maintaining the Approximate Width of a Set of Points in the Plane. [Citation Graph (0, 0)][DBLP]
    CCCG, 1993, pp:258-263 [Conf]
  22. Jack Snoeyink
    The arithmetic precision of ray-polygon intersection testing. [Citation Graph (0, 0)][DBLP]
    CCCG, 2001, pp:161-164 [Conf]
  23. Jack Snoeyink
    Maximum Independent Set for Intervals by Divide-Prune-and-Conquer. [Citation Graph (0, 0)][DBLP]
    CCCG, 2005, pp:264-265 [Conf]
  24. Jack Snoeyink, Ileana Streinu
    Computing Rigid Components of Pseudo-triangulation Mechanisms in Linear Time. [Citation Graph (0, 0)][DBLP]
    CCCG, 2005, pp:223-226 [Conf]
  25. Bettina Speckmann, Jack Snoeyink
    Easy triangle strips for tin terrain models. [Citation Graph (0, 0)][DBLP]
    CCCG, 1997, pp:- [Conf]
  26. Michael J. Spriggs, J. Mark Keil, Sergei Bespamyatnikh, Michael Segal, Jack Snoeyink
    Approximating the geometric minimum-diameter spanning tree. [Citation Graph (0, 0)][DBLP]
    CCCG, 2003, pp:39-42 [Conf]
  27. Chong Zhu, Gopalakrishnan Sundaram, Jack Snoeyink, Joseph S. B. Mitchell
    Generating Random x-Monotone Polygons with Given Vertices. [Citation Graph (0, 0)][DBLP]
    CCCG, 1994, pp:189-194 [Conf]
  28. Martin Isenburg, Jack Snoeyink
    Compressing Texture Coordinates with Selective Linear Predictions. [Citation Graph (0, 0)][DBLP]
    Computer Graphics International, 2003, pp:126-133 [Conf]
  29. Tetsuo Asano, Mark de Berg, Otfried Cheong, Leonidas J. Guibas, Jack Snoeyink, Hisao Tamaki
    Spanning Trees Crossing Few Barriers. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1999, pp:41-48 [Conf]
  30. D. S. Andrews, Jack Snoeyink
    Geometry in GIS is not Combinatorial: Segment Intersection for Polygon Overlay. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1995, pp:0-0 [Conf]
  31. David Avis, Prosenjit Bose, Godfried T. Toussaint, Thomas C. Shermer, Binhai Zhu, Jack Snoeyink
    On the Sectional Area of Convex Polytopes. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1996, pp:0-11 [Conf]
  32. Ronald Beirouti, Jack Snoeyink
    Implementations of the LMT Heuristic for Minimum Weight Triangulation. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1998, pp:96-105 [Conf]
  33. Patrice Belleville, J. Mark Keil, Michael McAllister, Jack Snoeyink
    On Computing Edges That Are In All Minimum-Weight Triangulations. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1996, pp:0-7 [Conf]
  34. Mark de Berg, Dan Halperin, Mark H. Overmars, Jack Snoeyink, Marc J. van Kreveld
    Efficient Ray Shooting and Hidden Surface Removal. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1991, pp:21-30 [Conf]
  35. Sergei Bespamyatnikh, David G. Kirkpatrick, Jack Snoeyink
    Generalizing Ham Sandwich Cuts to Equitable Subdivisions. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1999, pp:49-58 [Conf]
  36. Jean-Daniel Boissonnat, Jack Snoeyink
    Efficient Algorithms for Line and Curve Segment Intersection Using Restricted Predicates. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1999, pp:370-379 [Conf]
  37. Sergio Cabello, Yuanxin Liu, Andrea Mantler, Jack Snoeyink
    Testing Homotopy for paths in the plane. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 2002, pp:160-169 [Conf]
  38. Erik D. Demaine, Stefan Langerman, Joseph O'Rourke, Jack Snoeyink
    Interlocked open linkages with few joints. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 2002, pp:189-198 [Conf]
  39. 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. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1988, pp:258-265 [Conf]
  40. Herbert Edelsbrunner, Leonidas J. Guibas, John Hershberger, Raimund Seidel, Micha Sharir, Jack Snoeyink, Emo Welzl
    Implicitly Representing Arrangements of Lines or Segments. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1988, pp:56-69 [Conf]
  41. Joseph Friedman, John Hershberger, Jack Snoeyink
    Compliant Motion in a Simple Polygon. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1989, pp:175-186 [Conf]
  42. John Hershberger, Jack Snoeyink
    An O(n log n) Implementation of the Douglas-Peucker Algorithm for Line Simplification. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1994, pp:383-384 [Conf]
  43. Martin Isenburg, Yuanxin Liu, Jonathan Richard Shewchuk, Jack Snoeyink
    Illustrating the streaming construction of 2D delaunay triangulations. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 2006, pp:481-482 [Conf]
  44. Martin Isenburg, Jack Snoeyink
    The face fixer video. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 2000, pp:377-378 [Conf]
  45. Martin Isenburg, Jack Snoeyink
    Mesh Collapse Compression. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1999, pp:419-420 [Conf]
  46. Simon Kahan, Jack Snoeyink
    On the Bit Complexity of Minimum Link Paths: Superquadratic Algorithms for Problems Solvable in Linear Time. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1996, pp:151-158 [Conf]
  47. Lutz Kettner, Jack Snoeyink
    A prototype system for visualizing time-dependent volume data. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 2001, pp:327-328 [Conf]
  48. David G. Kirkpatrick, Jack Snoeyink
    Tentative Prune-and-Search for Computing Voronoi Vertices. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1993, pp:133-142 [Conf]
  49. David G. Kirkpatrick, Jack Snoeyink, Bettina Speckmann
    Kinetic collision detection for simple polygons. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 2000, pp:322-330 [Conf]
  50. Marc J. van Kreveld, Joseph S. B. Mitchell, Peter Rousseeuw, Micha Sharir, Jack Snoeyink, Bettina Speckmann
    Efficient Algorithms for Maximum Regression Depth. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1999, pp:31-40 [Conf]
  51. Ajith Mascarenhas, Jack Snoeyink
    Implementing time-varying contour trees. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 2005, pp:370-371 [Conf]
  52. Christian Schwarz, Michiel H. M. Smid, Jack Snoeyink
    An Optimal Algorithm for the On-Line Closest-Pair Problem. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1992, pp:330-336 [Conf]
  53. Jack Snoeyink
    A Trivial Knot Whose Spanning Disks Have Exponential Size. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1990, pp:139-147 [Conf]
  54. Jack Snoeyink
    Video: Objects that Cannot be Taken Apart with Two Hands. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1993, pp:405- [Conf]
  55. Jack Snoeyink
    Cross-Ratios and Angles Determine a Polygon. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1998, pp:49-57 [Conf]
  56. Jack Snoeyink, John Hershberger
    Sweeping Arrangements of Curves. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1989, pp:354-363 [Conf]
  57. Jack Snoeyink, Marc J. van Kreveld
    Good Orders for Incremental (Re)construction. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1997, pp:400-402 [Conf]
  58. Jack Snoeyink, Jorge Stolfi
    Objects That Cannot be Taken Apart with Two Hands. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1993, pp:247-256 [Conf]
  59. Yuanxin Liu, Jack Snoeyink
    Quadratic and cubic b-splines by generalizing higher-order voronoi diagrams. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 2007, pp:150-157 [Conf]
  60. Yulai Xie, Jack Snoeyink, Jinhui Xu
    Efficient algorithm for approximating maximum inscribed sphere in high dimensional polytope. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 2006, pp:21-29 [Conf]
  61. Jack Snoeyink, Marc J. van Kreveld
    Linear-Time Reconstruction of Delaunay Triangulations with Applications. [Citation Graph (0, 0)][DBLP]
    ESA, 1997, pp:459-471 [Conf]
  62. 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 [Citation Graph (0, 0)][DBLP]
    FOCS, 1990, pp:242-251 [Conf]
  63. Michael McAllister, David G. Kirkpatrick, Jack Snoeyink
    A Compact Piecewise-Linear Voronoi Diagram for Convex Sites in the Plane [Citation Graph (0, 0)][DBLP]
    FOCS, 1993, pp:573-582 [Conf]
  64. Prosenjit Bose, Michael McAllister, Jack Snoeyink
    Optimal Algorithms to Embed Trees in a Point Set. [Citation Graph (0, 0)][DBLP]
    Graph Drawing, 1995, pp:64-75 [Conf]
  65. Martin Isenburg, Yuanxin Liu, Jonathan Richard Shewchuk, Jack Snoeyink, Tim Thirion
    Generating Raster DEM from Mass Points Via TIN Streaming. [Citation Graph (0, 0)][DBLP]
    GIScience, 2006, pp:186-198 [Conf]
  66. Martin Isenburg, Jack Snoeyink
    Early-split coding of triangle mesh connectivity. [Citation Graph (0, 0)][DBLP]
    Graphics Interface, 2006, pp:89-97 [Conf]
  67. Bernard Chazelle, Herbert Edelsbrunner, Michelangelo Grigni, Leonidas J. Guibas, John Hershberger, Micha Sharir, Jack Snoeyink
    Ray Shooting in Polygons Using Geodesic Triangulations. [Citation Graph (0, 0)][DBLP]
    ICALP, 1991, pp:661-646 [Conf]
  68. Jack Snoeyink, Subhash Suri, George Varghese
    A Lower Bound for Multicast Key Distribution. [Citation Graph (0, 0)][DBLP]
    INFOCOM, 2001, pp:422-431 [Conf]
  69. Leonidas J. Guibas, John Hershberger, Joseph S. B. Mitchell, Jack Snoeyink
    Approximating Polygons and Subdivisions with Minimum Link Paths. [Citation Graph (0, 0)][DBLP]
    ISA, 1991, pp:151-162 [Conf]
  70. Francis Y. L. Chin, Jack Snoeyink, Cao An Wang
    Finding the Medial Axis of a Simple Polygon in Linear Time. [Citation Graph (0, 0)][DBLP]
    ISAAC, 1995, pp:382-391 [Conf]
  71. Eric Guévremont, Jack Snoeyink
    Recognizing an Envelope of Lines in Linear Time. [Citation Graph (0, 0)][DBLP]
    ISAAC, 1992, pp:370-377 [Conf]
  72. Andrea Mantler, Jack Snoeyink
    Intersecting Red and Blue Line Segments in Optimal Time and Precision. [Citation Graph (0, 0)][DBLP]
    JCDCG, 2000, pp:244-251 [Conf]
  73. Martin Isenburg, Jack Snoeyink
    Compressing the Property Mapping of Polygon Meshes. [Citation Graph (0, 0)][DBLP]
    Pacific Conference on Computer Graphics and Applications, 2001, pp:4-11 [Conf]
  74. Andrew Leaver-Fay, Brian Kuhlman, Jack Snoeyink
    An Adaptive Dynamic Programming Algorithm for the Side Chain Placement Problem. [Citation Graph (0, 0)][DBLP]
    Pacific Symposium on Biocomputing, 2005, pp:17-28 [Conf]
  75. Jun Huan, Wei Wang, Deepak Bandyopadhyay, Jack Snoeyink, Jan Prins, Alexander Tropsha
    Mining protein family specific residue packing patterns from protein structure graphs. [Citation Graph (0, 0)][DBLP]
    RECOMB, 2004, pp:308-315 [Conf]
  76. Martin Isenburg, Peter Lindstrom, Jack Snoeyink
    Streaming Compression of Triangle Meshes. [Citation Graph (0, 0)][DBLP]
    Symposium on Geometry Processing, 2005, pp:111-118 [Conf]
  77. Martin Isenburg, Jack Snoeyink
    Mesh Collapse Compression. [Citation Graph (0, 0)][DBLP]
    SIBGRAPI, 1999, pp:27-28 [Conf]
  78. David P. Dobkin, Leonidas J. Guibas, John Hershberger, Jack Snoeyink
    An efficient algorithm for finding the CSG representation of a simple polygon. [Citation Graph (0, 0)][DBLP]
    SIGGRAPH, 1988, pp:31-40 [Conf]
  79. Martin Isenburg, Jack Snoeyink
    Face fixer: compressing polygon meshes with properties. [Citation Graph (0, 0)][DBLP]
    SIGGRAPH, 2000, pp:263-270 [Conf]
  80. Deepak Bandyopadhyay, Jack Snoeyink
    Almost-Delaunay simplices: nearest neighbor relations for imprecise points. [Citation Graph (0, 0)][DBLP]
    SODA, 2004, pp:410-419 [Conf]
  81. Sergei Bespamyatnikh, Jack Snoeyink
    Queries with Segments in Voronoi Diagrams. [Citation Graph (0, 0)][DBLP]
    SODA, 1999, pp:122-129 [Conf]
  82. Hamish Carr, Jack Snoeyink, Ulrike Axen
    Computing contour trees in all dimensions. [Citation Graph (0, 0)][DBLP]
    SODA, 2000, pp:918-926 [Conf]
  83. Timothy M. Chan, Jack Snoeyink, Chee-Keng Yap
    Output-Sensitive Construction of Polytopes in Four Dimensions and Clipped Voronoi Diagrams in Three. [Citation Graph (0, 0)][DBLP]
    SODA, 1995, pp:282-291 [Conf]
  84. Bernard Chazelle, Herbert Edelsbrunner, Leonidas J. Guibas, Micha Sharir, Jack Snoeyink
    Computing a Face in an Arrangement of Line Segments. [Citation Graph (0, 0)][DBLP]
    SODA, 1991, pp:441-448 [Conf]
  85. Danny Z. Chen, Ovidiu Daescu, John Hershberger, Peter M. Kogge, Jack Snoeyink
    Polygonal path approximation with angle constraints. [Citation Graph (0, 0)][DBLP]
    SODA, 2001, pp:342-343 [Conf]
  86. Leonidas J. Guibas, John Hershberger, Jack Snoeyink
    Compact Interval Trees: A Data Structure for Convex Hulls. [Citation Graph (0, 0)][DBLP]
    SODA, 1990, pp:169-178 [Conf]
  87. Mark de Berg, Marc J. van Kreveld, Jack Snoeyink
    Two- and Three-Dimensional Point Location in Rectangular Subdivisions (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    SWAT, 1992, pp:352-363 [Conf]
  88. Joseph Friedman, John Hershberger, Jack Snoeyink
    Input-Sensitive Compliant Motion in the Plane. [Citation Graph (0, 0)][DBLP]
    SWAT, 1990, pp:225-237 [Conf]
  89. John Hershberger, Jack Snoeyink
    Convex Polygons Made from Few Lines and Convex Decompositions of Polyhedra. [Citation Graph (0, 0)][DBLP]
    SWAT, 1992, pp:376-387 [Conf]
  90. Leonidas J. Guibas, Jack Snoeyink, Li Zhang
    Compact Voronoi Diagrams for Moving Convex Polygons. [Citation Graph (0, 0)][DBLP]
    SWAT, 2000, pp:339-352 [Conf]
  91. Hamish Carr, Jack Snoeyink
    Path Seeds and Flexible Isosurfaces - Using Topology for Exploratory Visualization. [Citation Graph (0, 0)][DBLP]
    VisSym, 2003, pp:- [Conf]
  92. Hamish Carr, Torsten Möller, Jack Snoeyink
    Simplicial Subdivisions and Sampling Artifacts. [Citation Graph (0, 0)][DBLP]
    IEEE Visualization, 2001, pp:- [Conf]
  93. Hamish Carr, Jack Snoeyink, Michiel van de Panne
    Simplifying Flexible Isosurfaces Using Local Geometric Measures. [Citation Graph (0, 0)][DBLP]
    IEEE Visualization, 2004, pp:497-504 [Conf]
  94. Martin Isenburg, Peter Lindstrom, Stefan Gumhold, Jack Snoeyink
    Large Mesh Simplification using Processing Sequences. [Citation Graph (0, 0)][DBLP]
    IEEE Visualization, 2003, pp:465-472 [Conf]
  95. Martin Isenburg, Jack Snoeyink
    Coding polygon meshes as compressable ASCII. [Citation Graph (0, 0)][DBLP]
    Web3D, 2002, pp:1-10 [Conf]
  96. Martin Isenburg, Jack Snoeyink
    Binary compression rates for ASCII formats. [Citation Graph (0, 0)][DBLP]
    Web3D, 2003, pp:173-178 [Conf]
  97. Andrew Leaver-Fay, Brian Kuhlman, Jack Snoeyink
    Rotamer-Pair Energy Calculations Using a Trie Data Structure. [Citation Graph (0, 0)][DBLP]
    WABI, 2005, pp:389-400 [Conf]
  98. Michael T. Goodrich, Jack Snoeyink
    Stabbing Parallel Segments with a Convex Polygon (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    WADS, 1989, pp:231-242 [Conf]
  99. John Hershberger, Jack Snoeyink
    Computing Minimum Length Paths of a Given Homotopy Class (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    WADS, 1991, pp:331-342 [Conf]
  100. John Hershberger, Jack Snoeyink
    Cartographic Line Simplification and Polygon CSG Formulae and in O(n log* n) Time. [Citation Graph (0, 0)][DBLP]
    WADS, 1997, pp:93-103 [Conf]
  101. David G. Kirkpatrick, Jack Snoeyink
    Computing Common Tangents Without a Separating Line. [Citation Graph (0, 0)][DBLP]
    WADS, 1995, pp:183-193 [Conf]
  102. Larry Palazzi, Jack Snoeyink
    Counting and Reporting Red/Blue Segment Intersections. [Citation Graph (0, 0)][DBLP]
    WADS, 1993, pp:530-540 [Conf]
  103. Gill Barequet, Danny Z. Chen, Ovidiu Daescu, Michael T. Goodrich, Jack Snoeyink
    Efficiently Approximating Polygonal Paths in Three and Higher Dimensions. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 2002, v:33, n:2, pp:150-167 [Journal]
  104. Mark de Berg, Dan Halperin, Mark H. Overmars, Jack Snoeyink, Marc J. van Kreveld
    Efficient Ray Shooting and Hidden Surface Removal. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 1994, v:12, n:1, pp:30-53 [Journal]
  105. Prosenjit Bose, Ferran Hurtado, Elsa Omaña-Pulido, Jack Snoeyink, Godfried T. Toussaint
    Some Aperture-Angle Optimization Problems. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 2002, v:33, n:4, pp:411-435 [Journal]
  106. Bernard Chazelle, Herbert Edelsbrunner, Michelangelo Grigni, Leonidas J. Guibas, John Hershberger, Micha Sharir, Jack Snoeyink
    Ray Shooting in Polygons Using Geodesic Triangulations. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 1994, v:12, n:1, pp:54-68 [Journal]
  107. David P. Dobkin, Leonidas J. Guibas, John Hershberger, Jack Snoeyink
    An Efficient Algorithm for Finding the CSG Representation of a Simple Polygon. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 1993, v:10, n:1, pp:1-23 [Journal]
  108. Christopher M. Gold, Jack Snoeyink
    A One-Step Crust and Skeleton Extraction Algorithm. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 2001, v:30, n:2, pp:144-163 [Journal]
  109. Christian Schwarz, Michiel H. M. Smid, Jack Snoeyink
    An Optimal Algorithm for the On-Line Closest-Pair Problem. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 1994, v:12, n:1, pp:18-29 [Journal]
  110. Michael J. Spriggs, J. Mark Keil, Sergei Bespamyatnikh, Michael Segal, Jack Snoeyink
    Computing a (1+epsilon)-Approximate Geometric Minimum-Diameter Spanning Tree. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 2004, v:38, n:4, pp:577-589 [Journal]
  111. Martin Isenburg, Peter Lindstrom, Jack Snoeyink
    Lossless compression of predicted floating-point geometry. [Citation Graph (0, 0)][DBLP]
    Computer-Aided Design, 2005, v:37, n:8, pp:869-877 [Journal]
  112. Jack Snoeyink, Subhash Suri, George Varghese
    A lower bound for multicast key distribution. [Citation Graph (0, 0)][DBLP]
    Computer Networks, 2005, v:47, n:3, pp:429-441 [Journal]
  113. Mark de Berg, Marc J. van Kreveld, Otfried Schwarzkopf, Jack Snoeyink
    Point Location in Zones of K-flats in Arrangements. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 1996, v:6, n:, pp:131-143 [Journal]
  114. Marshall W. Bern, Erik D. Demaine, David Eppstein, Eric Kuo, Andrea Mantler, Jack Snoeyink
    Ununfoldable polyhedra with convex faces. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 2003, v:24, n:2, pp:51-62 [Journal]
  115. Sergei Bespamyatnikh, Jack Snoeyink
    Queries with segments in Voronoi diagrams. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 2000, v:16, n:1, pp:23-33 [Journal]
  116. Jean-Daniel Boissonnat, Jack Snoeyink
    Efficient algorithms for line and curve segment intersection using restricted predicates. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 2000, v:16, n:1, pp:35-52 [Journal]
  117. Jean-Daniel Boissonnat, Jack Snoeyink
    Editorial. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 2006, v:35, n:1-2, pp:1- [Journal]
  118. Hamish Carr, Jack Snoeyink, Ulrike Axen
    Computing contour trees in all dimensions. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 2003, v:24, n:2, pp:75-94 [Journal]
  119. 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. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 1991, v:1, n:, pp:305-323 [Journal]
  120. Danny Z. Chen, Ovidiu Daescu, John Hershberger, Peter M. Kogge, Ningfang Mi, Jack Snoeyink
    Polygonal path simplification with angle constraints. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 2005, v:32, n:3, pp:173-187 [Journal]
  121. Zhu Chong, Gopalakrishnan Sundaram, Jack Snoeyink, Joseph S. B. Mitchell
    Generating Random Polygons with Given Vertices. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 1996, v:6, n:, pp:277-290 [Journal]
  122. Erik D. Demaine, Stefan Langerman, Joseph O'Rourke, Jack Snoeyink
    Interlocked open and closed linkages with few joints. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 2003, v:26, n:1, pp:37-45 [Journal]
  123. Simon Kahan, Jack Snoeyink
    On the bit complexity of minimum link paths: Superquadratic algorithms for problem solvable in linear time. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 1999, v:12, n:1-2, pp:33-44 [Journal]
  124. Lutz Kettner, David G. Kirkpatrick, Andrea Mantler, Jack Snoeyink, Bettina Speckmann, Fumihiko Takeuchi
    Tight degree bounds for pseudo-triangulations of points. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 2003, v:25, n:1-2, pp:3-12 [Journal]
  125. Lutz Kettner, Jarek Rossignac, Jack Snoeyink
    The Safari interface for visualizing time-dependent volume data using iso-surfaces and contour spectra. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 2003, v:25, n:1-2, pp:97-116 [Journal]
  126. Martin Isenburg, Jack Snoeyink
    Spirale Reversi: Reverse decoding of the Edgebreaker encoding. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 2001, v:20, n:1-2, pp:39-52 [Journal]
  127. John Hershberger, Jack Snoeyink
    Computing Minimum Length Paths of a Given Homotopy Class. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 1994, v:4, n:, pp:63-97 [Journal]
  128. John Hershberger, Jack Snoeyink
    Erased arrangements of lines and convex decompositions of polyhedra. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 1998, v:9, n:3, pp:129-143 [Journal]
  129. John Hershberger, Jack Snoeyink
    Cartographic line simplification and polygon CSG formulæ in O(nlog * n) time. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 1998, v:11, n:3-4, pp:175-185 [Journal]
  130. Jack Snoeyink
    Editorial. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 2005, v:31, n:3, pp:149-0 [Journal]
  131. Julie Glass, Stefan Langerman, Joseph O'Rourke, Jack Snoeyink, Jianyuan K. Zhong
    A 2-chain can interlock with a k-chain [Citation Graph (0, 0)][DBLP]
    CoRR, 2004, v:0, n:, pp:- [Journal]
  132. Marshall W. Bern, Erik D. Demaine, David Eppstein, Eric Kuo, Andrea Mantler, Jack Snoeyink
    Ununfoldable Polyhedra with Convex Faces [Citation Graph (0, 0)][DBLP]
    CoRR, 1999, v:0, n:, pp:- [Journal]
  133. 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 [Citation Graph (0, 0)][DBLP]
    CoRR, 1999, v:0, n:, pp:- [Journal]
  134. 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. [Citation Graph (0, 0)][DBLP]
    ACM Comput. Surv., 2002, v:34, n:4, pp:550-572 [Journal]
  135. Michael T. Goodrich, Jack Snoeyink
    Stabbing Parallel Segments with a Convex Polygon. [Citation Graph (0, 0)][DBLP]
    Computer Vision, Graphics, and Image Processing, 1990, v:49, n:2, pp:152-170 [Journal]
  136. Martin Isenburg, Jack Snoeyink
    Compressing the Property Mapping of Polygon Meshes. [Citation Graph (0, 0)][DBLP]
    Graphical Models, 2002, v:64, n:2, pp:114-127 [Journal]
  137. Larry Palazzi, Jack Snoeyink
    Counting and Reporting Red/Blue Segment Intersections. [Citation Graph (0, 0)][DBLP]
    CVGIP: Graphical Model and Image Processing, 1994, v:56, n:4, pp:304-310 [Journal]
  138. Robert L. (Scot) Drysdale III, Scott A. McElfresh, Jack Snoeyink
    On exclusion regions for optimal triangulations. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2001, v:109, n:1-2, pp:49-65 [Journal]
  139. Tetsuo Asano, Mark de Berg, Otfried Cheong, Leonidas J. Guibas, Jack Snoeyink, Hisao Tamaki
    Spanning Trees Crossing Few Barriers. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 2003, v:30, n:4, pp:591-606 [Journal]
  140. Sergei Bespamyatnikh, David G. Kirkpatrick, Jack Snoeyink
    Generalizing Ham Sandwich Cuts to Equitable Subdivisions. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 2000, v:24, n:4, pp:605-622 [Journal]
  141. Sergio Cabello, Yuanxin Liu, Andrea Mantler, Jack Snoeyink
    Testing Homotopy for Paths in the Plane. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 2004, v:31, n:1, pp:61-81 [Journal]
  142. 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. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 1997, v:18, n:4, pp:433-454 [Journal]
  143. Francis Y. L. Chin, Jack Snoeyink, Cao An Wang
    Finding the Medial Axis of a Simple Polygon in Linear Time. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 1999, v:21, n:3, pp:405-420 [Journal]
  144. 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. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 1989, v:4, n:, pp:523-539 [Journal]
  145. Herbert Edelsbrunner, Leonidas J. Guibas, John Hershberger, Raimund Seidel, Micha Sharir, Jack Snoeyink, Emo Welzl
    Implicitly Representing Arrangements of Lines or Segments. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 1989, v:4, n:, pp:433-466 [Journal]
  146. Jesus Garcia-Lopez, Pedro A. Ramos, Jack Snoeyink
    Fitting a Set of Points by a Circle. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 1998, v:20, n:3, pp:389-402 [Journal]
  147. Joel Hass, Jack Snoeyink, William P. Thurston
    The Size of Spanning Disks for Polygonal Curves. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 2003, v:29, n:1, pp:1-17 [Journal]
  148. Marc J. van Kreveld, Jack Snoeyink, Sue Whitesides
    Folding Rulers Inside Triangles. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 1996, v:15, n:3, pp:265-285 [Journal]
  149. Michael McAllister, David G. Kirkpatrick, Jack Snoeyink
    A Compact Piecewise-Linear Voronoi Diagram for Convex Sites in the Plane. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 1996, v:15, n:1, pp:73-105 [Journal]
  150. Jack Snoeyink
    Cross-Ratios and Angles Determine a Polygon. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 1999, v:22, n:4, pp:619-631 [Journal]
  151. Jack Snoeyink, Jorge Stolfi
    Objects that Cannot Be Taken Apart with Two Hands. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 1994, v:12, n:, pp:367-384 [Journal]
  152. Jean-Daniel Boissonnat, Jack Snoeyink
    Guest Editors' Foreword. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 2006, v:36, n:4, pp:501-502 [Journal]
  153. David G. Kirkpatrick, Jack Snoeyink
    Tentative Prune-and-Search for Computing Fixed-Points with Applications to Geometric Computation. [Citation Graph (0, 0)][DBLP]
    Fundam. Inform., 1995, v:22, n:4, pp:353-370 [Journal]
  154. Bettina Speckmann, Jack Snoeyink
    Easy triangle strips for TIN terrain models. [Citation Graph (0, 0)][DBLP]
    International Journal of Geographical Information Science, 2001, v:15, n:4, pp:379-386 [Journal]
  155. John Adegeest, Mark H. Overmars, Jack Snoeyink
    Minimum-link C-oriented paths: Single-source queries. [Citation Graph (0, 0)][DBLP]
    Int. J. Comput. Geometry Appl., 1994, v:4, n:1, pp:39-51 [Journal]
  156. Hee-Kap Ahn, Siu-Wing Cheng, Otfried Cheong, Jack Snoeyink
    The reflex-free hull. [Citation Graph (0, 0)][DBLP]
    Int. J. Comput. Geometry Appl., 2004, v:14, n:6, pp:453-474 [Journal]
  157. Leonidas J. Guibas, John Hershberger, Joseph S. B. Mitchell, Jack Snoeyink
    Approximating Polygons and Subdivisions with Minimum Link Paths. [Citation Graph (0, 0)][DBLP]
    Int. J. Comput. Geometry Appl., 1993, v:3, n:4, pp:383-415 [Journal]
  158. Leonidas J. Guibas, John Hershberger, Jack Snoeyink
    Compact interval trees: a data structure for convex hulls. [Citation Graph (0, 0)][DBLP]
    Int. J. Comput. Geometry Appl., 1991, v:1, n:1, pp:1-22 [Journal]
  159. J. Mark Keil, Jack Snoeyink
    On the Time Bound for Convex Decomposition of Simple Polygons. [Citation Graph (0, 0)][DBLP]
    Int. J. Comput. Geometry Appl., 2002, v:12, n:3, pp:181-192 [Journal]
  160. David G. Kirkpatrick, Jack Snoeyink, Bettina Speckmann
    Kinetic Collision Detection for Simple Polygons. [Citation Graph (0, 0)][DBLP]
    Int. J. Comput. Geometry Appl., 2002, v:12, n:1-2, pp:3-27 [Journal]
  161. David G. Kirkpatrick, Jack Snoeyink
    Computing Constrained Shortest Segments: Butterfly Wingspans in Logarithmic Time. [Citation Graph (0, 0)][DBLP]
    Int. J. Comput. Geometry Appl., 1999, v:9, n:1, pp:53-0 [Journal]
  162. Kimberly Noonan, David O'Brien, Jack Snoeyink
    Probik: Protein Backbone Motion by Inverse Kinematics. [Citation Graph (0, 0)][DBLP]
    I. J. Robotic Res., 2005, v:24, n:11, pp:971-982 [Journal]
  163. Mark de Berg, Marc J. van Kreveld, Jack Snoeyink
    Two- and Three-Dimensional Point Location in Rectangular Subdivisions. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 1995, v:18, n:2, pp:256-277 [Journal]
  164. 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. [Citation Graph (0, 0)][DBLP]
    Journal of Computational Biology, 2005, v:12, n:6, pp:657-671 [Journal]
  165. Prosenjit Bose, Michael McAllister, Jack Snoeyink
    Optimal Algorithms to Embed Trees in a Point Set. [Citation Graph (0, 0)][DBLP]
    J. Graph Algorithms Appl., 1997, v:1, n:, pp:- [Journal]
  166. Pierre Alliez, Olivier Devillers, Jack Snoeyink
    Removing Degeneracies by Perturbing the Problem or Perturbing the World. [Citation Graph (0, 0)][DBLP]
    Reliable Computing, 2000, v:6, n:1, pp:61-79 [Journal]
  167. Bernard Chazelle, Herbert Edelsbrunner, Leonidas J. Guibas, Micha Sharir, Jack Snoeyink
    Computing a Face in an Arrangement of Line Segments and Related Problems. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1993, v:22, n:6, pp:1286-1302 [Journal]
  168. Joseph Friedman, John Hershberger, Jack Snoeyink
    Efficiently Planning Compliant Motion in the Plane. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1996, v:25, n:3, pp:562-599 [Journal]
  169. Hervé Brönnimann, Lutz Kettner, Michel Pocchiola, Jack Snoeyink
    Counting and Enumerating Pointed Pseudotriangulations with the Greedy Flip Algorithm. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2006, v:36, n:3, pp:721-739 [Journal]
  170. Martin Isenburg, Yuanxin Liu, Jonathan Richard Shewchuk, Jack Snoeyink
    Streaming computation of Delaunay triangulations. [Citation Graph (0, 0)][DBLP]
    ACM Trans. Graph., 2006, v:25, n:3, pp:1049-1056 [Journal]
  171. Hamish Carr, Torsten Möller, Jack Snoeyink
    Artifacts Caused by Simplicial Subdivision. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Vis. Comput. Graph., 2006, v:12, n:2, pp:231-242 [Journal]
  172. Esther M. Arkin, Joseph S. B. Mitchell, Jack Snoeyink
    Capturing Crossings: Convex Hulls of Segment and Plane Intersections. [Citation Graph (0, 0)][DBLP]
    CCCG, 2007, pp:9-11 [Conf]
  173. Suddha Basu, Jack Snoeyink
    Terrain Representation using Right-Triangulated Irregular Networks. [Citation Graph (0, 0)][DBLP]
    CCCG, 2007, pp:133-136 [Conf]
  174. Xueyi Wang, Jun Huan, Jack Snoeyink, Wei Wang
    Mining RNA Tertiary Motifs with Structure Graphs. [Citation Graph (0, 0)][DBLP]
    SSDBM, 2007, pp:31- [Conf]
  175. Xueyi Wang, Jack Snoeyink
    Defining and Computing Optimum RMSD for Gapped Multiple Structure Alignment. [Citation Graph (0, 0)][DBLP]
    WABI, 2007, pp:196-207 [Conf]
  176. Deepak Bandyopadhyay, Jack Snoeyink
    Almost-Delaunay simplices: Robust neighbor relations for imprecise 3D points using CGAL. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 2007, v:38, n:1-2, pp:4-15 [Journal]
  177. Andrew Leaver-Fay, Yuanxin Liu, Jack Snoeyink, Xueyi Wang
    Faster placement of hydrogens in protein structures by dynamic programming. [Citation Graph (0, 0)][DBLP]
    ACM Journal of Experimental Algorithms, 2007, v:12, n:, pp:- [Journal]

  178. Implementing Streaming Simplification for large Labeled Meshes. [Citation Graph (, )][DBLP]


  179. Maximum geodesic routing in the plane with obstacles. [Citation Graph (, )][DBLP]


  180. The spanning ratio of the Delaunay triangulation is greater than pi/2. [Citation Graph (, )][DBLP]


  181. Defining and computing accessibility radius. [Citation Graph (, )][DBLP]


  182. Delaunay triangulations of imprecise pointsin linear time after preprocessing. [Citation Graph (, )][DBLP]


  183. Computing planar Voronoi diagrams in double precision: a further example of degree-driven algorithm design. [Citation Graph (, )][DBLP]


  184. Reducing the memory required to find a geodesic shortest path on a large mesh. [Citation Graph (, )][DBLP]


  185. Reconstructing Polygons from Scanner Data. [Citation Graph (, )][DBLP]


  186. Bio-geometry: challenges, approaches, and future opportunities in proteomics and drug discovery. [Citation Graph (, )][DBLP]


  187. Computing the Implicit Voronoi Diagram in Triple Precision. [Citation Graph (, )][DBLP]


  188. Computation of Non-dominated Points Using Compact Voronoi Diagrams. [Citation Graph (, )][DBLP]


  189. Sphere-based Computation of Delaunay Diagrams on Points from 4d Grids. [Citation Graph (, )][DBLP]


  190. On-the-Fly Rotamer Pair Energy Evaluation in Protein Design. [Citation Graph (, )][DBLP]


  191. Functional Neighbors: Inferring Relationships between Non-Homologous Protein Families Using Family-Specific Packing Motifs. [Citation Graph (, )][DBLP]


  192. Delineating Boundaries for Imprecise Regions. [Citation Graph (, )][DBLP]


  193. Time-varying Reeb graphs for continuous space-time data. [Citation Graph (, )][DBLP]


  194. Flexible isosurfaces: Simplifying and displaying scalar topology using the contour tree. [Citation Graph (, )][DBLP]


  195. Delaunay triangulation of imprecise points in linear time after preprocessing. [Citation Graph (, )][DBLP]


  196. On Finding Non-dominated Points using Compact Voronoi Diagrams [Citation Graph (, )][DBLP]


  197. The dilation of the Delaunay triangulation is greater than π/2 [Citation Graph (, )][DBLP]


  198. Efficient Algorithms for Maximum Regression Depth. [Citation Graph (, )][DBLP]


Search in 0.016secs, Finished in 0.025secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002