default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJack Snoeyink
Person information
- affiliation: University of North Carolina at Chapel Hill, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2021
[j91]Binay Bhattacharya, Arijit Bishnu, Otfried Cheong
, Sandip Das, Arindam Karmakar, Jack Snoeyink:
Computation of spatial skyline points. Comput. Geom. 93: 101698 (2021)
2010 – 2019
- 2018
- [j90]Zachary Abel, Erik D. Demaine, Martin L. Demaine, Hiro Ito, Jack Snoeyink, Ryuhei Uehara:
Bumpy pyramid folding. Comput. Geom. 75: 22-31 (2018) - 2017
- [j89]Anna Lubiw, Jack Snoeyink, Hamideh Vosoughpour:
Visibility graphs, dismantlability, and the cops and robbers game. Comput. Geom. 66: 14-27 (2017) - 2016
- [c140]Michael Deakin, Jack Snoeyink:
On the Precision to Sort Line-Quadric Intersections. CCCG 2016: 122-127 - [c139]Jack Snoeyink:
Creating a robust implementation for segment intersection by refinement: A multistage assignment that defines away degeneracies. CCCG 2016: 309-314 - [i8]Anna Lubiw, Jack Snoeyink, Hamideh Vosoughpour:
Visibility Graphs, Dismantlability, and the Cops and Robbers Game. CoRR abs/1601.01298 (2016) - [i7]Michael Deakin, Jack Snoeyink:
On the Precision to Sort Line-Quadric Intersections. CoRR abs/1605.05629 (2016) - 2014
- [j88]Oswin Aichholzer, Greg Aloupis, Erik D. Demaine, Martin L. Demaine, Sándor P. Fekete, Michael Hoffmann, Anna Lubiw, Jack Snoeyink, Andrew Winslow:
Covering Folded Shapes. J. Comput. Geom. 5(1): 150-167 (2014) - [j87]Pinyan Lu, Jack Snoeyink:
Frontiers in algorithmics. Theor. Comput. Sci. 532: 1 (2014) - [c138]Zachary Abel, Erik D. Demaine, Martin L. Demaine, Hiro Ito, Jack Snoeyink, Ryuhei Uehara:
Bumpy Pyramid Folding. CCCG 2014 - [c137]Borislav Karaivanov, Minko Markov, Jack Snoeyink, Tzvetalin S. Vassilev:
Decontaminating Planar Regions by Sweeping with Barrier Curves. CCCG 2014 - [c136]Anna Lubiw, Jack Snoeyink, Hamideh Vosoughpour:
Visibility Graphs, Dismantlability, and the Cops and Robbers Game. CCCG 2014 - [c135]Jack Snoeyink:
Time, Space, and Precision: Revisiting Classic Problems in Computational Geometry with Degree-Driven Analysis, pp. 280. CCCG 2014 - [i6]Oswin Aichholzer, Greg Aloupis, Erik D. Demaine, Martin L. Demaine, Sándor P. Fekete, Michael Hoffmann, Anna Lubiw, Jack Snoeyink, Andrew Winslow:
Covering Folded Shapes. CoRR abs/1405.2378 (2014) - 2013
- [c134]Oswin Aichholzer, Greg Aloupis, Erik D. Demaine, Martin L. Demaine, Sándor P. Fekete, Michael Hoffmann, Anna Lubiw, Jack Snoeyink, Andrew Winslow:
Covering Folded Shapes. CCCG 2013 - 2012
- [c133]David L. Millman, Steven Love, Timothy M. Chan, Jack Snoeyink:
Computing the Nearest Neighbor Transform Exactly with Only Double Precision. ISVD 2012: 66-74 - [e4]Jack Snoeyink, Pinyan Lu, Kaile Su, Lusheng Wang:
Frontiers in Algorithmics and Algorithmic Aspects in Information and Management - Joint International Conference, FAW-AAIM 2012, Beijing, China, May 14-16, 2012. Proceedings. Lecture Notes in Computer Science 7285, Springer 2012, ISBN 978-3-642-29699-4 [contents] - 2011
- [j86]Prosenjit Bose, Luc Devroye, Maarten Löffler, Jack Snoeyink, Vishal Verma:
Almost all Delaunay triangulations have stretch factor greater than pi/2. Comput. Geom. 44(2): 121-127 (2011) - [j85]Therese Biedl, Stephane Durocher, Jack Snoeyink:
Reconstructing polygons from scanner data. Theor. Comput. Sci. 412(32): 4161-4172 (2011) - [c132]Jack Snoeyink:
Degree-Driven Design for Correct Geometric Algorithms. FAW-AAIM 2011: 8-9 - [c131]Sajal Dash, Jack Snoeyink:
On the energy of bifurcated hydrogen bonds for protein structure prediction. BIBM Workshops 2011: 334-337 - [c130]Jack Snoeyink, Vishal Verma:
Fitting spheres to electron density. SCG 2011: 291-292 - 2010
- [j84]Hamish A. Carr, Jack Snoeyink, Michiel van de Panne:
Flexible isosurfaces: Simplifying and displaying scalar topology using the contour tree. Comput. Geom. 43(1): 42-58 (2010) - [j83]Maarten Löffler, Jack Snoeyink:
Delaunay triangulation of imprecise points in linear time after preprocessing. Comput. Geom. 43(3): 234-242 (2010) - [j82]Deepak Bandyopadhyay, Jun Huan, Jinze Liu, Jan F. Prins, Jack Snoeyink, Wei Wang, Alexander Tropsha:
Functional neighbors: inferring relationships between nonhomologous protein families using family-specific packing motifs. IEEE Trans. Inf. Technol. Biomed. 14(5): 1137-1143 (2010) - [c129]Catalin Constantin, Shawn Brown, Jack Snoeyink:
Implementing Streaming Simplification for large Labeled Meshes. ALENEX 2010: 149-158 - [c128]David L. Millman, Matthew O'Meara, Jack Snoeyink, Vishal Verma:
Maximum geodesic routing in the plane with obstacles. CCCG 2010: 107-108 - [c127]David L. Millman, Jack Snoeyink:
Computing planar Voronoi diagrams in double precision: a further example of degree-driven algorithm design. SCG 2010: 386-392 - [c126]Binay K. Bhattacharya, Arijit Bishnu, Otfried Cheong, Sandip Das, Arindam Karmakar, Jack Snoeyink:
Computation of Non-dominated Points Using Compact Voronoi Diagrams. WALCOM 2010: 82-93 - [i5]Prosenjit Bose, Luc Devroye, Maarten Löffler, Jack Snoeyink, Vishal Verma:
The dilation of the Delaunay triangulation is greater than π/2. CoRR abs/1006.0291 (2010)
2000 – 2009
- 2009
- [j81]Deepak Bandyopadhyay, Jun Huan, Jan F. Prins, Jack Snoeyink, Wei Wang, Alexander Tropsha:
Identification of family-specific residue packing motifs and their use for structure-based protein function prediction: I. Method development. J. Comput. Aided Mol. Des. 23(11): 773-784 (2009) - [j80]Deepak Bandyopadhyay, Jun Huan, Jan F. Prins, Jack Snoeyink, Wei Wang, Alexander Tropsha:
Identification of family-specific residue packing motifs and their use for structure-based protein function prediction: II. Case studies and applications. J. Comput. Aided Mol. Des. 23(11): 785-797 (2009) - [c125]Vishal Verma, Jack Snoeyink:
Defining and computing accessibility radius. CCCG 2009: 123-126 - [c124]Prosenjit Bose, Luc Devroye, Maarten Löffler, Jack Snoeyink, Vishal Verma:
The spanning ratio of the Delaunay triangulation is greater than pi/2. CCCG 2009: 165-167 - [c123]Vishal Verma, Jack Snoeyink:
Reducing the memory required to find a geodesic shortest path on a large mesh. GIS 2009: 227-235 - [c122]Therese Biedl, Stephane Durocher, Jack Snoeyink:
Reconstructing Polygons from Scanner Data. ISAAC 2009: 862-871 - [c121]Jur van den Berg, Jack Snoeyink, Ming C. Lin, Dinesh Manocha:
Centralized path planning for multiple robots: Optimal decoupling into sequential plans. Robotics: Science and Systems 2009 - [c120]David L. Millman, Jack Snoeyink:
Computing the Implicit Voronoi Diagram in Triple Precision. WADS 2009: 495-506 - [p2]Ajith Mascarenhas, Jack Snoeyink:
Isocontour based Visualization of Time-varying Scalar Fields. Mathematical Foundations of Scientific Visualization, Computer Graphics, and Massive Data Exploration 2009: 41-68 - [p1]Hamish A. Carr, Jack Snoeyink:
Representing Interpolant Topology for Contour Tree Computation. Topology-Based Methods in Visualization II 2009: 59-73 - [i4]Binay K. Bhattacharya, Arijit Bishnu, Otfried Cheong, Sandip Das, Arindam Karmakar, Jack Snoeyink:
On Finding Non-dominated Points using Compact Voronoi Diagrams. CoRR abs/0909.0814 (2009) - 2008
- [j79]Iris Reinbacher, Marc Benkert, Marc J. van Kreveld, Joseph S. B. Mitchell, Jack Snoeyink, Alexander Wolff:
Delineating Boundaries for Imprecise Regions. Algorithmica 50(3): 386-414 (2008) - [j78]V. Anuradha, Chinmay Jain, Jack Snoeyink, Tibor Szabó:
How Long Can a Graph be Kept Planar? Electron. J. Comb. 15(1) (2008) - [j77]Herbert Edelsbrunner, John Harer, Ajith Mascarenhas, Valerio Pascucci, Jack Snoeyink:
Time-varying Reeb graphs for continuous space-time data. Comput. Geom. 41(3): 149-166 (2008) - [j76]Marc J. van Kreveld, Joseph S. B. Mitchell, Peter J. Rousseeuw, Micha Sharir, Jack Snoeyink, Bettina Speckmann:
Efficient Algorithms for Maximum Regression Depth. Discret. Comput. Geom. 39(4): 656-677 (2008) - [j75]Andreas Razen, Jack Snoeyink, Emo Welzl:
Number of Crossing-Free Geometric Graphs vs. Triangulations. Electron. Notes Discret. Math. 31: 195-200 (2008) - [j74]Yuanxin Liu, Jack Snoeyink:
Faraway Point: a Sentinel Point for Delaunay Computation. Int. J. Comput. Geom. Appl. 18(4): 343-355 (2008) - [j73]Esther M. Arkin, Joseph S. B. Mitchell, Jack Snoeyink:
Capturing crossings: Convex hulls of segment and plane intersections. Inf. Process. Lett. 107(5): 194-197 (2008) - [j72]Xueyi Wang, Jack Snoeyink:
Defining and Computing Optimum RMSD for Gapped and Weighted Multiple-Structure Alignment. IEEE ACM Trans. Comput. Biol. Bioinform. 5(4): 525-533 (2008) - [c119]Deepak Bandyopadhyay, Jun Huan, Jinze Liu, Jan F. Prins, Jack Snoeyink, Wei Wang, Alexander Tropsha:
Functional Neighbors: Inferring Relationships between Non-Homologous Protein Families Using Family-Specific Packing Motifs. BIBM 2008: 199-206 - [c118]Maarten Löffler, Jack Snoeyink:
Delaunay triangulations of imprecise pointsin linear time after preprocessing. SCG 2008: 298-304 - [c117]Andrew Leaver-Fay, Jack Snoeyink, Brian Kuhlman:
On-the-Fly Rotamer Pair Energy Evaluation in Protein Design. ISBRA 2008: 343-354 - [c116]Ruth Nussinov, Tao Ju, Talapady Bhat, Jack Snoeyink, Karthik Ramani:
Bio-geometry: challenges, approaches, and future opportunities in proteomics and drug discovery. Symposium on Solid and Physical Modeling 2008: 417-418 - 2007
- [j71]Deepak Bandyopadhyay, Jack Snoeyink:
Almost-Delaunay simplices: Robust neighbor relations for imprecise 3D points using CGAL. Comput. Geom. 38(1-2): 4-15 (2007) - [j70]Andrew Leaver-Fay, Glenn L. Butterfoss, Jack Snoeyink, Brian Kuhlman:
Maintaining solvent accessible surface area under rotamer substitution for protein design. J. Comput. Chem. 28(8): 1336-1341 (2007) - [j69]Andrew Leaver-Fay, Yuanxin Liu, Jack Snoeyink, Xueyi Wang:
Faster placement of hydrogens in protein structures by dynamic programming. ACM J. Exp. Algorithmics 12: 2.5:1-2.5:16 (2007) - [j68]Ian W. Davis, Andrew Leaver-Fay, Vincent B. Chen, Jeremy N. Block, Gary J. Kapral, Xueyi Wang, Laura Weston Murray, W. Bryan Arendall III, Jack Snoeyink, Jane S. Richardson, David C. Richardson:
MolProbity: all-atom contacts and structure validation for proteins and nucleic acids. Nucleic Acids Res. 35(Web-Server-Issue): 375-383 (2007) - [j67]Jack Snoeyink:
Maximum independent set for intervals by divide and conquer with pruning. Networks 49(2): 158-159 (2007) - [c115]Esther M. Arkin, Joseph S. B. Mitchell, Jack Snoeyink:
Capturing Crossings: Convex Hulls of Segment and Plane Intersections. CCCG 2007: 9-11 - [c114]Suddha Basu, Jack Snoeyink:
Terrain Representation using Right-Triangulated Irregular Networks. CCCG 2007: 133-136 - [c113]Yuanxin Liu, Jack Snoeyink:
Quadratic and cubic b-splines by generalizing higher-order voronoi diagrams. SCG 2007: 150-157 - [c112]Xueyi Wang, Jun Huan, Jack Snoeyink, Wei Wang:
Mining RNA Tertiary Motifs with Structure Graphs. SSDBM 2007: 31 - [c111]Xueyi Wang, Jack Snoeyink:
Defining and Computing Optimum RMSD for Gapped Multiple Structure Alignment. WABI 2007: 196-207 - 2006
- [j66]Jean-Daniel Boissonnat, Jack Snoeyink:
Editorial. Comput. Geom. 35(1-2): 1 (2006) - [j65]Jean-Daniel Boissonnat, Jack Snoeyink:
Guest Editors' Foreword. Discret. Comput. Geom. 36(4): 501-502 (2006) - [j64]Hervé Brönnimann, Lutz Kettner, Michel Pocchiola, Jack Snoeyink:
Counting and Enumerating Pointed Pseudotriangulations with the Greedy Flip Algorithm. SIAM J. Comput. 36(3): 721-739 (2006) - [j63]Martin Isenburg, Yuanxin Liu, Jonathan Richard Shewchuk, Jack Snoeyink:
Streaming computation of Delaunay triangulations. ACM Trans. Graph. 25(3): 1049-1056 (2006) - [j62]Hamish A. Carr, Torsten Möller, Jack Snoeyink:
Artifacts Caused by Simplicial Subdivision. IEEE Trans. Vis. Comput. Graph. 12(2): 231-242 (2006) - [c110]Christopher G. Healey, Jack Snoeyink:
VisTRE: A Visualization Tool to Evaluate Errors in Terrain Representation. 3DPVT 2006: 1056-1063 - [c109]Yulai Xie, Jack Snoeyink, Jinhui Xu:
Efficient algorithm for approximating maximum inscribed sphere in high dimensional polytope. SCG 2006: 21-29 - [c108]Martin Isenburg, Yuanxin Liu, Jonathan Richard Shewchuk, Jack Snoeyink:
Illustrating the streaming construction of 2D delaunay triangulations. SCG 2006: 481-482 - [c107]Martin Isenburg, Yuanxin Liu, Jonathan Richard Shewchuk, Jack Snoeyink, Tim Thirion:
Generating Raster DEM from Mass Points Via TIN Streaming. GIScience 2006: 186-198 - [c106]Martin Isenburg, Jack Snoeyink:
Early-split coding of triangle mesh connectivity. Graphics Interface 2006: 89-97 - [c105]Yuanxin Liu, Jack Snoeyink:
Sphere-based Computation of Delaunay Diagrams on Points from 4d Grids. ISVD 2006: 60-65 - 2005
- [j61]Martin Isenburg, Peter Lindstrom, Jack Snoeyink:
Lossless compression of predicted floating-point geometry. Comput. Aided Des. 37(8): 869-877 (2005) - [j60]Jack Snoeyink, Subhash Suri, George Varghese:
A lower bound for multicast key distribution. Comput. Networks 47(3): 429-441 (2005) - [j59]Jack Snoeyink:
Editorial. Comput. Geom. 31(3): 149 (2005) - [j58]Danny Z. Chen, Ovidiu Daescu, John Hershberger, Peter M. Kogge, Ningfang Mi, Jack Snoeyink:
Polygonal path simplification with angle constraints. Comput. Geom. 32(3): 173-187 (2005) - [j57]Kimberly Noonan, David O'Brien, Jack Snoeyink:
Probik: Protein Backbone Motion by Inverse Kinematics. Int. J. Robotics Res. 24(11): 971-982 (2005) - [j56]Jun Huan, Deepak Bandyopadhyay, Wei Wang, Jack Snoeyink, Jan F. Prins, Alexander Tropsha:
Comparing Graph Representations of Protein Structure for Mining Family-Specific Residue-Based Packing Motifs. J. Comput. Biol. 12(6): 657-671 (2005) - [c104]Hervé Brönnimann, Lutz Kettner, Michel Pocchiola, Jack Snoeyink:
Counting and Enumerating Pointed Pseudo-triangulations with the Greedy Flip Algorithm. ALENEX/ANALCO 2005: 98-110 - [c103]Craig Falls, Yuanxin Liu, Jack Snoeyink, Diane L. Souvaine:
Testing Shortcuts to Maintain Simplicity in Subdivision Simplification. CCCG 2005: 35-38 - [c102]Jack Snoeyink, Ileana Streinu:
Computing Rigid Components of Pseudo-triangulation Mechanisms in Linear Time. CCCG 2005: 223-226 - [c101]Jack Snoeyink:
Maximum Independent Set for Intervals by Divide-Prune-and-Conquer. CCCG 2005: 264-265 - [c100]Ajith Mascarenhas, Jack Snoeyink:
Implementing time-varying contour trees. SCG 2005: 370-371 - [c99]Andrew Leaver-Fay, Brian Kuhlman, Jack Snoeyink:
An Adaptive Dynamic Programming Algorithm for the Side Chain Placement Problem. Pacific Symposium on Biocomputing 2005: 17-28 - [c98]Martin Isenburg, Peter Lindstrom, Jack Snoeyink:
Streaming Compression of Triangle Meshes. Symposium on Geometry Processing 2005: 111-118 - [c97]Martin Isenburg, Peter Lindstrom, Jack Snoeyink:
Streaming compression of triangle meshes. SIGGRAPH Sketches 2005: 136 - [c96]Andrew Leaver-Fay, Brian Kuhlman, Jack Snoeyink:
Rotamer-Pair Energy Calculations Using a Trie Data Structure. WABI 2005: 389-400 - 2004
- [j55]Michael J. Spriggs, J. Mark Keil, Sergei Bespamyatnikh, Michael Segal, Jack Snoeyink:
Computing a (1+epsilon)-Approximate Geometric Minimum-Diameter Spanning Tree. Algorithmica 38(4): 577-589 (2004) - [j54]Sergio Cabello, Yuanxin Liu, Andrea Mantler, Jack Snoeyink:
Testing Homotopy for Paths in the Plane. Discret. Comput. Geom. 31(1): 61-81 (2004) - [j53]Hee-Kap Ahn, Siu-Wing Cheng, Otfried Cheong, Jack Snoeyink:
The reflex-free hull. Int. J. Comput. Geom. Appl. 14(6): 453-474 (2004) - [c95]Ajith Mascarenhas, Martin Isenburg, Valerio Pascucci, Jack Snoeyink:
Encoding Volumetric Grids For Streaming Isosurface Extraction. 3DPVT 2004: 665-672 - [c94]Andrew Leaver-Fay, Yuanxin Liu, Jack Snoeyink:
Faster Placement of Hydrogens in Protein Structures by Dynamic Programming. ALENEX/ANALC 2004: 39-48 - [c93]Andrea Mantler, Jack Snoeyink:
Banana spiders: A study of connectivity in 3d combinatorial rigidity. CCCG 2004: 44-47 - [c92]Jun Huan, Wei Wang, Deepak Bandyopadhyay, Jack Snoeyink, Jan F. Prins, Alexander Tropsha:
Mining protein family specific residue packing patterns from protein structure graphs. RECOMB 2004: 308-315 - [c91]Yuanxin Liu, Jack Snoeyink:
Flooding Triangulated Terrain. SDH 2004: 137-148 - [c90]Deepak Bandyopadhyay, Jack Snoeyink:
Almost-Delaunay simplices: nearest neighbor relations for imprecise points. SODA 2004: 410-419 - [c89]Hamish A. Carr, Jack Snoeyink, Michiel van de Panne:
Simplifying Flexible Isosurfaces Using Local Geometric Measures. IEEE Visualization 2004: 497-504 - [c88]Kimberly Noonan, David O'Brien, Jack Snoeyink:
Probik: Protein Backbone Motion by Inverse Kinematics. WAFR 2004: 377-392 - [e3]Jack Snoeyink, Jean-Daniel Boissonnat:
Proceedings of the 20th ACM Symposium on Computational Geometry, Brooklyn, New York, USA, June 8-11, 2004. ACM 2004, ISBN 1-58113-885-7 [contents] - [r1]Jack Snoeyink:
Point Location. Handbook of Discrete and Computational Geometry, 2nd Ed. 2004: 767-785 - [i3]Julie Glass, Stefan Langerman, Joseph O'Rourke, Jack Snoeyink, Jianyuan K. Zhong:
A 2-chain can interlock with a k-chain. CoRR cs.CG/0410052 (2004) - 2003
- [j52]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) - [j51]Hamish A. Carr, Jack Snoeyink, Ulrike Axen:
Computing contour trees in all dimensions. Comput. Geom. 24(2): 75-94 (2003) - [j50]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) - [j49]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) - [j48]Erik D. Demaine, Stefan Langerman, Joseph O'Rourke, Jack Snoeyink:
Interlocked open and closed linkages with few joints. Comput. Geom. 26(1): 37-45 (2003) - [j47]Joel Hass, Jack Snoeyink, William P. Thurston:
The Size of Spanning Disks for Polygonal Curves. Discret. Comput. Geom. 29(1): 1-17 (2003) - [j46]Tetsuo Asano, Mark de Berg, Otfried Cheong, Leonidas J. Guibas, Jack Snoeyink, Hisao Tamaki:
Spanning Trees Crossing Few Barriers. Discret. Comput. Geom. 30(4): 591-606 (2003) - [c87]Michael J. Spriggs, J. Mark Keil, Sergei Bespamyatnikh, Michael Segal, Jack Snoeyink:
Approximating the geometric minimum-diameter spanning tree. CCCG 2003: 39-42 - [c86]Martin Isenburg, Jack Snoeyink:
Compressing Texture Coordinates with Selective Linear Predictions. Computer Graphics International 2003: 126-133 - [c85]Hamish A. Carr, Jack Snoeyink:
Path Seeds and Flexible Isosurfaces - Using Topology for Exploratory Visualization. VisSym 2003: 49-58 - [c84]Martin Isenburg, Peter Lindstrom, Stefan Gumhold, Jack Snoeyink:
Large Mesh Simplification using Processing Sequences. IEEE Visualization 2003: 465-472 - [c83]Martin Isenburg, Jack Snoeyink:
Binary compression rates for ASCII formats. Web3D 2003: 173-178 - 2002
- [j45]Gill Barequet, Danny Z. Chen, Ovidiu Daescu, Michael T. Goodrich, Jack Snoeyink:
Efficiently Approximating Polygonal Paths in Three and Higher Dimensions. Algorithmica 33(2): 150-167 (2002) - [j44]Prosenjit Bose, Ferran Hurtado, Elsa Omaña-Pulido, Jack Snoeyink, Godfried T. Toussaint:
Some Aperture-Angle Optimization Problems. Algorithmica 33(4): 411-435 (2002) - [j43]Pankaj K. Agarwal, Leonidas J. Guibas, Herbert Edelsbrunner, Jeff Erickson, Michael Isard, Sariel Har-Peled, John Hershberger, Christian S. Jensen, Lydia E. Kavraki, Patrice Koehl, Ming C. Lin, Dinesh Manocha, Dimitris N. Metaxas, Brian Mirtich, David M. Mount, S. Muthukrishnan, Dinesh K. Pai, Elisha Sacks, Jack Snoeyink, Subhash Suri, Ouri Wolfson:
Algorithmic issues in modeling motion. ACM Comput. Surv. 34(4): 550-572 (2002) - [j42]Martin Isenburg, Jack Snoeyink:
Compressing the Property Mapping of Polygon Meshes. Graph. Model. 64(2): 114-127 (2002) - [j41]David G. Kirkpatrick, Jack Snoeyink, Bettina Speckmann:
Kinetic Collision Detection for Simple Polygons. Int. J. Comput. Geom. Appl. 12(1-2): 3-27 (2002) - [j40]J. Mark Keil, Jack Snoeyink:
On the Time Bound for Convex Decomposition of Simple Polygons. Int. J. Comput. Geom. Appl. 12(3): 181-192 (2002) - [c82]Martin Isenburg, Jack Snoeyink:
Coding with ASCII: compact, yet text-based 3D content. 3DPVT 2002: 609-617 - [c81]Sergio Cabello, Yuanxin Liu, Andrea Mantler, Jack Snoeyink:
Testing Homotopy for paths in the plane. SCG 2002: 160-169 - [c80]Erik D. Demaine, Stefan Langerman, Joseph O'Rourke, Jack Snoeyink:
Interlocked open linkages with few joints. SCG 2002: 189-198 - [c79]Martin Isenburg, Jack Snoeyink:
Coding polygon meshes as compressable ASCII. Web3D 2002: 1-10 - 2001
- [j39]Christopher M. Gold, Jack Snoeyink:
A One-Step Crust and Skeleton Extraction Algorithm. Algorithmica 30(2): 144-163 (2001) - [j38]Martin Isenburg, Jack Snoeyink:
Spirale Reversi: Reverse decoding of the Edgebreaker encoding. Comput. Geom. 20(1-2): 39-52 (2001) - [j37]Robert L. (Scot) Drysdale III, Scott A. McElfresh, Jack Snoeyink:
On exclusion regions for optimal triangulations. Discret. Appl. Math. 109(1-2): 49-65 (2001) - [j36]Bettina Speckmann, Jack Snoeyink:
Easy triangle strips for TIN terrain models. Int. J. Geogr. Inf. Sci. 15(4): 379-386 (2001) - [c78]Hee-Kap Ahn, Siu-Wing Cheng, Otfried Cheong, Jack Snoeyink:
The reflex-free hull. CCCG 2001: 9-12 - [c77]Andrea Mantler, Jack Snoeyink:
Heaphull?. CCCG 2001: 129-131 - [c76]Dana Randall, Günter Rote, Francisco Santos, Jack Snoeyink:
Counting triangulations and pseudo-triangulations of wheels. CCCG 2001: 149-152 - [c75]Jack Snoeyink:
The arithmetic precision of ray-polygon intersection testing. CCCG 2001: 161-164 - [c74]Lutz Kettner, Jack Snoeyink:
A prototype system for visualizing time-dependent volume data. SCG 2001: 327-328 - [c73]Jack Snoeyink, Subhash Suri, George Varghese:
A Lower Bound for Multicast Key Distribution. INFOCOM 2001: 422-431 - [c72]Martin Isenburg, Jack Snoeyink:
Compressing the Property Mapping of Polygon Meshes. PG 2001: 4-11 - [c71]Danny Z. Chen, Ovidiu Daescu, John Hershberger, Peter M. Kogge, Jack Snoeyink:
Polygonal path approximation with angle constraints. SODA 2001: 342-343 - [c70]Hamish A. Carr, Torsten Möller, Jack Snoeyink:
Simplicial Subdivisions and Sampling Artifacts. IEEE Visualization 2001: 99-106 - [e2]Adam L. Buchsbaum, Jack Snoeyink:
Algorithm Engineering and Experimentation, Third International Workshop, ALENEX 2001, Washington, DC, USA, January 5-6, 2001, Revised Papers. Lecture Notes in Computer Science 2153, Springer 2001, ISBN 3-540-42560-8 [contents] - 2000
- [j35]Sergei Bespamyatnikh, Jack Snoeyink:
Queries with segments in Voronoi diagrams. Comput. Geom. 16(1): 23-33 (2000) - [j34]Jean-Daniel Boissonnat, Jack Snoeyink:
Efficient algorithms for line and curve segment intersection using restricted predicates. Comput. Geom. 16(1): 35-52 (2000) - [j33]Sergei Bespamyatnikh, David G. Kirkpatrick, Jack Snoeyink:
Generalizing Ham Sandwich Cuts to Equitable Subdivisions. Discret. Comput. Geom. 24(4): 605-622 (2000) - [j32]Pierre Alliez, Olivier Devillers, Jack Snoeyink:
Removing Degeneracies by Perturbing the Problem or Perturbing the World. Reliab. Comput. 6(1): 61-79 (2000) - [c69]Martin Isenburg, Jack Snoeyink:
Spirale Reversi: Reverse Decoding of the Edgebreaker Encoding. CCCG 2000 - [c68]David G. Kirkpatrick, Jack Snoeyink, Bettina Speckmann:
Kinetic collision detection for simple polygons. SCG 2000: 322-330 - [c67]Martin Isenburg, Jack Snoeyink:
The face fixer video. SCG 2000: 377-378 - [c66]Andrea Mantler, Jack Snoeyink:
Intersecting Red and Blue Line Segments in Optimal Time and Precision. JCDCG 2000: 244-251 - [c65]Martin Isenburg, Jack Snoeyink:
Face fixer: compressing polygon meshes with properties. SIGGRAPH 2000: 263-270 - [c64]Hamish A. Carr, Jack Snoeyink, Ulrike Axen:
Computing contour trees in all dimensions. SODA 2000: 918-926 - [c63]Leonidas J. Guibas, Jack Snoeyink, Li Zhang:
Compact Voronoi Diagrams for Moving Convex Polygons. SWAT 2000: 339-352
1990 – 1999
- 1999
- [j31]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) - [j30]Francis Y. L. Chin, Jack Snoeyink, Cao An Wang:
Finding the Medial Axis of a Simple Polygon in Linear Time. Discret. Comput. Geom. 21(3): 405-420 (1999) - [j29]Jack Snoeyink:
Cross-Ratios and Angles Determine a Polygon. Discret. Comput. Geom. 22(4): 619-631 (1999) - [j28]David G. Kirkpatrick, Jack Snoeyink:
Computing Constrained Shortest Segments: Butterfly Wingspans in Logarithmic Time. Int. J. Comput. Geom. Appl. 9(1): 53-62 (1999) - [c62]Robert J. Walker, Jack Snoeyink:
Practical Point-in-Polygon Tests Using CSG Representations of Polygons. ALENEX 1999: 114-123 - [c61]Marc J. van Kreveld, Joseph S. B. Mitchell, Peter J. Rousseeuw, Micha Sharir, Jack Snoeyink, Bettina Speckmann:
Efficient Algorithms for Maximum Regression Depth. SCG 1999: 31-40 - [c60]Tetsuo Asano, Mark de Berg, Otfried Cheong, Leonidas J. Guibas, Jack Snoeyink, Hisao Tamaki:
Spanning Trees Crossing Few Barriers. SCG 1999: 41-48 - [c59]Sergei Bespamyatnikh, David G. Kirkpatrick, Jack Snoeyink:
Generalizing Ham Sandwich Cuts to Equitable Subdivisions. SCG 1999: 49-58 - [c58]Jean-Daniel Boissonnat, Jack Snoeyink:
Efficient Algorithms for Line and Curve Segment Intersection Using Restricted Predicates. SCG 1999: 370-379 - [c57]Martin Isenburg, Jack Snoeyink:
Mesh Collapse Compression. SCG 1999: 419-420 - [c56]Martin Isenburg, Jack Snoeyink:
Mesh Collapse Compression. SIBGRAPI 1999: 27-28 - [c55]Sergei Bespamyatnikh, Jack Snoeyink:
Queries with Segments in Voronoi Diagrams. SODA 1999: 122-129 - [i2]Marshall W. Bern, Erik D. Demaine, David Eppstein, Eric Kuo, Andrea Mantler, Jack Snoeyink:
Ununfoldable Polyhedra with Convex Faces. CoRR cs.CG/9908003 (1999) - [i1]Marshall W. Bern, David Eppstein, Pankaj K. Agarwal, Nina Amenta, L. Paul Chew, Tamal K. Dey, David P. Dobkin, Herbert Edelsbrunner, Cindy Grimm, Leonidas J. Guibas, John Harer, Joel Hass, Andrew Hicks, Carroll K. Johnson, Gilad Lerman, David Letscher, Paul E. Plassmann, Eric Sedgwick, Jack Snoeyink, Jeff Weeks, Chee-Keng Yap, Denis Zorin:
Emerging Challenges in Computational Topology. CoRR cs.CG/9909001 (1999) - 1998
- [j27]John Hershberger, Jack Snoeyink:
Erased arrangements of lines and convex decompositions of polyhedra. Comput. Geom. 9(3): 129-143 (1998) - [j26]John Hershberger, Jack Snoeyink:
Cartographic line simplification and polygon CSG formulæ in O(nlog * n) time. Comput. Geom. 11(3-4): 175-185 (1998) - [j25]Jesus Garcia-Lopez, Pedro A. Ramos, Jack Snoeyink:
Fitting a Set of Points by a Circle. Discret. Comput. Geom. 20(3): 389-402 (1998) - [c54]Pierre Alliez, Olivier Devillers, Jack Snoeyink:
Removing degeneracies by perturbing the problem or perturbing the world. CCCG 1998 - [c53]J. Mark Keil, Jack Snoeyink:
On the time bound for convex decomposition of simple polygons. CCCG 1998 - [c52]Jack Snoeyink:
Cross-Ratios and Angles Determine a Polygon. SCG 1998: 49-57 - [c51]Ronald Beirouti, Jack Snoeyink:
Implementations of the LMT Heuristic for Minimum Weight Triangulation. SCG 1998: 96-105 - [c50]Gill Barequet, Michael T. Goodrich, Danny Z. Chen, Ovidiu Daescu, Jack Snoeyink:
Efficiently Approximating Polygonal Paths in Three and Higher Dimensions. SCG 1998: 317-326 - 1997
- [j24]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. Discret. Comput. Geom. 18(4): 433-454 (1997) - [j23]Prosenjit Bose, Michael McAllister, Jack Snoeyink:
Optimal Algorithms to Embed Trees in a Point Set. J. Graph Algorithms Appl. 1(2): 1-15 (1997) - [c49]Bettina Speckmann, Jack Snoeyink:
Easy triangle strips for tin terrain models. CCCG 1997 - [c48]Jack Snoeyink, Marc J. van Kreveld:
Good Orders for Incremental (Re)construction. SCG 1997: 400-402 - [c47]Jack Snoeyink, Marc J. van Kreveld:
Linear-Time Reconstruction of Delaunay Triangulations with Applications. ESA 1997: 459-471 - [c46]Robert J. Walker, Jack Snoeyink:
Using CSG representations of polygons for practical point-in-polygon tests. SIGGRAPH Visual Proceedings 1997: 152 - [c45]John Hershberger, Jack Snoeyink:
Cartographic Line Simplification and Polygon CSG Formulae and in O(n log* n) Time. WADS 1997: 93-103 - 1996
- [j22]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) - [j21]Chong Zhu, Gopalakrishnan Sundaram, Jack Snoeyink, Joseph S. B. Mitchell:
Generating Random Polygons with Given Vertices. Comput. Geom. 6: 277-290 (1996) - [j20]Michael McAllister, David G. Kirkpatrick, Jack Snoeyink:
A Compact Piecewise-Linear Voronoi Diagram for Convex Sites in the Plane. Discret. Comput. Geom. 15(1): 73-105 (1996) - [j19]Marc J. van Kreveld, Jack Snoeyink, Sue Whitesides:
Folding Rulers Inside Triangles. Discret. Comput. Geom. 15(3): 265-285 (1996) - [j18]Joseph Friedman, John Hershberger, Jack Snoeyink:
Efficiently Planning Compliant Motion in the Plane. SIAM J. Comput. 25(3): 562-599 (1996) - [c44]Prosenjit Bose, William S. Evans, David G. Kirkpatrick, Michael McAllister, Jack Snoeyink:
Approximating Shortest Paths in Arrangements of Lines. CCCG 1996: 143-148 - [c43]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 - [c42]Simon Kahan, Jack Snoeyink:
On the Bit Complexity of Minimum Link Paths: Superquadratic Algorithms for Problems Solvable in Linear Time. SCG 1996: 151-158 - [c41]David Avis, Prosenjit Bose, Godfried T. Toussaint, Thomas C. Shermer, Binhai Zhu, Jack Snoeyink:
On the Sectional Area of Convex Polytopes. SCG 1996: C-11-C-12 - [c40]Patrice Belleville, J. Mark Keil, Michael McAllister, Jack Snoeyink:
On Computing Edges That Are In All Minimum-Weight Triangulations. SCG 1996: V-7-V-8 - 1995
- [j17]David G. Kirkpatrick, Jack Snoeyink:
Tentative Prune-and-Search for Computing Fixed-Points with Applications to Geometric Computation. Fundam. Informaticae 22(4): 353-370 (1995) - [j16]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) - [c39]Helmut Alt, David Hsu, Jack Snoeyink:
Computing the largest inscribed isothetic rectangle. CCCG 1995: 67-72 - [c38]Sariel Har-Peled, Timothy M. Chan, Boris Aronov, Dan Halperin, Jack Snoeyink:
The complexity of a single face of a minkowski sum. CCCG 1995: 91-96 - [c37]D. S. Andrews, Jack Snoeyink:
Geometry in GIS is not Combinatorial: Segment Intersection for Polygon Overlay. SCG 1995: C24-C25 - [c36]Prosenjit Bose, Michael McAllister, Jack Snoeyink:
Optimal Algorithms to Embed Trees in a Point Set. GD 1995: 64-75 - [c35]Francis Y. L. Chin, Jack Snoeyink, Cao An Wang:
Finding the Medial Axis of a Simple Polygon in Linear Time. ISAAC 1995: 382-391 - [c34]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 - [c33]David G. Kirkpatrick, Jack Snoeyink:
Computing Common Tangents Without a Separating Line. WADS 1995: 183-193 - [e1]Jack Snoeyink:
Proceedings of the Eleventh Annual Symposium on Computational Geometry, Vancouver, B.C., Canada, June 5-12, 1995. ACM 1995, ISBN 0-89791-724-3 [contents] - 1994
- [j15]Christian Schwarz, Michiel H. M. Smid, Jack Snoeyink:
An Optimal Algorithm for the On-Line Closest-Pair Problem. Algorithmica 12(1): 18-29 (1994) - [j14]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) - [j13]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) - [j12]John Hershberger, Jack Snoeyink:
Computing Minimum Length Paths of a Given Homotopy Class. Comput. Geom. 4: 63-97 (1994) - [j11]Larry F. Palazzi, Jack Snoeyink:
Counting and Reporting Red/Blue Segment Intersections. CVGIP Graph. Model. Image Process. 56(4): 304-310 (1994) - [j10]Jack Snoeyink, Jorge Stolfi:
Objects that Cannot Be Taken Apart with Two Hands. Discret. Comput. Geom. 12: 367-384 (1994) - [j9]John Adegeest, Mark H. Overmars, Jack Snoeyink:
Minimum-link C-oriented paths: Single-source queries. Int. J. Comput. Geom. Appl. 4(1): 39-51 (1994) - [c32]John Hershberger, Jack Snoeyink:
An Efficient Solution to the Zookeeper's Problem. CCCG 1994: 104-109 - [c31]Chong Zhu, Gopalakrishnan Sundaram, Jack Snoeyink, Joseph S. B. Mitchell:
Generating Random x-Monotone Polygons with Given Vertices. CCCG 1994: 189-194 - [c30]John Hershberger, Jack Snoeyink:
An O(n log n) Implementation of the Douglas-Peucker Algorithm for Line Simplification. SCG 1994: 383-384 - 1993
- [j8]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) - [j7]Leonidas J. Guibas, John Hershberger, Joseph S. B. Mitchell, Jack Snoeyink:
Approximating Polygons and Subdivisions with Minimum Link Paths. Int. J. Comput. Geom. Appl. 3(4): 383-415 (1993) - [j6]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) - [c29]Marc J. van Kreveld, Jack Snoeyink, Sue Whitesides:
Folding Rulers inside Triangles. CCCG 1993: 1-6 - [c28]David G. Kirkpatrick, Jack Snoeyink:
Computing Constrained Shortest Segments: Butterfly Wingspans in Logarithmic Time. CCCG 1993: 163-168 - [c27]Günter Rote, Christian Schwarz, Jack Snoeyink:
Maintaining the Approximate Width of a Set of Points in the Plane. CCCG 1993: 258-263 - [c26]Michael McAllister, Jack Snoeyink:
Two-dimensional Computation of the Three-dimensional Reachable Region for a Welding Head. CCCG 1993: 437-442 - [c25]David G. Kirkpatrick, Jack Snoeyink:
Tentative Prune-and-Search for Computing Voronoi Vertices. SCG 1993: 133-142 - [c24]Jack Snoeyink, Jorge Stolfi:
Objects That Cannot be Taken Apart with Two Hands. SCG 1993: 247-256 - [c23]Jack Snoeyink:
Video: Objects that Cannot be Taken Apart with Two Hands. SCG 1993: 405 - [c22]Michael McAllister, David G. Kirkpatrick, Jack Snoeyink:
A Compact Piecewise-Linear Voronoi Diagram for Convex Sites in the Plane. FOCS 1993: 573-582 - [c21]Larry F. Palazzi, Jack Snoeyink:
Counting and Reporting Red/Blue Segment Intersections. WADS 1993: 530-540 - 1992
- [c20]Christian Schwarz, Michiel H. M. Smid, Jack Snoeyink:
An Optimal Algorithm for the On-Line Closest-Pair Problem. SCG 1992: 330-336 - [c19]Eric Guévremont, Jack Snoeyink:
Recognizing an Envelope of Lines in Linear Time. ISAAC 1992: 370-377 - [c18]Mark de Berg, Marc J. van Kreveld, Jack Snoeyink:
Two- and Three-Dimensional Point Location in Rectangular Subdivisions (Extended Abstract). SWAT 1992: 352-363 - [c17]John Hershberger, Jack Snoeyink:
Convex Polygons Made from Few Lines and Convex Decompositions of Polyhedra. SWAT 1992: 376-387 - 1991
- [j5]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) - [j4]Leonidas J. Guibas, John Hershberger, Jack Snoeyink:
Compact interval trees: a data structure for convex hulls. Int. J. Comput. Geom. Appl. 1(1): 1-22 (1991) - [c16]Mark de Berg, Dan Halperin, Mark H. Overmars, Jack Snoeyink, Marc J. van Kreveld:
Efficient Ray Shooting and Hidden Surface Removal. SCG 1991: 21-30 - [c15]Bernard Chazelle, Herbert Edelsbrunner, Michelangelo Grigni, Leonidas J. Guibas, John Hershberger, Micha Sharir, Jack Snoeyink:
Ray Shooting in Polygons Using Geodesic Triangulations. ICALP 1991: 661-646 - [c14]Leonidas J. Guibas, John Hershberger, Joseph S. B. Mitchell, Jack Snoeyink:
Approximating Polygons and Subdivisions with Minimum Link Paths. ISA 1991: 151-162 - [c13]Bernard Chazelle, Herbert Edelsbrunner, Leonidas J. Guibas, Micha Sharir, Jack Snoeyink:
Computing a Face in an Arrangement of Line Segments. SODA 1991: 441-448 - [c12]John Hershberger, Jack Snoeyink:
Computing Minimum Length Paths of a Given Homotopy Class (Extended Abstract). WADS 1991: 331-342 - 1990
- [b1]Jack Snoeyink:
Topological approaches in computational geometry. Stanford University, USA, 1990 - [j3]Michael T. Goodrich, Jack Snoeyink:
Stabbing Parallel Segments with a Convex Polygon. Comput. Vis. Graph. Image Process. 49(2): 152-170 (1990) - [c11]Jack Snoeyink:
A Trivial Knot Whose Spanning Disks Have Exponential Size. SCG 1990: 139-147 - [c10]Jack Snoeyink, John Hershberger:
Sweeping Arrangements of Curves. Discrete and Computational Geometry 1990: 309-350 - [c9]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 - [c8]Leonidas J. Guibas, John Hershberger, Jack Snoeyink:
Compact Interval Trees: A Data Structure for Convex Hulls. SODA 1990: 169-178 - [c7]Joseph Friedman, John Hershberger, Jack Snoeyink:
Input-Sensitive Compliant Motion in the Plane. SWAT 1990: 225-237
1980 – 1989
- 1989
- [j2]Herbert Edelsbrunner, Leonidas J. Guibas, John Hershberger, Raimund Seidel, Micha Sharir, Jack Snoeyink, Emo Welzl:
Implicitly Representing Arrangements of Lines or Segments. Discret. Comput. Geom. 4: 433-466 (1989) - [j1]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. Discret. Comput. Geom. 4: 523-539 (1989) - [c6]Joseph Friedman, John Hershberger, Jack Snoeyink:
Compliant Motion in a Simple Polygon. SCG 1989: 175-186 - [c5]Jack Snoeyink, John Hershberger:
Sweeping Arrangements of Curves. SCG 1989: 354-363 - [c4]Michael T. Goodrich, Jack Snoeyink:
Stabbing Parallel Segments with a Convex Polygon (Extended Abstract). WADS 1989: 231-242 - 1988
- [c3]Herbert Edelsbrunner, Leonidas J. Guibas, John Hershberger, Raimund Seidel, Micha Sharir, Jack Snoeyink, Emo Welzl:
Implicitly Representing Arrangements of Lines or Segments. SCG 1988: 56-69 - [c2]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. SCG 1988: 258-265 - [c1]David P. Dobkin, Leonidas J. Guibas, John Hershberger, Jack Snoeyink:
An efficient algorithm for finding the CSG representation of a simple polygon. SIGGRAPH 1988: 31-40
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-08-05 21:10 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
