( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
The Geodesic Farthest-point Voronoi Diagram in a Simple Polygon.

, , и . CoRR, (2018)

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.

Eunjin Kim

Eunkyong Oh

Alexander Oh

Jinsook Oh

Erika Oh

 

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

Constrained Geodesic Centers of a Simple Polygon., , и . SWAT, том 53 из LIPIcs, стр. 29:1-29:13. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2016)Minimizing Distance-to-Sight in Polygonal Domains.. ISAAC, том 123 из LIPIcs, стр. 59:1-59:12. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2018)A New Balanced Subdivision of a Simple Polygon for Time-Space Trade-off Algorithms., и . ISAAC, том 92 из LIPIcs, стр. 61:1-61:12. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2017)Effects of speaker gender on voice onset time in Korean stops.. J. Phonetics, 39 (1): 59-67 (2011)The 2-Center Problem in a Simple Polygon., , и . ISAAC, том 9472 из Lecture Notes in Computer Science, стр. 307-317. Springer, (2015)Approximate Range Queries for Clustering., и . SoCG, том 99 из LIPIcs, стр. 62:1-62:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2018)The Farthest-Point Geodesic Voronoi Diagram of Points on the Boundary of a Simple Polygon., , и . SoCG, том 51 из LIPIcs, стр. 56:1-56:15. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2016)Algorithms for Computing Maximum Cliques in Hyperbolic Random Graphs., и . ESA, том 274 из LIPIcs, стр. 85:1-85:15. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2023)ETH-Tight Algorithm for Cycle Packing on Unit Disk Graphs., и . SoCG, том 293 из LIPIcs, стр. 7:1-7:15. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2024)The Geodesic Farthest-point Voronoi Diagram in a Simple Polygon., , и . CoRR, (2018)