No. |
Title |
Author |
Year |
---|

1 |
Approximate Range Queries for Clustering |
Oh, Eunjin et al. |
2018 |

2 |
Minimizing Distance-to-Sight in Polygonal Domains |
Oh, Eunjin |
2018 |

3 |
On Romeo and Juliet Problems: Minimizing Distance-to-Sight |
Ahn, Hee-Kap et al. |
2018 |

4 |
Point Location in Dynamic Planar Subdivisions |
Oh, Eunjin et al. |
2018 |

5 |
Point Location in Incremental Planar Subdivisions |
Oh, Eunjin |
2018 |

6 |
A New Balanced Subdivision of a Simple Polygon for Time-Space Trade-off Algorithms |
Oh, Eunjin et al. |
2017 |

7 |
Dynamic Geodesic Convex Hulls in Dynamic Simple Polygons |
Oh, Eunjin et al. |
2017 |

8 |
Faster Algorithms for Growing Prioritized Disks and Rectangles |
Ahn, Hee-Kap et al. |
2017 |

9 |
Finding Pairwise Intersections of Rectangles in a Query Rectangle |
Oh, Eunjin et al. |
2017 |

10 |
Voronoi Diagrams for a Moderate-Sized Point-Set in a Simple Polygon |
Oh, Eunjin et al. |
2017 |

11 |
A Near-Optimal Algorithm for Finding an Optimal Shortcut of a Tree |
Oh, Eunjin et al. |
2016 |

12 |
Assigning Weights to Minimize the Covering Radius in the Plane |
Oh, Eunjin et al. |
2016 |

13 |
Constrained Geodesic Centers of a Simple Polygon |
Oh, Eunjin et al. |
2016 |

14 |
The Farthest-Point Geodesic Voronoi Diagram of Points on the Boundary of a Simple Polygon |
Oh, Eunjin et al. |
2016 |

15 |
A Linear-Time Algorithm for the Geodesic Center of a Simple Polygon |
Ahn, Hee Kap et al. |
2015 |