The following pages link to Hee-Kap Ahn (Q364849):
Displaying 50 items.
- Realistic roofs over a rectilinear polygon (Q364851) (← links)
- Overlap of convex polytopes under rigid motion (Q390361) (← links)
- Reachability by paths of bounded curvature in a convex polygon (Q425619) (← links)
- A generalization of the convex Kakeya problem (Q486985) (← links)
- Group nearest-neighbor queries in the \(L_1\) plane (Q500965) (← links)
- Top-\(k\) Manhattan spatial skyline queries (Q522965) (← links)
- Realistic roofs without local minimum edges over a rectilinear polygon (Q528488) (← links)
- Covering points by disjoint boxes with outliers (Q617548) (← links)
- Geometric matching algorithms for two realistic terrains (Q683754) (← links)
- A linear-time algorithm for the geodesic center of a simple polygon (Q728492) (← links)
- Empty pseudo-triangles in point sets (Q765318) (← links)
- Maximum-area and maximum-perimeter rectangles in polygons (Q827336) (← links)
- Computing minimum-area rectilinear convex hull and \(L\)-shape (Q833717) (← links)
- Maximizing the overlap of two planar convex sets under rigid motions (Q871058) (← links)
- Bundling three convex polygons to minimize area or perimeter (Q902419) (← links)
- An improved data stream algorithm for clustering (Q904105) (← links)
- On the minimum total length of interval systems expressing all intervals, and range-restricted queries (Q1000921) (← links)
- Casting an object with a core (Q1024213) (← links)
- Casting a polyhedron with directional uncertainty (Q1405007) (← links)
- The geodesic 2-center problem in a simple polygon (Q1615885) (← links)
- The minimum convex container of two convex polytopes under translations (Q1622345) (← links)
- Minimum-width square annulus intersecting polygons (Q1641095) (← links)
- Polygon queries for convex hulls of points (Q1790963) (← links)
- Building bridges between convex regions (Q1873160) (← links)
- Competitive facility location: the Voronoi game (Q1884986) (← links)
- Covering and piercing disks with two centers (Q1931270) (← links)
- Maximum overlap of convex polytopes under translation (Q1941219) (← links)
- Minimum-link shortest paths for polygons amidst rectilinear obstacles (Q2123290) (← links)
- Rearranging a sequence of points onto a line (Q2144451) (← links)
- Finding pairwise intersections of rectangles in a query rectangle (Q2175440) (← links)
- Middle curves based on discrete Fréchet distance (Q2206718) (← links)
- Efficient planar two-center algorithms (Q2230394) (← links)
- Largest triangles in a polygon (Q2230417) (← links)
- Covering a simple polygon by monotone directions (Q2269836) (← links)
- Computing the center region and its variants (Q2272371) (← links)
- Voronoi diagrams for a moderate-sized point-set in a simple polygon (Q2291454) (← links)
- The geodesic farthest-point Voronoi diagram in a simple polygon (Q2309478) (← links)
- Faster algorithms for growing prioritized disks and rectangles (Q2330036) (← links)
- Assigning weights to minimize the covering radius in the plane (Q2331208) (← links)
- Computing a geodesic two-center of points in a simple polygon (Q2331214) (← links)
- On Romeo and Juliet problems: minimizing distance-to-sight (Q2331220) (← links)
- A time-space trade-off for triangulations of points in the plane (Q2412397) (← links)
- A new balanced subdivision of a simple polygon for time-space trade-off algorithms (Q2415364) (← links)
- Aligning two convex figures to minimize area or perimeter (Q2428667) (← links)
- Maximum overlap and minimum convex hull of two convex polyhedra under translations (Q2483561) (← links)
- Inscribing an axially symmetric polygon and other approximation algorithms for planar convex sets (Q2489540) (← links)
- Casting with skewed ejection direction (Q2498406) (← links)
- Rectangular partitions of a rectilinear polygon (Q2678268) (← links)
- A Middle Curve Based on Discrete Fréchet Distance (Q2802924) (← links)
- Bundling Three Convex Polygons to Minimize Area or Perimeter (Q2842137) (← links)
