( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Minimum Many to Many Matchings for Computing the Distance Between Two Sequences.

, , и . CCCG, (2011)

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.

Godfried Schwartz

Godfried Driel

Godfried Seth Darkoh

Roland Toussaint

Rolf Toussaint

 

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

Analysis of musical rhythm complexity measures in a cultural context., и . C3S2E, том 290 из ACM International Conference Proceeding Series, стр. 1-9. ACM, (2008)Convexifying polygons with simple projections., , , , и . Inf. Process. Lett., 80 (2): 81-86 (2001)On Removing Non-degeneracy Assumptions in Computational Geometry., , и . CIAC, том 1203 из Lecture Notes in Computer Science, стр. 86-99. Springer, (1997)Quadrangulations of Planar Sets.. WADS, том 955 из Lecture Notes in Computer Science, стр. 218-227. Springer, (1995)Computing largest empty circles with location constraints.. Int. J. Parallel Program., 12 (5): 347-358 (1983)Minimum Many to Many Matchings for Computing the Distance Between Two Sequences., , и . CCCG, (2011)Visibility between two edges of a simple polygon., , и . Vis. Comput., 2 (6): 342-357 (1986)Fast algorithms for computing the diameter of a finite planar set., и . Vis. Comput., 3 (6): 379-388 (1988)Efficient triangulation of simple polygons.. Vis. Comput., 7 (5&6): 280-295 (1991)Computing a Shortest Weakly Externally Visible Line Segment for a Simple Polygon., , и . Int. J. Comput. Geom. Appl., 9 (1): 81-96 (1999)