( en | de | ru )

 

Disambiguation of "Snoeyink, Jack"

Author of the publication

copydeleteadd this publication to your clipboard
Computing a Face in an Arrangement of Line Segments and Related Problems.

, , , , and . SIAM J. Comput., 22 (6): 1286-1302 (1993)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Jack Kalmi

Jack Nisenbaum

Jack Anderson

Jack MacLelland

Jack Reis

 

Other publications of authors with the same name

Visibility graphs, dismantlability, and the cops and robbers game., , and . Comput. Geom., (2017)Path Seeds and Flexible Isosurfaces - Using Topology for Exploratory Visualization., and . VisSym, page 49-58. Eurographics Association, (2003)Computing contour trees in all dimensions., , and . SODA, page 918-926. ACM/SIAM, (2000)Reducing the memory required to find a geodesic shortest path on a large mesh., and . GIS, page 227-235. ACM, (2009)Bio-geometry: challenges, approaches, and future opportunities in proteomics and drug discovery., , , , and . Symposium on Solid and Physical Modeling, page 417-418. ACM, (2008)Finding the Medial Axis of a Simple Polygon in Linear Time., , and . ISAAC, volume 1004 of Lecture Notes in Computer Science, page 382-391. Springer, (1995)On the Time Bound for Convex Decomposition of Simple Polygons., and . Int. J. Comput. Geom. Appl., 12 (3): 181-192 (2002)Compact interval trees: a data structure for convex hulls., , and . Int. J. Comput. Geom. Appl., 1 (1): 1-22 (1991)Computing Constrained Shortest Segments: Butterfly Wingspans in Logarithmic Time., and . Int. J. Comput. Geom. Appl., 9 (1): 53-62 (1999)Stabbing Parallel Segments with a Convex Polygon (Extended Abstract)., and . WADS, volume 382 of Lecture Notes in Computer Science, page 231-242. Springer, (1989)