( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Input-Sensitive Compliant Motion in the Plane.

, , и . SWAT, том 447 из Lecture Notes in Computer Science, стр. 225-237. Springer, (1990)

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.

Jack Kalmi

Jack Anderson

Jack MacLelland

Jack Nisenbaum

Jack Coumans

 

Другие публикации лиц с тем же именем

Visibility graphs, dismantlability, and the cops and robbers game., , и . Comput. Geom., (2017)Path Seeds and Flexible Isosurfaces - Using Topology for Exploratory Visualization., и . VisSym, стр. 49-58. Eurographics Association, (2003)Computing contour trees in all dimensions., , и . SODA, стр. 918-926. ACM/SIAM, (2000)Computing Constrained Shortest Segments: Butterfly Wingspans in Logarithmic Time., и . Int. J. Comput. Geom. Appl., 9 (1): 53-62 (1999)On the Time Bound for Convex Decomposition of Simple Polygons., и . Int. J. Comput. Geom. Appl., 12 (3): 181-192 (2002)Compact interval trees: a data structure for convex hulls., , и . Int. J. Comput. Geom. Appl., 1 (1): 1-22 (1991)Stabbing Parallel Segments with a Convex Polygon (Extended Abstract)., и . WADS, том 382 из Lecture Notes in Computer Science, стр. 231-242. Springer, (1989)Finding the Medial Axis of a Simple Polygon in Linear Time., , и . ISAAC, том 1004 из Lecture Notes in Computer Science, стр. 382-391. Springer, (1995)Some Aperture-Angle Optimization Problems., , , , и . Algorithmica, 33 (4): 411-435 (2002)Computation of Non-dominated Points Using Compact Voronoi Diagrams., , , , , и . WALCOM, том 5942 из Lecture Notes in Computer Science, стр. 82-93. Springer, (2010)