5 papers
Finding Pairwise Intersections of Rectangles in a Query Rectangle
Eunjin Oh, Hee-Kap Ahn
We consider the following problem: Preprocess a set of axis-parallel boxes in so that given a query of an axis-parallel box in , the…
Voronoi Diagrams for a Moderate-Sized Point-Set in a Simple Polygon
Eunjin Oh, Hee-Kap Ahn
Given a set of sites in a simple polygon, a geodesic Voronoi diagram of the sites partitions the polygon into regions based on distances to sites under the geodesic metric. We pres…
The Geodesic -center Problem in a Simple Polygon
Eunjin Oh, Jean-Lou De Carufel, Hee-Kap Ahn
The geodesic -center problem in a simple polygon with vertices consists in the following. Find a set of points in the polygon that minimizes the maximum geodesic dis…
A Generalization of the Convex Kakeya Problem
Hee-Kap Ahn, Sang Won Bae, Otfried Cheong +3
Given a set of line segments in the plane, not necessarily finite, what is a convex region of smallest area that contains a translate of each input segment? This question can be se…
Spatial Skyline Queries: An Efficient Geometric Algorithm
Wanbin Son, Mu-Woong Lee, Hee-Kap Ahn +1
As more data-intensive applications emerge, advanced retrieval semantics, such as ranking or skylines, have attracted attention. Geographic information systems are such an applicat…