Ray shooting in polygons using geodesic triangulations. Zbl 0813.68158
Chazelle, B.; Edelsbrunner, H.; Grigni, M.; Guibas, L.; Hershberger, J.; Sharir, M.; Snoeyink, J. |
|
1994
|
Computing contour trees in all dimensions. Zbl 1052.68098
Carr, Hamish; Snoeyink, Jack; Axen, Ulrike |
|
2003
|
Computing minimum length paths of a given homotopy class. Zbl 0815.68116
Hershberger, John; Snoeyink, Jack |
|
1994
|
Approximating polygons and subdivisions with minimum-link paths. Zbl 0803.68134
Guibas, Leonidas J.; Hershberger, John E.; Mitchell, Joseph S. B.; Snoeyink, Jack Scott |
|
1993
|
Optimal algorithms to embed trees in a point set. Zbl 0890.05066
Bose, Prosenjit; McAllister, Michael; Snoeyink, Jack |
|
1997
|
Finding the medial axis of a simple polygon in linear time. Zbl 0922.68128
Chin, F.; Snoeyink, J.; Wang, C. A. |
|
1999
|
Generalizing ham sandwich cuts to equitable subdivisions. Zbl 0966.68156
Bespamyatnikh, S.; Kirkpatrick, D.; Snoeyink, J. |
|
2000
|
A compact piecewise-linear Voronoi diagram for convex sites in the plane. Zbl 0840.68119
McAllister, M.; Kirkpatrick, D.; Snoeyink, J. |
|
1996
|
Counting and cutting cycles of lines and rods in space. Zbl 0748.68082
Chazelle, Bernard; Edelsbrunner, Herbert; Guibas, Leonidas J.; Pollack, Richard; Seidel, Raimund; Sharir, Micha; Snoeyink, Jack |
|
1992
|
Efficient ray shooting and hidden surface removal. Zbl 0813.68160
de Berg, M.; Halperin, D.; Overmars, M.; Snoeyink, J.; van Kreveld, M. |
|
1994
|
Implicitly representing arrangements of lines or segments. Zbl 0688.68031
Edelsbrunner, Herbert; Guibas, Leonidas; Hershberger, John; Seidel, Raimund; Sharir, Micha; Snoeyink, Jack; Welzl, Emo |
|
1989
|
Generating random polygons with given vertices. Zbl 0857.68101
Zhu, Chong; Sundaram, Gopalakrishnan; Snoeyink, Jack; Mitchell, Joseph S. B. |
|
1996
|
Tentative prune-and-search for computing fixed-points with applications to geometric computation. Zbl 0815.68119
Kirkpatrick, David; Snoeyink, Jack |
|
1995
|
Efficiently approximating polygonal paths in three and higher dimensions. Zbl 0994.68048
Barequet, G.; Chen, D. Z.; Daescu, O.; Goodrich, M. T.; Snoeyink, J. |
|
2002
|
Almost all Delaunay triangulations have stretch factor greater than \(\pi /2\). Zbl 1217.65044
Bose, Prosenjit; Devroye, Luc; Löffler, Maarten; Snoeyink, Jack; Verma, Vishal |
|
2011
|
On the time bound for convex decomposition of simple polygons. Zbl 1152.68670
Keil, Mark; Snoeyink, Jack |
|
2002
|
Ununfoldable polyhedra with convex faces. Zbl 1021.52013
Bern, Marshall; Demaine, Erik D.; Eppstein, David; Kuo, Eric; Mantler, Andrea; Snoeyink, Jack |
|
2003
|
Kinetic collision detection for simple polygons. Zbl 1152.68671
Kirkpatrick, David; Snoeyink, Jack; Speckmann, Bettina |
|
2002
|
Compact interval trees: A data structure for convex hulls. Zbl 0724.68088
Guibas, Leonidas; Hershberger, John; Snoeyink, Jack |
|
1991
|
Counting and enumerating pointed pseudotriangulations with the greedy flip algorithm. Zbl 1120.68104
Brönnimann, Hervé; Kettner, Lutz; Pocchiola, Michel; Snoeyink, Jack |
|
2006
|
Delaunay triangulation of imprecise points in linear time after preprocessing. Zbl 1177.65037
Löffler, Maarten; Snoeyink, Jack |
|
2010
|
Primal dividing and dual pruning: Output-sensitive construction of four-dimensional polytopes and three-dimensional Voronoi diagrams. Zbl 0892.68099
Chan, T. M.; Snoeyink, J.; Yap, Chee-Keng |
|
1997
|
The size of spanning disks for polygonal curves. Zbl 1015.57008
Hass, Joel; Snoeyink, Jack; Thurston, William P. |
|
2003
|
Almost-Delaunay simplices, nearest neighbor relations for imprecise points. Zbl 1317.68244
Bandyopadhyay, Deepak; Snoeyink, Jack |
|
2004
|
Testing homotopy for paths in the plane. Zbl 1060.68127
Cabello, Sergio; Liu, Yuanxin; Mantler, Andrea; Snoeyink, Jack |
|
2004
|
Flexible isosurfaces: Simplifying and displaying scalar topology using the contour tree. Zbl 1175.65030
Carr, Hamish; Snoeyink, Jack; van de Panne, Michiel |
|
2010
|
Ray shooting in polygons using geodesic triangulations. Zbl 0769.68119
Chazelle, Bernard; Edelsbrunner, Herbert; Grigni, Michelangelo; Guibas, Leonidas; Hershberger, John; Sharir, Micha; Snoeyink, Jack |
|
1991
|
Tight degree bounds for pseudo-triangulations of points. Zbl 1023.65013
Kettner, Lutz; Kirkpatrick, David; Mantler, Andrea; Snoeyink, Jack; Speckmann, Bettina; Takeuchi, Fumihiko |
|
2003
|
Quadratic and cubic B-splines by generalizing higher-order Voronoi diagrams. Zbl 1221.65067
Liu, Yuanxin; Snoeyink, Jack |
|
2007
|
Objects that cannot be taken apart with two hands. Zbl 0813.52004
Snoeyink, J.; Stolfi, J. |
|
1994
|
Cartographic line simplification and polygon CSG formulae in \(O(n\log^* n)\) time. Zbl 0913.68201
Hershberger, John; Snoeyink, Jack |
|
1998
|
Efficient algorithms for line and curve segment intersection using restricted predicates. Zbl 0958.68175
Boissonnat, Jean-Daniel; Snoeyink, Jack |
|
2000
|
Stabbing parallel segments with a convex polygon. Zbl 0771.68104
Goodrich, Michael T.; Snoeyink, Jack Scott |
|
1990
|
An efficient algorithm for finding the CSG representation of a simple polygon. Zbl 0777.68076
Dobkin, David; Guibas, Leonidas; Hershberger, John; Snoeyink, Jack |
|
1993
|
On arrangements of Jordan arcs with three intersections per pair. Zbl 0687.05004
Edelsbrunner, Herbert; Guibas, Leonidas; Hershberger, John; Pack, Janos; Pollack, Richard; Seidel, Raimund; Sharir, Micha; Snoeyink, Jack |
|
1989
|
Output-sensitive construction of polytopes in four dimensions and clipped Voronoi diagrams in three. Zbl 0848.68106
Chan, Timothy M. Y.; Snoeyink, Jack; Yap, Chee-Keng |
|
1995
|
A lower bound for multicast key distribution. Zbl 1093.68541
Snoeyink, Jack; Suri, Subhash; Varghese, George |
|
2005
|
Polygonal path simplification with angle constraints. Zbl 1082.65018
Chen, Danny Z.; Daescu, Ovidiu; Hershberger, John; Kogge, Peter M.; Mi, Ningfang; Snoeyink, Jack |
|
2005
|
Time-varying Reeb graphs for continuous space-time data. Zbl 1149.65013
Edelsbrunner, Herbert; Harer, John; Mascarenhas, Ajith; Pascucci, Valerio; Snoeyink, Jack |
|
2008
|
Some aperture-angle optimization problems. Zbl 1041.68106
Bose, P.; Hurtado-Diaz, F.; Omaña-Pulido, E.; Snoeyink, J.; Toussaint, G. T. |
|
2002
|
Point location. Zbl 0907.68196
Snoeyink, Jack |
|
1997
|
On the bit complexity of minimum link paths: Superquadratic algorithms for problem solvable in linear time. Zbl 0922.68121
Kahan, Simon; Snoeyink, Jack |
|
1999
|
Computing a face in an arrangement of line segments. Zbl 0800.68956
Chazelle, Bernard; Edelsbrunner, Herbert; Guibas, Leonidas; Sharir, Micha; Snoeyink, Jack |
|
1991
|
Computing a face in an arrangement of line segments and related problems. Zbl 0799.68182
Chazelle, Bernard; Edelsbrunner, Herbert; Guibas, Leonidas; Sharir, Micha; Snoeyink, Jack |
|
1993
|
Reconstructing polygons from scanner data. Zbl 1217.68227
Biedl, Therese; Durocher, Stephane; Snoeyink, Jack |
|
2011
|
A one-step crust and skeleton extraction algorithm. Zbl 0983.68226
Gold, C.; Snoeyink, J. |
|
2001
|
The Safari interface for visualizing time-dependent volume data using iso-surfaces and contour spectra. Zbl 1025.65019
Kettner, Lutz; Rossignac, Jarek; Snoeyink, Jack |
|
2003
|
Finding the medial axis of a simple polygon in linear time. Zbl 1512.68407
Chin, Francis; Snoeyink, Jack; Wang, Cao An |
|
1995
|
Computing a \((1+\varepsilon)\)-approximate geometric minimum-diameter spanning tree. Zbl 1138.68477
Spriggs, Michael J.; Keil, J. Mark; Bespamyatnikh, Sergei; Segal, Michael; Snoeyink, Jack |
|
2004
|
Cross-ratios and angles determine a polygon. Zbl 0939.68140
Snoeyink, J. |
|
1999
|
Removing degeneracies by perturbing the problem or perturbing the world. Zbl 0996.65019
Alliez, Pierre; Devillers, Olivier; Snoeyink, Jack |
|
2000
|
Number of crossing-free geometric graphs vs. Triangulations. Zbl 1267.05097
Razen, Andreas; Snoeyink, Jack; Welzl, Emo |
|
2008
|
Delaunay triangulations of imprecise points in linear time after preprocessing. Zbl 1271.68235
Löffler, Maarten; Snoeyink, Jack |
|
2008
|
A comparison of five implementations of 3D Delaunay tessellation. Zbl 1097.68136
Liu, Yuanxin; Snoeyink, Jack |
|
2005
|
Fitting a set of points by a circle. Zbl 0910.68219
García-López, J.; Ramos, P. A.; Snoeyink, J. |
|
1998
|
Computing minimum length paths of a given homotopy class. (Extended abstract). Zbl 0764.68174
Hershberger, John; Snoeyink, Jack |
|
1991
|
Lossless compression of predicted floating-point geometry. Zbl 1206.94019
Isenburg, Martin; Lindstrom, Peter; Snoeyink, Jack |
|
2005
|
Queries with segments in Voronoi diagrams. Zbl 0958.68174
Bespamyatnikh, Sergei; Snoeyink, Jack |
|
2000
|
Efficient algorithms for maximum regression depth. Zbl 1161.62043
van Kreveld, Marc; Mitchell, Joseph S. B.; Rousseeuw, Peter; Sharir, Micha; Snoeyink, Jack; Speckmann, Bettina |
|
2008
|
Erased arrangements of linear and convex decompositions of polyhedra. Zbl 0894.68153
Hershberger, J. E.; Snoeyink, J. S. |
|
1998
|
Reconstructing polygons from scanner data. Zbl 1273.68388
Biedl, Therese; Durocher, Stephane; Snoeyink, Jack |
|
2009
|
Spanning trees crossing few barriers. Zbl 1033.68078
Asano, Tetsuo; de Berg, Mark; Cheong, Otfried; Guibas, Leonidas J.; Snoeyink, Jack; Tamaki, Hisao |
|
2003
|
Computing contour trees in all dimensions. Zbl 0961.68105
Carr, Hamish; Snoeyink, Jack; Axen, Ulrike |
|
2000
|
An optimal algorithm for the on-line closest-pair problem. Zbl 0863.68113
Schwarz, C.; Smid, M.; Snoeyink, J. |
|
1994
|
Computation of non-dominated points using compact Voronoi diagrams. Zbl 1274.68617
Bhattacharya, Binay; Bishnu, Arijit; Cheong, Otfried; Das, Sandip; Karmakar, Arindam; Snoeyink, Jack |
|
2010
|
Stabbing parallel segments with a convex polygon. Zbl 0794.68166
Goodrich, Michael T.; Snoeyink, Jack Scott |
|
1989
|
Compact interval trees: A data structure for convex hulls. Zbl 0800.68953
Guibas, Leonidas; Hershberger, John; Snoeyink, Jack |
|
1990
|
Kinetic collision detection for simple polygons. Zbl 1375.68151
Kirkpatrick, David; Snoeyink, Jack; Speckmann, Bettina |
|
2000
|
On exclusion regions for optimal triangulations. Zbl 0967.68158
Drysdale, R. L.; McElfresh, Scott; Snoeyink, Jack Scott |
|
2001
|
Delineating boundaries for imprecise regions. Zbl 1141.68029
Reinbacher, Iris; Benkert, Marc; van Kreveld, Marc; Mitchell, Joseph S. B.; Snoeyink, Jack; Wolff, Alexander |
|
2008
|
Maximum independent set for intervals by divide and conquer with pruning. Zbl 1112.05081
Snoeyink, Jack |
|
2007
|
Compressing the property mapping of polygon meshes. Zbl 1033.68675
Isenburg, Martin; Snoeyink, Jack |
|
2002
|
Minimum-link \(c\)-oriented paths: Single-source queries. Zbl 0805.68061
Adegeest, John; Overmars, Mark; Snoeyink, Jack |
|
1994
|
Linear-time reconstruction of Delaunay triangulations with applications. Zbl 1477.68493
Snoeyink, Jack; van Kreveld, Marc |
|
1997
|
Bumpy pyramid folding. Zbl 1443.68194
Abel, Zachary R.; Demaine, Erik D.; Demaine, Martin L.; Ito, Hiro; Snoeyink, Jack; Uehara, Ryuhei |
|
2018
|
Computing planar Voronoi diagrams in double precision, a further example of degree-driven algorithm design. Zbl 1284.68611
Millman, David L.; Snoeyink, Jack |
|
2010
|
Efficient algorithm for approximating maximum inscribed sphere in high dimensional polytope. Zbl 1153.68550
Xie, Yulai; Snoeyink, Jack; Xu, Jinhui |
|
2006
|
Efficiently planning compliant motion in the plane. Zbl 0852.68102
Friedman, Joseph; Hershberger, J.; Snoeyink, J. |
|
1996
|
Almost-Delaunay simplices: Robust neighbor relations for imprecise 3D points using CGAL. Zbl 1114.65308
Bandyopadhyay, Deepak; Snoeyink, Jack |
|
2007
|
Spirale reversi: Reverse decoding of the edgebreaker encoding. Zbl 1012.68658
Isenburg, Martin; Snoeyink, Jack |
|
2001
|
Interlocked open and closed linkages with few joints. Zbl 1034.57004
Demaine, Erik D.; Langerman, Stefan; O’Rourke, Joseph; Snoeyink, Jack |
|
2003
|
Cartographic line simplication and polygon CSG formulae in \(O(n \log^* n)\) time. Zbl 1497.68532
Hershberger, John; Snoeyink, Jack |
|
1997
|
Computing common tangents without a separating line. Zbl 1502.68328
Kirkpatrick, David; Snoeyink, Jack |
|
1995
|
Counting and reporting red/blue segment intersections. Zbl 1504.68265
Palazzi, Larry; Snoeyink, Jack |
|
1993
|
Visibility graphs, dismantlability, and the cops and robbers game. Zbl 1407.91057
Lubiw, Anna; Snoeyink, Jack; Vosoughpour, Hamideh |
|
2017
|
The reflex-free hull. Zbl 1085.68175
Ahn, Hee-Kap; Cheng, Siu-Wing; Cheong, Otfried; Snoeyink, Jack |
|
2004
|
Representing interpolant topology for contour tree computation. Zbl 1161.05342
Carr, Hamish; Snoeyink, Jack |
|
2008
|
Illustrating the streaming construction of 2D Delaunay triangulations. Zbl 1153.68535
Isenburg, Martin; Liu, Yuanxin; Shewchuk, Jonathan; Snoeyink, Jack |
|
2006
|
How long can a graph be kept planar? Zbl 1159.91007
Anuradha, V.; Jain, Chinmay; Snoeyink, Jack; Szabó, Tibor |
|
2008
|
Computing constrained shortest segments: Butterfly wingspans in logarithmic time. Zbl 1020.52013
Kirkpatrick, David; Snoeyink, Jack |
|
1999
|
Folding rulers inside triangles. Zbl 0846.68103
van Kreveld, Marc; Snoeyink, J.; Whitesides, S. |
|
1996
|
Intersecting red and blue line segments in optimal time and precision. Zbl 0990.68549
Mantler, Andrea; Snoeyink, Jack |
|
2001
|
Queries with segments in Voronoi diagrams. Zbl 0938.68131
Bespamyatnikh, Sergei; Snoeyink, Jack |
|
1999
|
Polygonal path approximation with angle constraints. Zbl 0987.68085
Chen, Danny Z.; Daescu, Ovidiu; Hershberger, John; Kogge, Peter M.; Snoeyink, Jack |
|
2001
|
Input-sensitive compliant motion in the plane. Zbl 1504.68254
Friedman, Joseph; Hershberger, John; Snoeyink, Jack |
|
1990
|
Testing homotopy for paths in the plane. Zbl 1414.68112
Cabello, Sergio; Liu, Yuanxin; Mantler, Andrea; Snoeyink, Jack |
|
2002
|
Interlocked open linkages with few joints. Zbl 1414.68117
Demaine, Erik D.; Langerman, Stefan; O’Rourke, Joseph; Snoeyink, Jack |
|
2002
|
Bumpy pyramid folding. Zbl 1443.68194
Abel, Zachary R.; Demaine, Erik D.; Demaine, Martin L.; Ito, Hiro; Snoeyink, Jack; Uehara, Ryuhei |
|
2018
|
Visibility graphs, dismantlability, and the cops and robbers game. Zbl 1407.91057
Lubiw, Anna; Snoeyink, Jack; Vosoughpour, Hamideh |
|
2017
|
Almost all Delaunay triangulations have stretch factor greater than \(\pi /2\). Zbl 1217.65044
Bose, Prosenjit; Devroye, Luc; Löffler, Maarten; Snoeyink, Jack; Verma, Vishal |
|
2011
|
Reconstructing polygons from scanner data. Zbl 1217.68227
Biedl, Therese; Durocher, Stephane; Snoeyink, Jack |
|
2011
|
Delaunay triangulation of imprecise points in linear time after preprocessing. Zbl 1177.65037
Löffler, Maarten; Snoeyink, Jack |
|
2010
|
Flexible isosurfaces: Simplifying and displaying scalar topology using the contour tree. Zbl 1175.65030
Carr, Hamish; Snoeyink, Jack; van de Panne, Michiel |
|
2010
|
Computation of non-dominated points using compact Voronoi diagrams. Zbl 1274.68617
Bhattacharya, Binay; Bishnu, Arijit; Cheong, Otfried; Das, Sandip; Karmakar, Arindam; Snoeyink, Jack |
|
2010
|
Computing planar Voronoi diagrams in double precision, a further example of degree-driven algorithm design. Zbl 1284.68611
Millman, David L.; Snoeyink, Jack |
|
2010
|
Reconstructing polygons from scanner data. Zbl 1273.68388
Biedl, Therese; Durocher, Stephane; Snoeyink, Jack |
|
2009
|
Time-varying Reeb graphs for continuous space-time data. Zbl 1149.65013
Edelsbrunner, Herbert; Harer, John; Mascarenhas, Ajith; Pascucci, Valerio; Snoeyink, Jack |
|
2008
|
Number of crossing-free geometric graphs vs. Triangulations. Zbl 1267.05097
Razen, Andreas; Snoeyink, Jack; Welzl, Emo |
|
2008
|
Delaunay triangulations of imprecise points in linear time after preprocessing. Zbl 1271.68235
Löffler, Maarten; Snoeyink, Jack |
|
2008
|
Efficient algorithms for maximum regression depth. Zbl 1161.62043
van Kreveld, Marc; Mitchell, Joseph S. B.; Rousseeuw, Peter; Sharir, Micha; Snoeyink, Jack; Speckmann, Bettina |
|
2008
|
Delineating boundaries for imprecise regions. Zbl 1141.68029
Reinbacher, Iris; Benkert, Marc; van Kreveld, Marc; Mitchell, Joseph S. B.; Snoeyink, Jack; Wolff, Alexander |
|
2008
|
Representing interpolant topology for contour tree computation. Zbl 1161.05342
Carr, Hamish; Snoeyink, Jack |
|
2008
|
How long can a graph be kept planar? Zbl 1159.91007
Anuradha, V.; Jain, Chinmay; Snoeyink, Jack; Szabó, Tibor |
|
2008
|
Quadratic and cubic B-splines by generalizing higher-order Voronoi diagrams. Zbl 1221.65067
Liu, Yuanxin; Snoeyink, Jack |
|
2007
|
Maximum independent set for intervals by divide and conquer with pruning. Zbl 1112.05081
Snoeyink, Jack |
|
2007
|
Almost-Delaunay simplices: Robust neighbor relations for imprecise 3D points using CGAL. Zbl 1114.65308
Bandyopadhyay, Deepak; Snoeyink, Jack |
|
2007
|
Counting and enumerating pointed pseudotriangulations with the greedy flip algorithm. Zbl 1120.68104
Brönnimann, Hervé; Kettner, Lutz; Pocchiola, Michel; Snoeyink, Jack |
|
2006
|
Efficient algorithm for approximating maximum inscribed sphere in high dimensional polytope. Zbl 1153.68550
Xie, Yulai; Snoeyink, Jack; Xu, Jinhui |
|
2006
|
Illustrating the streaming construction of 2D Delaunay triangulations. Zbl 1153.68535
Isenburg, Martin; Liu, Yuanxin; Shewchuk, Jonathan; Snoeyink, Jack |
|
2006
|
A lower bound for multicast key distribution. Zbl 1093.68541
Snoeyink, Jack; Suri, Subhash; Varghese, George |
|
2005
|
Polygonal path simplification with angle constraints. Zbl 1082.65018
Chen, Danny Z.; Daescu, Ovidiu; Hershberger, John; Kogge, Peter M.; Mi, Ningfang; Snoeyink, Jack |
|
2005
|
A comparison of five implementations of 3D Delaunay tessellation. Zbl 1097.68136
Liu, Yuanxin; Snoeyink, Jack |
|
2005
|
Lossless compression of predicted floating-point geometry. Zbl 1206.94019
Isenburg, Martin; Lindstrom, Peter; Snoeyink, Jack |
|
2005
|
Almost-Delaunay simplices, nearest neighbor relations for imprecise points. Zbl 1317.68244
Bandyopadhyay, Deepak; Snoeyink, Jack |
|
2004
|
Testing homotopy for paths in the plane. Zbl 1060.68127
Cabello, Sergio; Liu, Yuanxin; Mantler, Andrea; Snoeyink, Jack |
|
2004
|
Computing a \((1+\varepsilon)\)-approximate geometric minimum-diameter spanning tree. Zbl 1138.68477
Spriggs, Michael J.; Keil, J. Mark; Bespamyatnikh, Sergei; Segal, Michael; Snoeyink, Jack |
|
2004
|
The reflex-free hull. Zbl 1085.68175
Ahn, Hee-Kap; Cheng, Siu-Wing; Cheong, Otfried; Snoeyink, Jack |
|
2004
|
Computing contour trees in all dimensions. Zbl 1052.68098
Carr, Hamish; Snoeyink, Jack; Axen, Ulrike |
|
2003
|
Ununfoldable polyhedra with convex faces. Zbl 1021.52013
Bern, Marshall; Demaine, Erik D.; Eppstein, David; Kuo, Eric; Mantler, Andrea; Snoeyink, Jack |
|
2003
|
The size of spanning disks for polygonal curves. Zbl 1015.57008
Hass, Joel; Snoeyink, Jack; Thurston, William P. |
|
2003
|
Tight degree bounds for pseudo-triangulations of points. Zbl 1023.65013
Kettner, Lutz; Kirkpatrick, David; Mantler, Andrea; Snoeyink, Jack; Speckmann, Bettina; Takeuchi, Fumihiko |
|
2003
|
The Safari interface for visualizing time-dependent volume data using iso-surfaces and contour spectra. Zbl 1025.65019
Kettner, Lutz; Rossignac, Jarek; Snoeyink, Jack |
|
2003
|
Spanning trees crossing few barriers. Zbl 1033.68078
Asano, Tetsuo; de Berg, Mark; Cheong, Otfried; Guibas, Leonidas J.; Snoeyink, Jack; Tamaki, Hisao |
|
2003
|
Interlocked open and closed linkages with few joints. Zbl 1034.57004
Demaine, Erik D.; Langerman, Stefan; O’Rourke, Joseph; Snoeyink, Jack |
|
2003
|
Efficiently approximating polygonal paths in three and higher dimensions. Zbl 0994.68048
Barequet, G.; Chen, D. Z.; Daescu, O.; Goodrich, M. T.; Snoeyink, J. |
|
2002
|
On the time bound for convex decomposition of simple polygons. Zbl 1152.68670
Keil, Mark; Snoeyink, Jack |
|
2002
|
Kinetic collision detection for simple polygons. Zbl 1152.68671
Kirkpatrick, David; Snoeyink, Jack; Speckmann, Bettina |
|
2002
|
Some aperture-angle optimization problems. Zbl 1041.68106
Bose, P.; Hurtado-Diaz, F.; Omaña-Pulido, E.; Snoeyink, J.; Toussaint, G. T. |
|
2002
|
Compressing the property mapping of polygon meshes. Zbl 1033.68675
Isenburg, Martin; Snoeyink, Jack |
|
2002
|
Testing homotopy for paths in the plane. Zbl 1414.68112
Cabello, Sergio; Liu, Yuanxin; Mantler, Andrea; Snoeyink, Jack |
|
2002
|
Interlocked open linkages with few joints. Zbl 1414.68117
Demaine, Erik D.; Langerman, Stefan; O’Rourke, Joseph; Snoeyink, Jack |
|
2002
|
A one-step crust and skeleton extraction algorithm. Zbl 0983.68226
Gold, C.; Snoeyink, J. |
|
2001
|
On exclusion regions for optimal triangulations. Zbl 0967.68158
Drysdale, R. L.; McElfresh, Scott; Snoeyink, Jack Scott |
|
2001
|
Spirale reversi: Reverse decoding of the edgebreaker encoding. Zbl 1012.68658
Isenburg, Martin; Snoeyink, Jack |
|
2001
|
Intersecting red and blue line segments in optimal time and precision. Zbl 0990.68549
Mantler, Andrea; Snoeyink, Jack |
|
2001
|
Polygonal path approximation with angle constraints. Zbl 0987.68085
Chen, Danny Z.; Daescu, Ovidiu; Hershberger, John; Kogge, Peter M.; Snoeyink, Jack |
|
2001
|
Generalizing ham sandwich cuts to equitable subdivisions. Zbl 0966.68156
Bespamyatnikh, S.; Kirkpatrick, D.; Snoeyink, J. |
|
2000
|
Efficient algorithms for line and curve segment intersection using restricted predicates. Zbl 0958.68175
Boissonnat, Jean-Daniel; Snoeyink, Jack |
|
2000
|
Removing degeneracies by perturbing the problem or perturbing the world. Zbl 0996.65019
Alliez, Pierre; Devillers, Olivier; Snoeyink, Jack |
|
2000
|
Queries with segments in Voronoi diagrams. Zbl 0958.68174
Bespamyatnikh, Sergei; Snoeyink, Jack |
|
2000
|
Computing contour trees in all dimensions. Zbl 0961.68105
Carr, Hamish; Snoeyink, Jack; Axen, Ulrike |
|
2000
|
Kinetic collision detection for simple polygons. Zbl 1375.68151
Kirkpatrick, David; Snoeyink, Jack; Speckmann, Bettina |
|
2000
|
Finding the medial axis of a simple polygon in linear time. Zbl 0922.68128
Chin, F.; Snoeyink, J.; Wang, C. A. |
|
1999
|
On the bit complexity of minimum link paths: Superquadratic algorithms for problem solvable in linear time. Zbl 0922.68121
Kahan, Simon; Snoeyink, Jack |
|
1999
|
Cross-ratios and angles determine a polygon. Zbl 0939.68140
Snoeyink, J. |
|
1999
|
Computing constrained shortest segments: Butterfly wingspans in logarithmic time. Zbl 1020.52013
Kirkpatrick, David; Snoeyink, Jack |
|
1999
|
Queries with segments in Voronoi diagrams. Zbl 0938.68131
Bespamyatnikh, Sergei; Snoeyink, Jack |
|
1999
|
Cartographic line simplification and polygon CSG formulae in \(O(n\log^* n)\) time. Zbl 0913.68201
Hershberger, John; Snoeyink, Jack |
|
1998
|
Fitting a set of points by a circle. Zbl 0910.68219
García-López, J.; Ramos, P. A.; Snoeyink, J. |
|
1998
|
Erased arrangements of linear and convex decompositions of polyhedra. Zbl 0894.68153
Hershberger, J. E.; Snoeyink, J. S. |
|
1998
|
Optimal algorithms to embed trees in a point set. Zbl 0890.05066
Bose, Prosenjit; McAllister, Michael; Snoeyink, Jack |
|
1997
|
Primal dividing and dual pruning: Output-sensitive construction of four-dimensional polytopes and three-dimensional Voronoi diagrams. Zbl 0892.68099
Chan, T. M.; Snoeyink, J.; Yap, Chee-Keng |
|
1997
|
Point location. Zbl 0907.68196
Snoeyink, Jack |
|
1997
|
Linear-time reconstruction of Delaunay triangulations with applications. Zbl 1477.68493
Snoeyink, Jack; van Kreveld, Marc |
|
1997
|
Cartographic line simplication and polygon CSG formulae in \(O(n \log^* n)\) time. Zbl 1497.68532
Hershberger, John; Snoeyink, Jack |
|
1997
|
A compact piecewise-linear Voronoi diagram for convex sites in the plane. Zbl 0840.68119
McAllister, M.; Kirkpatrick, D.; Snoeyink, J. |
|
1996
|
Generating random polygons with given vertices. Zbl 0857.68101
Zhu, Chong; Sundaram, Gopalakrishnan; Snoeyink, Jack; Mitchell, Joseph S. B. |
|
1996
|
Efficiently planning compliant motion in the plane. Zbl 0852.68102
Friedman, Joseph; Hershberger, J.; Snoeyink, J. |
|
1996
|
Folding rulers inside triangles. Zbl 0846.68103
van Kreveld, Marc; Snoeyink, J.; Whitesides, S. |
|
1996
|
Tentative prune-and-search for computing fixed-points with applications to geometric computation. Zbl 0815.68119
Kirkpatrick, David; Snoeyink, Jack |
|
1995
|
Output-sensitive construction of polytopes in four dimensions and clipped Voronoi diagrams in three. Zbl 0848.68106
Chan, Timothy M. Y.; Snoeyink, Jack; Yap, Chee-Keng |
|
1995
|
Finding the medial axis of a simple polygon in linear time. Zbl 1512.68407
Chin, Francis; Snoeyink, Jack; Wang, Cao An |
|
1995
|
Computing common tangents without a separating line. Zbl 1502.68328
Kirkpatrick, David; Snoeyink, Jack |
|
1995
|
Ray shooting in polygons using geodesic triangulations. Zbl 0813.68158
Chazelle, B.; Edelsbrunner, H.; Grigni, M.; Guibas, L.; Hershberger, J.; Sharir, M.; Snoeyink, J. |
|
1994
|
Computing minimum length paths of a given homotopy class. Zbl 0815.68116
Hershberger, John; Snoeyink, Jack |
|
1994
|
Efficient ray shooting and hidden surface removal. Zbl 0813.68160
de Berg, M.; Halperin, D.; Overmars, M.; Snoeyink, J.; van Kreveld, M. |
|
1994
|
Objects that cannot be taken apart with two hands. Zbl 0813.52004
Snoeyink, J.; Stolfi, J. |
|
1994
|
An optimal algorithm for the on-line closest-pair problem. Zbl 0863.68113
Schwarz, C.; Smid, M.; Snoeyink, J. |
|
1994
|
Minimum-link \(c\)-oriented paths: Single-source queries. Zbl 0805.68061
Adegeest, John; Overmars, Mark; Snoeyink, Jack |
|
1994
|
Approximating polygons and subdivisions with minimum-link paths. Zbl 0803.68134
Guibas, Leonidas J.; Hershberger, John E.; Mitchell, Joseph S. B.; Snoeyink, Jack Scott |
|
1993
|
An efficient algorithm for finding the CSG representation of a simple polygon. Zbl 0777.68076
Dobkin, David; Guibas, Leonidas; Hershberger, John; Snoeyink, Jack |
|
1993
|
Computing a face in an arrangement of line segments and related problems. Zbl 0799.68182
Chazelle, Bernard; Edelsbrunner, Herbert; Guibas, Leonidas; Sharir, Micha; Snoeyink, Jack |
|
1993
|
Counting and reporting red/blue segment intersections. Zbl 1504.68265
Palazzi, Larry; Snoeyink, Jack |
|
1993
|
Counting and cutting cycles of lines and rods in space. Zbl 0748.68082
Chazelle, Bernard; Edelsbrunner, Herbert; Guibas, Leonidas J.; Pollack, Richard; Seidel, Raimund; Sharir, Micha; Snoeyink, Jack |
|
1992
|
Compact interval trees: A data structure for convex hulls. Zbl 0724.68088
Guibas, Leonidas; Hershberger, John; Snoeyink, Jack |
|
1991
|
Ray shooting in polygons using geodesic triangulations. Zbl 0769.68119
Chazelle, Bernard; Edelsbrunner, Herbert; Grigni, Michelangelo; Guibas, Leonidas; Hershberger, John; Sharir, Micha; Snoeyink, Jack |
|
1991
|
Computing a face in an arrangement of line segments. Zbl 0800.68956
Chazelle, Bernard; Edelsbrunner, Herbert; Guibas, Leonidas; Sharir, Micha; Snoeyink, Jack |
|
1991
|
Computing minimum length paths of a given homotopy class. (Extended abstract). Zbl 0764.68174
Hershberger, John; Snoeyink, Jack |
|
1991
|
Stabbing parallel segments with a convex polygon. Zbl 0771.68104
Goodrich, Michael T.; Snoeyink, Jack Scott |
|
1990
|
Compact interval trees: A data structure for convex hulls. Zbl 0800.68953
Guibas, Leonidas; Hershberger, John; Snoeyink, Jack |
|
1990
|
Input-sensitive compliant motion in the plane. Zbl 1504.68254
Friedman, Joseph; Hershberger, John; Snoeyink, Jack |
|
1990
|
Implicitly representing arrangements of lines or segments. Zbl 0688.68031
Edelsbrunner, Herbert; Guibas, Leonidas; Hershberger, John; Seidel, Raimund; Sharir, Micha; Snoeyink, Jack; Welzl, Emo |
|
1989
|
On arrangements of Jordan arcs with three intersections per pair. Zbl 0687.05004
Edelsbrunner, Herbert; Guibas, Leonidas; Hershberger, John; Pack, Janos; Pollack, Richard; Seidel, Raimund; Sharir, Micha; Snoeyink, Jack |
|
1989
|
Stabbing parallel segments with a convex polygon. Zbl 0794.68166
Goodrich, Michael T.; Snoeyink, Jack Scott |
|
1989
|