( en | de | ru )

 

Disambiguation of "Snoeyink, Jack"

Author of the publication

copydeleteadd this publication to your clipboard
Efficient Algorithms for Maximum Regression Depth.

, , , , , and . Discret. Comput. Geom., 39 (4): 656-677 (2008)

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 Coumans

Jack Reis

Sibylle Jäck

 

Other publications of authors with the same name

Efficiently Approximating Polygonal Paths in Three and Higher Dimensions., , , , and . Algorithmica, 33 (2): 150-167 (2002)Efficient Ray Shooting and Hidden Surface Removal., , , , and . Algorithmica, 12 (1): 30-53 (1994)Faster Placement of Hydrogens in Protein Structures by Dynamic Programming., , and . ALENEX/ANALC, page 39-48. SIAM, (2004)Counting and cutting cycles of lines and rods in space, , , , , , and . Computational Geometry: Theory and Applications, 1 (6): 305―323 (1992)Emerging Challenges in Computational Topology, , , , , , , , , and 12 other author(s). CoRR, (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)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)On the Time Bound for Convex Decomposition of Simple Polygons., and . Int. J. Comput. Geom. Appl., 12 (3): 181-192 (2002)Covering Folded Shapes., , , , , , , , and . J. Comput. Geom., 5 (1): 150-167 (2014)