dblp.uni-trier.dewww.uni-trier.de

Jack Snoeyink Vis

List of publications from the DBLP Bibliography Server - FAQ
Coauthor Index - Ask others: ACM DL/Guide - CiteSeerX - CSB - MetaPress - Google - Bing - Yahoo
Home Page

*2009
194EEDavid L. Millman, Jack Snoeyink: Computing the Implicit Voronoi Diagram in Triple Precision. WADS 2009: 495-506
193EEBinay K. Bhattacharya, Arijit Bishnu, Otfried Cheong, Sandip Das, Arindam Karmakar, Jack Snoeyink: On Finding Non-dominated Points using Compact Voronoi Diagrams CoRR abs/0909.0814: (2009)
2008
192EEAndrew Leaver-Fay, Jack Snoeyink, Brian Kuhlman: On-the-Fly Rotamer Pair Energy Evaluation in Protein Design. ISBRA 2008: 343-354
191EEMaarten Löffler, Jack Snoeyink: Delaunay triangulations of imprecise pointsin linear time after preprocessing. Symposium on Computational Geometry 2008: 298-304
190EERuth Nussinov, Tao Ju, Talapady Bhat, Jack Snoeyink, Karthik Ramani: Bio-geometry: challenges, approaches, and future opportunities in proteomics and drug discovery. Symposium on Solid and Physical Modeling 2008: 417-418
189EEIris Reinbacher, Marc Benkert, Marc J. van Kreveld, Joseph S. B. Mitchell, Jack Snoeyink, Alexander Wolff: Delineating Boundaries for Imprecise Regions. Algorithmica 50(3): 386-414 (2008)
188EEHerbert Edelsbrunner, John Harer, Ajith Mascarenhas, Valerio Pascucci, Jack Snoeyink: Time-varying Reeb graphs for continuous space-time data. Comput. Geom. 41(3): 149-166 (2008)
187EEMarc J. van Kreveld, Joseph S. B. Mitchell, Peter Rousseeuw, Micha Sharir, Jack Snoeyink, Bettina Speckmann: Efficient Algorithms for Maximum Regression Depth. Discrete & Computational Geometry 39(4): 656-677 (2008)
186EEAndreas Razen, Jack Snoeyink, Emo Welzl: Number of Crossing-Free Geometric Graphs vs. Triangulations. Electronic Notes in Discrete Mathematics 31: 195-200 (2008)
185EEXueyi Wang, Jack Snoeyink: Defining and Computing Optimum RMSD for Gapped and Weighted Multiple-Structure Alignment. IEEE/ACM Trans. Comput. Biology Bioinform. 5(4): 525-533 (2008)
184EEEsther M. Arkin, Joseph S. B. Mitchell, Jack Snoeyink: Capturing crossings: Convex hulls of segment and plane intersections. Inf. Process. Lett. 107(5): 194-197 (2008)
183EEYuanxin Liu, Jack Snoeyink: Faraway Point: a Sentinel Point for Delaunay Computation. Int. J. Comput. Geometry Appl. 18(4): 343-355 (2008)
2007
182 Suddha Basu, Jack Snoeyink: Terrain Representation using Right-Triangulated Irregular Networks. CCCG 2007: 133-136
181 Esther M. Arkin, Joseph S. B. Mitchell, Jack Snoeyink: Capturing Crossings: Convex Hulls of Segment and Plane Intersections. CCCG 2007: 9-11
180EEXueyi Wang, Jun Huan, Jack Snoeyink, Wei Wang: Mining RNA Tertiary Motifs with Structure Graphs. SSDBM 2007: 31
179EEYuanxin Liu, Jack Snoeyink: Quadratic and cubic b-splines by generalizing higher-order voronoi diagrams. Symposium on Computational Geometry 2007: 150-157
178EEXueyi Wang, Jack Snoeyink: Defining and Computing Optimum RMSD for Gapped Multiple Structure Alignment. WABI 2007: 196-207
177EEAndrew Leaver-Fay, Yuanxin Liu, Jack Snoeyink, Xueyi Wang: Faster placement of hydrogens in protein structures by dynamic programming. ACM Journal of Experimental Algorithmics 12: (2007)
176EEDeepak Bandyopadhyay, Jack Snoeyink: Almost-Delaunay simplices: Robust neighbor relations for imprecise 3D points using CGAL. Comput. Geom. 38(1-2): 4-15 (2007)
175EEAndrew Leaver-Fay, Glenn L. Butterfoss, Jack Snoeyink, Brian Kuhlman: Maintaining solvent accessible surface area under rotamer substitution for protein design. Journal of Computational Chemistry 28(8): 1336-1341 (2007)
174EEJack Snoeyink: Maximum independent set for intervals by divide and conquer with pruning. Networks 49(2): 158-159 (2007)
173EEIan W. Davis, Andrew Leaver-Fay, Vincent B. Chen, Jeremy N. Block, Gary J. Kapral, Xueyi Wang, Laura Weston Murray, W. Bryan Arendall III, Jack Snoeyink, Jane S. Richardson, David C. Richardson: MolProbity: all-atom contacts and structure validation for proteins and nucleic acids. Nucleic Acids Research 35(Web-Server-Issue): 375-383 (2007)
2006
172EEChristopher G. Healey, Jack Snoeyink: VisTRE: A Visualization Tool to Evaluate Errors in Terrain Representation. 3DPVT 2006: 1056-1063
171EEMartin Isenburg, Yuanxin Liu, Jonathan Richard Shewchuk, Jack Snoeyink, Tim Thirion: Generating Raster DEM from Mass Points Via TIN Streaming. GIScience 2006: 186-198
170EEMartin Isenburg, Jack Snoeyink: Early-split coding of triangle mesh connectivity. Graphics Interface 2006: 89-97
169EEYulai Xie, Jack Snoeyink, Jinhui Xu: Efficient algorithm for approximating maximum inscribed sphere in high dimensional polytope. Symposium on Computational Geometry 2006: 21-29
168EEMartin Isenburg, Yuanxin Liu, Jonathan Richard Shewchuk, Jack Snoeyink: Illustrating the streaming construction of 2D delaunay triangulations. Symposium on Computational Geometry 2006: 481-482
167EEMartin Isenburg, Yuanxin Liu, Jonathan Richard Shewchuk, Jack Snoeyink: Streaming computation of Delaunay triangulations. ACM Trans. Graph. 25(3): 1049-1056 (2006)
166EEJean-Daniel Boissonnat, Jack Snoeyink: Editorial. Comput. Geom. 35(1-2): 1 (2006)
165EEJean-Daniel Boissonnat, Jack Snoeyink: Guest Editors' Foreword. Discrete & Computational Geometry 36(4): 501-502 (2006)
164EEHamish Carr, Torsten Möller, Jack Snoeyink: Artifacts Caused by Simplicial Subdivision. IEEE Trans. Vis. Comput. Graph. 12(2): 231-242 (2006)
163EEHervé Brönnimann, Lutz Kettner, Michel Pocchiola, Jack Snoeyink: Counting and Enumerating Pointed Pseudotriangulations with the Greedy Flip Algorithm. SIAM J. Comput. 36(3): 721-739 (2006)
2005
162EEHervé Brönnimann, Lutz Kettner, Michel Pocchiola, Jack Snoeyink: Counting and Enumerating Pointed Pseudo-triangulations with the Greedy Flip Algorithm. ALENEX/ANALCO 2005: 98-110
161EEJack Snoeyink, Ileana Streinu: Computing Rigid Components of Pseudo-triangulation Mechanisms in Linear Time. CCCG 2005: 223-226
160EEJack Snoeyink: Maximum Independent Set for Intervals by Divide-Prune-and-Conquer. CCCG 2005: 264-265
159EECraig Falls, Yuanxin Liu, Jack Snoeyink, Diane L. Souvaine: Testing Shortcuts to Maintain Simplicity in Subdivision Simplification. CCCG 2005: 35-38
158EEAndrew Leaver-Fay, Brian Kuhlman, Jack Snoeyink: An Adaptive Dynamic Programming Algorithm for the Side Chain Placement Problem. Pacific Symposium on Biocomputing 2005: 17-28
157EEAjith Mascarenhas, Jack Snoeyink: Implementing time-varying contour trees. Symposium on Computational Geometry 2005: 370-371
156 Martin Isenburg, Peter Lindstrom, Jack Snoeyink: Streaming Compression of Triangle Meshes. Symposium on Geometry Processing 2005: 111-118
155EEAndrew Leaver-Fay, Brian Kuhlman, Jack Snoeyink: Rotamer-Pair Energy Calculations Using a Trie Data Structure. WABI 2005: 389-400
154EEJack Snoeyink: Editorial. Comput. Geom. 31(3): 149- (2005)
153EEDanny Z. Chen, Ovidiu Daescu, John Hershberger, Peter M. Kogge, Ningfang Mi, Jack Snoeyink: Polygonal path simplification with angle constraints. Comput. Geom. 32(3): 173-187 (2005)
152EEJack Snoeyink, Subhash Suri, George Varghese: A lower bound for multicast key distribution. Computer Networks 47(3): 429-441 (2005)
151EEMartin Isenburg, Peter Lindstrom, Jack Snoeyink: Lossless compression of predicted floating-point geometry. Computer-Aided Design 37(8): 869-877 (2005)
150EEKimberly Noonan, David O'Brien, Jack Snoeyink: Probik: Protein Backbone Motion by Inverse Kinematics. I. J. Robotic Res. 24(11): 971-982 (2005)
149EEJun Huan, Deepak Bandyopadhyay, Wei Wang, Jack Snoeyink, Jan Prins, Alexander Tropsha: Comparing Graph Representations of Protein Structure for Mining Family-Specific Residue-Based Packing Motifs. Journal of Computational Biology 12(6): 657-671 (2005)
2004
148 Jack Snoeyink, Jean-Daniel Boissonnat: Proceedings of the 20th ACM Symposium on Computational Geometry, Brooklyn, New York, USA, June 8-11, 2004 ACM 2004
147EEAjith Mascarenhas, Martin Isenburg, Valerio Pascucci, Jack Snoeyink: Encoding Volumetric Grids For Streaming Isosurface Extraction. 3DPVT 2004: 665-672
146 Andrew Leaver-Fay, Yuanxin Liu, Jack Snoeyink: Faster Placement of Hydrogens in Protein Structures by Dynamic Programming. ALENEX/ANALC 2004: 39-48
145EEAndrea Mantler, Jack Snoeyink: Banana spiders: A study of connectivity in 3d combinatorial rigidity. CCCG 2004: 44-47
144EEHamish Carr, Jack Snoeyink, Michiel van de Panne: Simplifying Flexible Isosurfaces Using Local Geometric Measures. IEEE Visualization 2004: 497-504
143EEJun Huan, Wei Wang, Deepak Bandyopadhyay, Jack Snoeyink, Jan Prins, Alexander Tropsha: Mining protein family specific residue packing patterns from protein structure graphs. RECOMB 2004: 308-315
142EEDeepak Bandyopadhyay, Jack Snoeyink: Almost-Delaunay simplices: nearest neighbor relations for imprecise points. SODA 2004: 410-419
141EEMichael J. Spriggs, J. Mark Keil, Sergei Bespamyatnikh, Michael Segal, Jack Snoeyink: Computing a (1+epsilon)-Approximate Geometric Minimum-Diameter Spanning Tree. Algorithmica 38(4): 577-589 (2004)
140EEJulie Glass, Stefan Langerman, Joseph O'Rourke, Jack Snoeyink, Jianyuan K. Zhong: A 2-chain can interlock with a k-chain CoRR cs.CG/0410052: (2004)
139EESergio Cabello, Yuanxin Liu, Andrea Mantler, Jack Snoeyink: Testing Homotopy for Paths in the Plane. Discrete & Computational Geometry 31(1): 61-81 (2004)
138EEHee-Kap Ahn, Siu-Wing Cheng, Otfried Cheong, Jack Snoeyink: The reflex-free hull. Int. J. Comput. Geometry Appl. 14(6): 453-474 (2004)
2003
137 Michael J. Spriggs, J. Mark Keil, Sergei Bespamyatnikh, Michael Segal, Jack Snoeyink: Approximating the geometric minimum-diameter spanning tree. CCCG 2003: 39-42
136EEMartin Isenburg, Jack Snoeyink: Compressing Texture Coordinates with Selective Linear Predictions. Computer Graphics International 2003: 126-133
135 Martin Isenburg, Peter Lindstrom, Stefan Gumhold, Jack Snoeyink: Large Mesh Simplification using Processing Sequences. IEEE Visualization 2003: 465-472
134 Hamish Carr, Jack Snoeyink: Path Seeds and Flexible Isosurfaces - Using Topology for Exploratory Visualization. VisSym 2003
133EEMartin Isenburg, Jack Snoeyink: Binary compression rates for ASCII formats. Web3D 2003: 173-178
132 Marshall W. Bern, Erik D. Demaine, David Eppstein, Eric Kuo, Andrea Mantler, Jack Snoeyink: Ununfoldable polyhedra with convex faces. Comput. Geom. 24(2): 51-62 (2003)
131 Hamish Carr, Jack Snoeyink, Ulrike Axen: Computing contour trees in all dimensions. Comput. Geom. 24(2): 75-94 (2003)
130 Lutz Kettner, David G. Kirkpatrick, Andrea Mantler, Jack Snoeyink, Bettina Speckmann, Fumihiko Takeuchi: Tight degree bounds for pseudo-triangulations of points. Comput. Geom. 25(1-2): 3-12 (2003)
129 Lutz Kettner, Jarek Rossignac, Jack Snoeyink: The Safari interface for visualizing time-dependent volume data using iso-surfaces and contour spectra. Comput. Geom. 25(1-2): 97-116 (2003)
128EEErik D. Demaine, Stefan Langerman, Joseph O'Rourke, Jack Snoeyink: Interlocked open and closed linkages with few joints. Comput. Geom. 26(1): 37-45 (2003)
127EEJoel Hass, Jack Snoeyink, William P. Thurston: The Size of Spanning Disks for Polygonal Curves. Discrete & Computational Geometry 29(1): 1-17 (2003)
126EETetsuo Asano, Mark de Berg, Otfried Cheong, Leonidas J. Guibas, Jack Snoeyink, Hisao Tamaki: Spanning Trees Crossing Few Barriers. Discrete & Computational Geometry 30(4): 591-606 (2003)
2002
125EEMartin Isenburg, Jack Snoeyink: Coding with ASCII: compact, yet text-based 3D content. 3DPVT 2002: 609-617
124EESergio Cabello, Yuanxin Liu, Andrea Mantler, Jack Snoeyink: Testing Homotopy for paths in the plane. Symposium on Computational Geometry 2002: 160-169
123EEErik D. Demaine, Stefan Langerman, Joseph O'Rourke, Jack Snoeyink: Interlocked open linkages with few joints. Symposium on Computational Geometry 2002: 189-198
122EEMartin Isenburg, Jack Snoeyink: Coding polygon meshes as compressable ASCII. Web3D 2002: 1-10
121EEPankaj K. Agarwal, Leonidas J. Guibas, Herbert Edelsbrunner, Jeff Erickson, Michael Isard, Sariel Har-Peled, John Hershberger, Christian S. Jensen, Lydia E. Kavraki, Patrice Koehl, Ming C. Lin, Dinesh Manocha, Dimitris N. Metaxas, Brian Mirtich, David M. Mount, S. Muthukrishnan, Dinesh K. Pai, Elisha Sacks, Jack Snoeyink, Subhash Suri, Ouri Wolfson: Algorithmic issues in modeling motion. ACM Comput. Surv. 34(4): 550-572 (2002)
120EEGill Barequet, Danny Z. Chen, Ovidiu Daescu, Michael T. Goodrich, Jack Snoeyink: Efficiently Approximating Polygonal Paths in Three and Higher Dimensions. Algorithmica 33(2): 150-167 (2002)
119EEProsenjit Bose, Ferran Hurtado, Elsa Omaña-Pulido, Jack Snoeyink, Godfried T. Toussaint: Some Aperture-Angle Optimization Problems. Algorithmica 33(4): 411-435 (2002)
118EEMartin Isenburg, Jack Snoeyink: Compressing the Property Mapping of Polygon Meshes. Graphical Models 64(2): 114-127 (2002)
117 David G. Kirkpatrick, Jack Snoeyink, Bettina Speckmann: Kinetic Collision Detection for Simple Polygons. Int. J. Comput. Geometry Appl. 12(1-2): 3-27 (2002)
116EEJ. Mark Keil, Jack Snoeyink: On the Time Bound for Convex Decomposition of Simple Polygons. Int. J. Comput. Geometry Appl. 12(3): 181-192 (2002)
2001
115 Adam L. Buchsbaum, Jack Snoeyink: Algorithm Engineering and Experimentation, Third International Workshop, ALENEX 2001, Washington, DC, USA, January 5-6, 2001, Revised Papers Springer 2001
114EEAndrea Mantler, Jack Snoeyink: Heaphull?. CCCG 2001: 129-131
113EEDana Randall, Günter Rote, Francisco Santos, Jack Snoeyink: Counting triangulations and pseudo-triangulations of wheels. CCCG 2001: 149-152
112EEJack Snoeyink: The arithmetic precision of ray-polygon intersection testing. CCCG 2001: 161-164
111EEHee-Kap Ahn, Siu-Wing Cheng, Otfried Cheong, Jack Snoeyink: The reflex-free hull. CCCG 2001: 9-12
110EEHamish Carr, Torsten Möller, Jack Snoeyink: Simplicial Subdivisions and Sampling Artifacts. IEEE Visualization 2001
109EEJack Snoeyink, Subhash Suri, George Varghese: A Lower Bound for Multicast Key Distribution. INFOCOM 2001: 422-431
108EEMartin Isenburg, Jack Snoeyink: Compressing the Property Mapping of Polygon Meshes. Pacific Conference on Computer Graphics and Applications 2001: 4-11
107EEDanny Z. Chen, Ovidiu Daescu, John Hershberger, Peter M. Kogge, Jack Snoeyink: Polygonal path approximation with angle constraints. SODA 2001: 342-343
106EELutz Kettner, Jack Snoeyink: A prototype system for visualizing time-dependent volume data. Symposium on Computational Geometry 2001: 327-328
105EEChristopher M. Gold, Jack Snoeyink: A One-Step Crust and Skeleton Extraction Algorithm. Algorithmica 30(2): 144-163 (2001)
104 Martin Isenburg, Jack Snoeyink: Spirale Reversi: Reverse decoding of the Edgebreaker encoding. Comput. Geom. 20(1-2): 39-52 (2001)
103 Robert L. (Scot) Drysdale III, Scott A. McElfresh, Jack Snoeyink: On exclusion regions for optimal triangulations. Discrete Applied Mathematics 109(1-2): 49-65 (2001)
102EEBettina Speckmann, Jack Snoeyink: Easy triangle strips for TIN terrain models. International Journal of Geographical Information Science 15(4): 379-386 (2001)
2000
101EEMartin Isenburg, Jack Snoeyink: Spirale Reversi: Reverse Decoding of the Edgebreaker Encoding. CCCG 2000
100EEAndrea Mantler, Jack Snoeyink: Intersecting Red and Blue Line Segments in Optimal Time and Precision. JCDCG 2000: 244-251
99EEMartin Isenburg, Jack Snoeyink: Face fixer: compressing polygon meshes with properties. SIGGRAPH 2000: 263-270
98EEHamish Carr, Jack Snoeyink, Ulrike Axen: Computing contour trees in all dimensions. SODA 2000: 918-926
97EELeonidas J. Guibas, Jack Snoeyink, Li Zhang: Compact Voronoi Diagrams for Moving Convex Polygons. SWAT 2000: 339-352
96EEDavid G. Kirkpatrick, Jack Snoeyink, Bettina Speckmann: Kinetic collision detection for simple polygons. Symposium on Computational Geometry 2000: 322-330
95EEMartin Isenburg, Jack Snoeyink: The face fixer video. Symposium on Computational Geometry 2000: 377-378
94 Sergei Bespamyatnikh, Jack Snoeyink: Queries with segments in Voronoi diagrams. Comput. Geom. 16(1): 23-33 (2000)
93 Jean-Daniel Boissonnat, Jack Snoeyink: Efficient algorithms for line and curve segment intersection using restricted predicates. Comput. Geom. 16(1): 35-52 (2000)
92EESergei Bespamyatnikh, David G. Kirkpatrick, Jack Snoeyink: Generalizing Ham Sandwich Cuts to Equitable Subdivisions. Discrete & Computational Geometry 24(4): 605-622 (2000)
91EEPierre Alliez, Olivier Devillers, Jack Snoeyink: Removing Degeneracies by Perturbing the Problem or Perturbing the World. Reliable Computing 6(1): 61-79 (2000)
1999
90EERobert J. Walker, Jack Snoeyink: Practical Point-in-Polygon Tests Using CSG Representations of Polygons. ALENEX 1999: 114-123
89EEMartin Isenburg, Jack Snoeyink: Mesh Collapse Compression. SIBGRAPI 1999: 27-28
88EESergei Bespamyatnikh, Jack Snoeyink: Queries with Segments in Voronoi Diagrams. SODA 1999: 122-129
87EEMarc J. van Kreveld, Joseph S. B. Mitchell, Peter Rousseeuw, Micha Sharir, Jack Snoeyink, Bettina Speckmann: Efficient Algorithms for Maximum Regression Depth. Symposium on Computational Geometry 1999: 31-40
86EEJean-Daniel Boissonnat, Jack Snoeyink: Efficient Algorithms for Line and Curve Segment Intersection Using Restricted Predicates. Symposium on Computational Geometry 1999: 370-379
85EETetsuo Asano, Mark de Berg, Otfried Cheong, Leonidas J. Guibas, Jack Snoeyink, Hisao Tamaki: Spanning Trees Crossing Few Barriers. Symposium on Computational Geometry 1999: 41-48
84EEMartin Isenburg, Jack Snoeyink: Mesh Collapse Compression. Symposium on Computational Geometry 1999: 419-420
83EESergei Bespamyatnikh, David G. Kirkpatrick, Jack Snoeyink: Generalizing Ham Sandwich Cuts to Equitable Subdivisions. Symposium on Computational Geometry 1999: 49-58
82EEMarshall W. Bern, Erik D. Demaine, David Eppstein, Eric Kuo, Andrea Mantler, Jack Snoeyink: Ununfoldable Polyhedra with Convex Faces CoRR cs.CG/9908003: (1999)
81EEMarshall W. Bern, David Eppstein, Pankaj K. Agarwal, Nina Amenta, L. Paul Chew, Tamal K. Dey, David P. Dobkin, Herbert Edelsbrunner, Cindy Grimm, Leonidas J. Guibas, John Harer, Joel Hass, Andrew Hicks, Carroll K. Johnson, Gilad Lerman, David Letscher, Paul E. Plassmann, Eric Sedgwick, Jack Snoeyink, Jeff Weeks, Chee-Keng Yap, Denis Zorin: Emerging Challenges in Computational Topology CoRR cs.CG/9909001: (1999)
80 Simon Kahan, Jack Snoeyink: On the bit complexity of minimum link paths: Superquadratic algorithms for problem solvable in linear time. Comput. Geom. 12(1-2): 33-44 (1999)
79EEFrancis Y. L. Chin, Jack Snoeyink, Cao An Wang: Finding the Medial Axis of a Simple Polygon in Linear Time. Discrete & Computational Geometry 21(3): 405-420 (1999)
78EEJack Snoeyink: Cross-Ratios and Angles Determine a Polygon. Discrete & Computational Geometry 22(4): 619-631 (1999)
77 David G. Kirkpatrick, Jack Snoeyink: Computing Constrained Shortest Segments: Butterfly Wingspans in Logarithmic Time. Int. J. Comput. Geometry Appl. 9(1): 53- (1999)
1998
76EEJ. Mark Keil, Jack Snoeyink: On the time bound for convex decomposition of simple polygons. CCCG 1998
75EEPierre Alliez, Olivier Devillers, Jack Snoeyink: Removing degeneracies by perturbing the problem or perturbing the world. CCCG 1998
74EEJack Snoeyink: Cross-Ratios and Angles Determine a Polygon. Symposium on Computational Geometry 1998: 49-57
73EERonald Beirouti, Jack Snoeyink: Implementations of the LMT Heuristic for Minimum Weight Triangulation. Symposium on Computational Geometry 1998: 96-105
72 John Hershberger, Jack Snoeyink: Cartographic line simplification and polygon CSG formulæ in O(nlog * n) time. Comput. Geom. 11(3-4): 175-185 (1998)
71 John Hershberger, Jack Snoeyink: Erased arrangements of lines and convex decompositions of polyhedra. Comput. Geom. 9(3): 129-143 (1998)
70EEJesus Garcia-Lopez, Pedro A. Ramos, Jack Snoeyink: Fitting a Set of Points by a Circle. Discrete & Computational Geometry 20(3): 389-402 (1998)
1997
69 Bettina Speckmann, Jack Snoeyink: Easy triangle strips for tin terrain models. CCCG 1997
68EEJack Snoeyink, Marc J. van Kreveld: Linear-Time Reconstruction of Delaunay Triangulations with Applications. ESA 1997: 459-471
67EEJack Snoeyink, Marc J. van Kreveld: Good Orders for Incremental (Re)construction. Symposium on Computational Geometry 1997: 400-402
66 John Hershberger, Jack Snoeyink: Cartographic Line Simplification and Polygon CSG Formulae and in O(n log* n) Time. WADS 1997: 93-103
65EETimothy M. Chan, Jack Snoeyink, Chee-Keng Yap: Primal Dividing and Dual Pruning: Output-Sensitive Construction of Four-Dimensional Polytopes and Three-Dimensional Voronoi Diagrams. Discrete & Computational Geometry 18(4): 433-454 (1997)
64EEProsenjit Bose, Michael McAllister, Jack Snoeyink: Optimal Algorithms to Embed Trees in a Point Set. J. Graph Algorithms Appl. 1: (1997)
1996
63 Prosenjit Bose, William S. Evans, David G. Kirkpatrick, Michael McAllister, Jack Snoeyink: Approximating Shortest Paths in Arrangements of Lines. CCCG 1996: 143-148
62 Mark de Berg, Prosenjit Bose, Katrin Dobrindt, Marc J. van Kreveld, Mark H. Overmars, Marko de Groot, Thomas Roos, Jack Snoeyink, Sidi Yu: The Complexity of Rivers in Triangulated Terrains. CCCG 1996: 325-330
61EESimon Kahan, Jack Snoeyink: On the Bit Complexity of Minimum Link Paths: Superquadratic Algorithms for Problems Solvable in Linear Time. Symposium on Computational Geometry 1996: 151-158
60EEDavid Avis, Prosenjit Bose, Godfried T. Toussaint, Thomas C. Shermer, Binhai Zhu, Jack Snoeyink: On the Sectional Area of Convex Polytopes. Symposium on Computational Geometry 1996: C-11-C-12
59EEPatrice Belleville, J. Mark Keil, Michael McAllister, Jack Snoeyink: On Computing Edges That Are In All Minimum-Weight Triangulations. Symposium on Computational Geometry 1996: V-7-V-8
58 Mark de Berg, Marc J. van Kreveld, Otfried Schwarzkopf, Jack Snoeyink: Point Location in Zones of K-flats in Arrangements. Comput. Geom. 6: 131-143 (1996)
57 Zhu Chong, Gopalakrishnan Sundaram, Jack Snoeyink, Joseph S. B. Mitchell: Generating Random Polygons with Given Vertices. Comput. Geom. 6: 277-290 (1996)
56EEMichael McAllister, David G. Kirkpatrick, Jack Snoeyink: A Compact Piecewise-Linear Voronoi Diagram for Convex Sites in the Plane. Discrete & Computational Geometry 15(1): 73-105 (1996)
55EEMarc J. van Kreveld, Jack Snoeyink, Sue Whitesides: Folding Rulers Inside Triangles. Discrete & Computational Geometry 15(3): 265-285 (1996)
54 Joseph Friedman, John Hershberger, Jack Snoeyink: Efficiently Planning Compliant Motion in the Plane. SIAM J. Comput. 25(3): 562-599 (1996)
1995
53 Prosenjit Bose, Michael McAllister, Jack Snoeyink: Optimal Algorithms to Embed Trees in a Point Set. Graph Drawing 1995: 64-75
52EEFrancis Y. L. Chin, Jack Snoeyink, Cao An Wang: Finding the Medial Axis of a Simple Polygon in Linear Time. ISAAC 1995: 382-391
51 Timothy M. Chan, Jack Snoeyink, Chee-Keng Yap: Output-Sensitive Construction of Polytopes in Four Dimensions and Clipped Voronoi Diagrams in Three. SODA 1995: 282-291
50EED. S. Andrews, Jack Snoeyink: Geometry in GIS is not Combinatorial: Segment Intersection for Polygon Overlay. Symposium on Computational Geometry 1995: C24-C25
49 David G. Kirkpatrick, Jack Snoeyink: Computing Common Tangents Without a Separating Line. WADS 1995: 183-193
48 David G. Kirkpatrick, Jack Snoeyink: Tentative Prune-and-Search for Computing Fixed-Points with Applications to Geometric Computation. Fundam. Inform. 22(4): 353-370 (1995)
47 Mark de Berg, Marc J. van Kreveld, Jack Snoeyink: Two- and Three-Dimensional Point Location in Rectangular Subdivisions. J. Algorithms 18(2): 256-277 (1995)
1994
46 John Hershberger, Jack Snoeyink: An Efficient Solution to the Zookeeper's Problem. CCCG 1994: 104-109
45 Chong Zhu, Gopalakrishnan Sundaram, Jack Snoeyink, Joseph S. B. Mitchell: Generating Random x-Monotone Polygons with Given Vertices. CCCG 1994: 189-194
44EEJohn Hershberger, Jack Snoeyink: An O(n log n) Implementation of the Douglas-Peucker Algorithm for Line Simplification. Symposium on Computational Geometry 1994: 383-384
43 Christian Schwarz, Michiel H. M. Smid, Jack Snoeyink: An Optimal Algorithm for the On-Line Closest-Pair Problem. Algorithmica 12(1): 18-29 (1994)
42 Mark de Berg, Dan Halperin, Mark H. Overmars, Jack Snoeyink, Marc J. van Kreveld: Efficient Ray Shooting and Hidden Surface Removal. Algorithmica 12(1): 30-53 (1994)
41 Bernard Chazelle, Herbert Edelsbrunner, Michelangelo Grigni, Leonidas J. Guibas, John Hershberger, Micha Sharir, Jack Snoeyink: Ray Shooting in Polygons Using Geodesic Triangulations. Algorithmica 12(1): 54-68 (1994)
40 Larry Palazzi, Jack Snoeyink: Counting and Reporting Red/Blue Segment Intersections. CVGIP: Graphical Model and Image Processing 56(4): 304-310 (1994)
39 John Hershberger, Jack Snoeyink: Computing Minimum Length Paths of a Given Homotopy Class. Comput. Geom. 4: 63-97 (1994)
38 Jack Snoeyink, Jorge Stolfi: Objects that Cannot Be Taken Apart with Two Hands. Discrete & Computational Geometry 12: 367-384 (1994)
37 John Adegeest, Mark H. Overmars, Jack Snoeyink: Minimum-link C-oriented paths: Single-source queries. Int. J. Comput. Geometry Appl. 4(1): 39-51 (1994)
1993
36 Marc J. van Kreveld, Jack Snoeyink, Sue Whitesides: Folding Rulers inside Triangles. CCCG 1993: 1-6
35 David G. Kirkpatrick, Jack Snoeyink: Computing Constrained Shortest Segments: Butterfly Wingspans in Logarithmic Time. CCCG 1993: 163-168
34 Günter Rote, Christian Schwarz, Jack Snoeyink: Maintaining the Approximate Width of a Set of Points in the Plane. CCCG 1993: 258-263
33 Michael McAllister, Jack Snoeyink: Two-dimensional Computation of the Three-dimensional Reachable Region for a Welding Head. CCCG 1993: 437-442
32 Michael McAllister, David G. Kirkpatrick, Jack Snoeyink: A Compact Piecewise-Linear Voronoi Diagram for Convex Sites in the Plane FOCS 1993: 573-582
31EEDavid G. Kirkpatrick, Jack Snoeyink: Tentative Prune-and-Search for Computing Voronoi Vertices. Symposium on Computational Geometry 1993: 133-142
30EEJack Snoeyink, Jorge Stolfi: Objects That Cannot be Taken Apart with Two Hands. Symposium on Computational Geometry 1993: 247-256
29EEJack Snoeyink: Video: Objects that Cannot be Taken Apart with Two Hands. Symposium on Computational Geometry 1993: 405
28 Larry Palazzi, Jack Snoeyink: Counting and Reporting Red/Blue Segment Intersections. WADS 1993: 530-540
27 David P. Dobkin, Leonidas J. Guibas, John Hershberger, Jack Snoeyink: An Efficient Algorithm for Finding the CSG Representation of a Simple Polygon. Algorithmica 10(1): 1-23 (1993)
26 Leonidas J. Guibas, John Hershberger, Joseph S. B. Mitchell, Jack Snoeyink: Approximating Polygons and Subdivisions with Minimum Link Paths. Int. J. Comput. Geometry Appl. 3(4): 383-415 (1993)
25 Bernard Chazelle, Herbert Edelsbrunner, Leonidas J. Guibas, Micha Sharir, Jack Snoeyink: Computing a Face in an Arrangement of Line Segments and Related Problems. SIAM J. Comput. 22(6): 1286-1302 (1993)
1992
24EEEric Guévremont, Jack Snoeyink: Recognizing an Envelope of Lines in Linear Time. ISAAC 1992: 370-377
23EEMark de Berg, Marc J. van Kreveld, Jack Snoeyink: Two- and Three-Dimensional Point Location in Rectangular Subdivisions (Extended Abstract). SWAT 1992: 352-363
22EEJohn Hershberger, Jack Snoeyink: Convex Polygons Made from Few Lines and Convex Decompositions of Polyhedra. SWAT 1992: 376-387
21EEChristian Schwarz, Michiel H. M. Smid, Jack Snoeyink: An Optimal Algorithm for the On-Line Closest-Pair Problem. Symposium on Computational Geometry 1992: 330-336
1991
20EEBernard Chazelle, Herbert Edelsbrunner, Michelangelo Grigni, Leonidas J. Guibas, John Hershberger, Micha Sharir, Jack Snoeyink: Ray Shooting in Polygons Using Geodesic Triangulations. ICALP 1991: 661-646
19 Leonidas J. Guibas, John Hershberger, Joseph S. B. Mitchell, Jack Snoeyink: Approximating Polygons and Subdivisions with Minimum Link Paths. ISA 1991: 151-162
18 Bernard Chazelle, Herbert Edelsbrunner, Leonidas J. Guibas, Micha Sharir, Jack Snoeyink: Computing a Face in an Arrangement of Line Segments. SODA 1991: 441-448
17EEMark de Berg, Dan Halperin, Mark H. Overmars, Jack Snoeyink, Marc J. van Kreveld: Efficient Ray Shooting and Hidden Surface Removal. Symposium on Computational Geometry 1991: 21-30
16 John Hershberger, Jack Snoeyink: Computing Minimum Length Paths of a Given Homotopy Class (Extended Abstract). WADS 1991: 331-342
15 Bernard Chazelle, Herbert Edelsbrunner, Leonidas J. Guibas, Richard Pollack, Raimund Seidel, Micha Sharir, Jack Snoeyink: Counting and Cutting Cycles of Lines and Rods in Space. Comput. Geom. 1: 305-323 (1991)
14 Leonidas J. Guibas, John Hershberger, Jack Snoeyink: Compact interval trees: a data structure for convex hulls. Int. J. Comput. Geometry Appl. 1(1): 1-22 (1991)
1990
13 Bernard Chazelle, Herbert Edelsbrunner, Leonidas J. Guibas, Richard Pollack, Raimund Seidel, Micha Sharir, Jack Snoeyink: Counting and Cutting Cycles of Lines and Rods in Space FOCS 1990: 242-251
12 Leonidas J. Guibas, John Hershberger, Jack Snoeyink: Compact Interval Trees: A Data Structure for Convex Hulls. SODA 1990: 169-178
11EEJoseph Friedman, John Hershberger, Jack Snoeyink: Input-Sensitive Compliant Motion in the Plane. SWAT 1990: 225-237
10EEJack Snoeyink: A Trivial Knot Whose Spanning Disks Have Exponential Size. Symposium on Computational Geometry 1990: 139-147
9 Michael T. Goodrich, Jack Snoeyink: Stabbing Parallel Segments with a Convex Polygon. Computer Vision, Graphics, and Image Processing 49(2): 152-170 (1990)
1989
8EEJoseph Friedman, John Hershberger, Jack Snoeyink: Compliant Motion in a Simple Polygon. Symposium on Computational Geometry 1989: 175-186
7EEJack Snoeyink, John Hershberger: Sweeping Arrangements of Curves. Symposium on Computational Geometry 1989: 354-363
6 Michael T. Goodrich, Jack Snoeyink: Stabbing Parallel Segments with a Convex Polygon (Extended Abstract). WADS 1989: 231-242
5 Herbert Edelsbrunner, Leonidas J. Guibas, John Hershberger, Raimund Seidel, Micha Sharir, Jack Snoeyink, Emo Welzl: Implicitly Representing Arrangements of Lines or Segments. Discrete & Computational Geometry 4: 433-466 (1989)
4 Herbert Edelsbrunner, Leonidas J. Guibas, John Hershberger, János Pach, Richard Pollack, Raimund Seidel, Micha Sharir, Jack Snoeyink: On Arrangement of Jordan Arcs with Three Intersection per Pair. Discrete & Computational Geometry 4: 523-539 (1989)
1988
3EEDavid P. Dobkin, Leonidas J. Guibas, John Hershberger, Jack Snoeyink: An efficient algorithm for finding the CSG representation of a simple polygon. SIGGRAPH 1988: 31-40
2EEHerbert Edelsbrunner, Leonidas J. Guibas, John Hershberger, János Pach, Richard Pollack, Raimund Seidel, Micha Sharir, Jack Snoeyink: On Arrangements of Jordan Arcs with Three Intersections per Pair. Symposium on Computational Geometry 1988: 258-265
1EEHerbert Edelsbrunner, Leonidas J. Guibas, John Hershberger, Raimund Seidel, Micha Sharir, Jack Snoeyink, Emo Welzl: Implicitly Representing Arrangements of Lines or Segments. Symposium on Computational Geometry 1988: 56-69

