발행물

전체 논문

194

61

The geodesic 2-center problem in a simple polygon
Eunjin Oh, Jean-Lou De Carufel, Hee-Kap Ahn
Computational Geometry: Theory and Applications, 2018

62

Geometric Matching Algorithms for Two Realistic Terrains
Sang Duk Yoon, Min-Gyu Kim, Wanbin Son, Hee-Kap Ahn
Theoretical Computer Science, 2018

63

Top-*k* Manhattan Spatial Skyline Queries
Wanbin Son, Fabian Stehn, Christian Knauer, Hee-Kap Ahn
Information Processing Letters, 2017

64

Realistic Roofs without Local Minimum Edges over a Rectilinear Polygon
Sang Duk Yoon, Hee-Kap Ahn, Jessica Sherette
Theoretical Computer Science, 2017

65

A linear-time algorithm for the geodesic center of a simple polygon
Hee-Kap Ahn, Luis Barba, Prosenjit Bose, Jean-Lou De Carufel, Matias Korman, Eunjin Oh
Discrete & Computational Geometry, 2016

66

Bundling Three Convex Polygons to Minimize Area or Perimeter
Dongwoo Park, Sang Won Bae, Helmut Alt, Hee-Kap Ahn
Computational Geometry: Theory and Applications, 2016

67

Group Nearest-Neighbor Queries in the *L1* Plane
Wanbin Son, Sang Won Bae, Hee-Kap Ahn
Theoretical Computer Science, 2015

68

An Improved Data Stream Algorithm for Clustering
Sang-Sub Kim, Hee-Kap Ahn
Computational Geometry: Theory and Applications, 2015

69

Computing *k* centers over Streaming Data for Small *k*
Hee-Kap Ahn, Hyo-Sil Kim, Sang-Sub Kim, Wanbin Son
International Journal of Computational Geometry and Applications, 2014

70

A Generalization of the Convex Kakeya Problem
Hee-Kap Ahn, Sang Won Bae, Otfried Cheong, Joachim Gudmundsson, Takeshi Tokuyama, Antoine Vigneron
ALGORITHMICA, 201410