( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Aperture-Angle and Hausdorff-Approximation of Convex Figures.

, , , и . Discret. Comput. Geom., 40 (3): 414-429 (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.

Kyung-Hee Ahn

Ahn-Hee Lee

Yeon-Hee Ahn-Lee

Siegfried Kap

Hyewon Ahn

 

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

Geometric matching algorithms for two realistic terrains., , , и . Theor. Comput. Sci., (2018)Finding Pairwise Intersections of Rectangles in a Query Rectangle., и . CoRR, (2018)Approximation Algorithms for Inscribing or Circumscribing an Axially Symmetric Polygon to a Convex Polygon., , , , , и . COCOON, том 3106 из Lecture Notes in Computer Science, стр. 259-267. Springer, (2004)Computing the center region and its variants., и . Theor. Comput. Sci., (2019)Product Quantized Translation for Fast Nearest Neighbor Search., , , , и . AAAI, стр. 3295-3301. AAAI Press, (2018)Maximum-area and maximum-perimeter rectangles in polygons., , и . Comput. Geom., (2021)Assigning Weights to Minimize the Covering Radius in the Plane., и . ISAAC, том 64 из LIPIcs, стр. 58:1-58:12. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2016)A Near-Optimal Algorithm for Finding an Optimal Shortcut of a Tree., и . ISAAC, том 64 из LIPIcs, стр. 59:1-59:12. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2016)Computing the Center Region and Its Variants., и . WALCOM, том 10167 из Lecture Notes in Computer Science, стр. 254-265. Springer, (2017)Stacking and Bundling Two Convex Polygons., и . ISAAC, том 3827 из Lecture Notes in Computer Science, стр. 882-891. Springer, (2005)