Coauthor Index

1John Adegeest [37]
2Pankaj K. Agarwal [81] [121]
3Hee-Kap Ahn [111] [138]
4Pierre Alliez [75] [91]
5Nina Amenta [81]
6D. S. Andrews [50]
7W. Bryan Arendall III [173]
8Esther M. Arkin [181] [184]
9Tetsuo Asano [85] [126]
10David Avis [60]
11Ulrike Axen [98] [131]
12Deepak Bandyopadhyay [142] [143] [149] [176]
13Gill Barequet [120]
14Suddha Basu [182]
15Ronald Beirouti [73]
16Patrice Belleville [59]
17Marc Benkert [189]
18Sergey Bereg (Sergei Bespamyatnikh) [83] [88] [92] [94] [137] [141]
19Mark de Berg [17] [23] [42] [47] [58] [62] [85] [126]
20Marshall W. Bern [81] [82] [132]
21Talapady Bhat [190]
22Binay K. Bhattacharya [193]
23Arijit Bishnu [193]
24Jeremy N. Block [173]
25Jean-Daniel Boissonnat [86] [93] [148] [165] [166]
26Prosenjit Bose [53] [60] [62] [63] [64] [119]
27Hervé Brönnimann [162] [163]
28Adam L. Buchsbaum [115]
29Glenn L. Butterfoss [175]
30Sergio Cabello [124] [139]
31Hamish Carr [98] [110] [131] [134] [144] [164]
32Timothy M. Chan [51] [65]
33Bernard Chazelle [13] [15] [18] [20] [25] [41]
34Danny Z. Chen [107] [120] [153]
35Vincent B. Chen [173]
36Siu-Wing Cheng [111] [138]
37Otfried Cheong (Otfried Schwarzkopf) [58] [85] [111] [126] [138] [193]
38L. Paul Chew [81]
39Francis Y. L. Chin (Francis Yuk-Lun Chin) [52] [79]
40Zhu Chong [57]
41Ovidiu Daescu [107] [120] [153]
42Sandip Das [193]
43Ian W. Davis [173]
44Erik D. Demaine [82] [123] [128] [132]
45Olivier Devillers [75] [91]
46Tamal K. Dey [81]
47David P. Dobkin [3] [27] [81]
48Katrin Dobrindt [62]
49Robert L. Scot Drysdale (Robert L. (Scot) Drysdale III) [103]
50Herbert Edelsbrunner [1] [2] [4] [5] [13] [15] [18] [20] [25] [41] [81] [121] [188]
51David Eppstein [81] [82] [132]
52Jeff Erickson [121]
53William S. Evans [63]
54Craig Falls [159]
55Joseph Friedman [8] [11] [54]
56Jesus Garcia-Lopez [70]
57Julie Glass [140]
58Christopher M. Gold [105]
59Michael T. Goodrich [6] [9] [120]
60Michelangelo Grigni [20] [41]
61Cindy Grimm (Cindy M. Grimm) [81]
62Marko de Groot [62]
63Eric Guévremont [24]
64Leonidas J. Guibas [1] [2] [3] [4] [5] [12] [13] [14] [15] [18] [19] [20] [25] [26] [27] [41] [81] [85] [97] [121] [126]
65Stefan Gumhold [135]
66Dan Halperin [17] [42]
67Sariel Har-Peled [121]
68John Harer [81] [188]
69Joel Hass [81] [127]
70Christopher G. Healey [172]
71John Hershberger [1] [2] [3] [4] [5] [7] [8] [11] [12] [14] [16] [19] [20] [22] [26] [27] [39] [41] [44] [46] [54] [66] [71] [72] [107] [121] [153]
72Andrew Hicks [81]
73Jun Huan [143] [149] [180]
74Ferran Hurtado [119]
75Michael Isard [121]
76Martin Isenburg [84] [89] [95] [99] [101] [104] [108] [118] [122] [125] [133] [135] [136] [147] [151] [156] [167] [168] [170] [171]
77Christian S. Jensen [121]
78Carroll K. Johnson [81]
79Tao Ju [190]
80Simon Kahan [61] [80]
81Gary J. Kapral [173]
82Arindam Karmakar [193]
83Lydia E. Kavraki [121]
84J. Mark Keil [59] [76] [116] [137] [141]
85Lutz Kettner [106] [129] [130] [162] [163]
86David G. Kirkpatrick [31] [32] [35] [48] [49] [56] [63] [77] [83] [92] [96] [117] [130]
87Patrice Koehl [121]
88Peter M. Kogge [107] [153]
89Marc J. van Kreveld [17] [23] [36] [42] [47] [55] [58] [62] [67] [68] [87] [187] [189]
90Brian Kuhlman [155] [158] [175] [192]
91Eric Kuo [82] [132]
92Stefan Langerman [123] [128] [140]
93Andrew Leaver-Fay [146] [155] [158] [173] [175] [177] [192]
94Gilad Lerman [81]
95David Letscher [81]
96Ming C. Lin [121]
97Peter Lindstrom [135] [151] [156]
98Yuanxin Liu [124] [139] [146] [159] [167] [168] [171] [177] [179] [183]
99Maarten Löffler [191]
100Dinesh Manocha [121]
101Andrea Mantler [82] [100] [114] [124] [130] [132] [139] [145]
102Ajith Mascarenhas [147] [157] [188]
103Michael McAllister [32] [33] [53] [56] [59] [63] [64]
104Scott A. McElfresh [103]
105Dimitris N. Metaxas [121]
106Ningfang Mi [153]
107David L. Millman [194]
108Brian Mirtich [121]
109Joseph S. B. Mitchell [19] [26] [45] [57] [87] [181] [184] [187] [189]
110Torsten Möller [110] [164]
111David M. Mount [121]
112Laura Weston Murray [173]
113S. Muthukrishnan (S. Muthu Muthukrishnan) [121]
114Kimberly Noonan [150]
115Ruth Nussinov [190]
116David O'Brien [150]
117Joseph O'Rourke [123] [128] [140]
118Elsa Omaña-Pulido [119]
119Mark H. Overmars [17] [37] [42] [62]
120János Pach [2] [4]
121Dinesh K. Pai [121]
122Larry Palazzi [28] [40]
123Michiel van de Panne [144]
124Valerio Pascucci [147] [188]
125Paul E. Plassmann [81]
126Michel Pocchiola [162] [163]
127Richard Pollack [2] [4] [13] [15]
128Jan Prins [143] [149]
129Karthik Ramani [190]
130Pedro A. Ramos [70]
131Dana Randall [113]
132Andreas Razen [186]
133Iris Reinbacher [189]
134David C. Richardson [173]
135Jane S. Richardson [173]
136Thomas Roos [62]
137Jarek Rossignac [129]
138Günter Rote [34] [113]
139Peter Rousseeuw [87] [187]
140Elisha Sacks [121]
141Francisco Santos [113]
142Christian Schwarz [21] [34] [43]
143Eric Sedgwick [81]
144Michael Segal [137] [141]
145Raimund Seidel [1] [2] [4] [5] [13] [15]
146Micha Sharir [1] [2] [4] [5] [13] [15] [18] [20] [25] [41] [87] [187]
147Thomas C. Shermer [60]
148Jonathan Richard Shewchuk [167] [168] [171]
149Michiel H. M. Smid [21] [43]
150Diane L. Souvaine [159]
151Bettina Speckmann [69] [87] [96] [102] [117] [130] [187]
152Michael J. Spriggs [137] [141]
153Jorge Stolfi [30] [38]
154Ileana Streinu [161]
155Gopalakrishnan Sundaram [45] [57]
156Subhash Suri [109] [121] [152]
157Fumihiko Takeuchi [130]
158Hisao Tamaki [85] [126]
159Tim Thirion [171]
160William P. Thurston [127]
161Godfried T. Toussaint [60] [119]
162Alexander Tropsha [143] [149]
163George Varghese [109] [152]
164Robert J. Walker [90]
165Cao An Wang [52] [79]
166Xueyi Wang [173] [177] [178] [180] [185]
167Wei Wang [143] [149] [180]
168Jeff Weeks [81]
169Emo Welzl [1] [5] [186]
170Sue Whitesides [36] [55]
171Alexander Wolff [189]
172Ouri Wolfson [121]
173Yulai Xie [169]
174Jinhui Xu [169]
175Chee-Keng Yap (Chee Yap) [51] [65] [81]
176Sidi Yu [62]
177Li Zhang [97]
178Jianyuan K. Zhong [140]
179Binhai Zhu [60]
180Chong Zhu [45]
181Denis Zorin [81]

Colors in the list of coauthors

Copyright © Tue Nov 3 08:52:44 2009 by Michael Ley (ley@uni-trier.de)