PUMA

academical publication management
collect, organize, and share publications

( en | de )

 

Disambiguation of "Snoeyink, Jack"

Author of the publication

copydeleteadd this publication to your clipboard
Bumpy Pyramid Folding.

, , , , , and . CCCG, Carleton University, Ottawa, Canada, (2014)

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.

No persons found for author name Snoeyink, Jack
add a person with the name Snoeyink, Jack
 

Other publications of authors with the same name

Computing contour trees in all dimensions., , and . SODA, page 918-926. ACM/SIAM, (2000)Approximating Shortest Paths in Arrangements of Lines., , , , and . CCCG, page 143-148. Carleton University Press, (1996)Two-dimensional Computation of the Three-dimensional Reachable Region for a Welding Head., and . CCCG, page 437-442. University of Waterloo, (1993)Faster Placement of Hydrogens in Protein Structures by Dynamic Programming., , and . ALENEX/ANALC, page 39-48. SIAM, (2004)On the Time Bound for Convex Decomposition of Simple Polygons., and . Int. J. Comput. Geometry Appl., 12 (3): 181-192 (2002)Covering Folded Shapes., , , , , , , , and . JoCG, 5 (1): 150-167 (2014)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)Efficient Algorithms for Maximum Regression Depth., , , , , and . Discrete & Computational Geometry, 39 (4): 656-677 (2008)Computation of Non-dominated Points Using Compact Voronoi Diagrams., , , , , and . WALCOM, volume 5942 of Lecture Notes in Computer Science, page 82-93. Springer, (2010)Delaunay triangulations of imprecise pointsin linear time after preprocessing., and . Symposium on Computational Geometry, page 298-304. ACM, (2008)