( en | de | ru )

 

Disambiguation of "Ahn, Hee-Kap"

Author of the publication

copydeleteadd this publication to your clipboard
Minimum-link shortest paths for polygons amidst rectilinear obstacles.

, and . Comput. Geom., (2022)

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.

Kyung-Hee Ahn

Ahn-Hee Lee

Yeon-Hee Ahn-Lee

Siegfried Kap

Hyewon Ahn

 

Other publications of authors with the same name

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