( en | de | ru )

 

Disambiguation of "Snoeyink, Jack"

Author of the publication

copydeleteadd this publication to your clipboard
Two- and Three-Dimensional Point Location in Rectangular Subdivisions (Extended Abstract).

, , and . SWAT, volume 621 of Lecture Notes in Computer Science, page 352-363. Springer, (1992)

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 MacLelland

Jack Anderson

Jack Kalmi

Jack Nisenbaum

Jack Reis

 

Other publications of authors with the same name

Emerging Challenges in Computational Topology, , , , , , , , , and 12 other author(s). CoRR, (1999)Cross-Ratios and Angles Determine a Polygon.. Discret. Comput. Geom., 22 (4): 619-631 (1999)Creating a robust implementation for segment intersection by refinement: A multistage assignment that defines away degeneracies.. CCCG, page 309-314. Simon Fraser University, Vancouver, British Columbia, Canada, (2016)Generalizing Ham Sandwich Cuts to Equitable Subdivisions., , and . Discret. Comput. Geom., 24 (4): 605-622 (2000)Primal Dividing and Dual Pruning: Output-Sensitive Construction of Four-Dimensional Polytopes and Three-Dimensional Voronoi Diagrams., , and . Discret. Comput. Geom., 18 (4): 433-454 (1997)An Adaptive Dynamic Programming Algorithm for the Side Chain Placement Problem., , and . Pacific Symposium on Biocomputing, page 17-28. World Scientific, (2005)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)