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
Current Page :
Number of result pages: 2
Number of documents: 15


DROPS-Home | Fulltext Search | Imprint | Privacy Published by LZI