×

zbMATH — the first resource for mathematics

Oh, Eunjin

Compute Distance To:
Author ID: oh.eunjin Recent zbMATH articles by "Oh, Eunjin"
Published as: Oh, Eunjin
Documents Indexed: 35 Publications since 2015

Publications by Year

Citations contained in zbMATH

13 Publications have been cited 29 times in 18 Documents Cited by Year
A linear-time algorithm for the geodesic center of a simple polygon. Zbl 1355.68276
Ahn, Hee-Kap; Barba, Luis; Bose, Prosenjit; De Carufel, Jean-Lou; Korman, Matias; Oh, Eunjin
6
2016
The farthest-point geodesic Voronoi diagram of points on the boundary of a simple polygon. Zbl 1387.68272
Oh, Eunjin; Barba, Luis; Ahn, Hee-Kap
5
2016
A linear-time algorithm for the geodesic center of a simple polygon. Zbl 1379.68312
Ahn, Hee Kap; Barba, Luis; Bose, Prosenjit; De Carufel, Jean-Lou; Korman, Matias; Oh, Eunjin
4
2015
A time-space trade-off for triangulations of points in the plane. Zbl 1434.68745
Ahn, Hee-Kap; Baraldo, Nicola; Oh, Eunjin; Silvestri, Francesco
3
2017
Voronoi diagrams for a moderate-sized point-set in a simple polygon. Zbl 1432.68524
Oh, Eunjin; Ahn, Hee-Kap
2
2017
A near-optimal algorithm for finding an optimal shortcut of a tree. Zbl 1398.05204
Oh, Eunjin; Ahn, Hee-Kap
2
2016
Computing a geodesic two-center of points in a simple polygon. Zbl 07122169
Oh, Eunjin; Bae, Sang Won; Ahn, Hee-Kap
1
2019
Minimum-width annulus with outliers: circular, square, and rectangular cases. Zbl 1446.68172
Ahn, Hee-Kap; Ahn, Taehoon; Bae, Sang Won; Choi, Jongmin; Kim, Mincheol; Oh, Eunjin; Shin, Chan-Su; Yoon, Sang Duk
1
2019
The geodesic 2-center problem in a simple polygon. Zbl 1443.68207
Oh, Eunjin; De Carufel, Jean-Lou; Ahn, Hee-Kap
1
2018
Polygon queries for convex hulls of points. Zbl 06946783
Oh, Eunjin; Ahn, Hee-Kap
1
2018
Constrained geodesic centers of a simple polygon. Zbl 1378.68183
Oh, Eunjin; Son, Wanbin; Ahn, Hee-Kap
1
2016
Computing a geodesic two-center of points in a simple polygon. Zbl 06576702
Oh, Eunjin; Bae, Sang Won; Ahn, Hee-Kap
1
2016
The 2-center problem in a simple polygon. Zbl 06528543
Oh, Eunjin; De Carufel, Jean-Lou; Ahn, Hee-Kap
1
2015
Computing a geodesic two-center of points in a simple polygon. Zbl 07122169
Oh, Eunjin; Bae, Sang Won; Ahn, Hee-Kap
1
2019
Minimum-width annulus with outliers: circular, square, and rectangular cases. Zbl 1446.68172
Ahn, Hee-Kap; Ahn, Taehoon; Bae, Sang Won; Choi, Jongmin; Kim, Mincheol; Oh, Eunjin; Shin, Chan-Su; Yoon, Sang Duk
1
2019
The geodesic 2-center problem in a simple polygon. Zbl 1443.68207
Oh, Eunjin; De Carufel, Jean-Lou; Ahn, Hee-Kap
1
2018
Polygon queries for convex hulls of points. Zbl 06946783
Oh, Eunjin; Ahn, Hee-Kap
1
2018
A time-space trade-off for triangulations of points in the plane. Zbl 1434.68745
Ahn, Hee-Kap; Baraldo, Nicola; Oh, Eunjin; Silvestri, Francesco
3
2017
Voronoi diagrams for a moderate-sized point-set in a simple polygon. Zbl 1432.68524
Oh, Eunjin; Ahn, Hee-Kap
2
2017
A linear-time algorithm for the geodesic center of a simple polygon. Zbl 1355.68276
Ahn, Hee-Kap; Barba, Luis; Bose, Prosenjit; De Carufel, Jean-Lou; Korman, Matias; Oh, Eunjin
6
2016
The farthest-point geodesic Voronoi diagram of points on the boundary of a simple polygon. Zbl 1387.68272
Oh, Eunjin; Barba, Luis; Ahn, Hee-Kap
5
2016
A near-optimal algorithm for finding an optimal shortcut of a tree. Zbl 1398.05204
Oh, Eunjin; Ahn, Hee-Kap
2
2016
Constrained geodesic centers of a simple polygon. Zbl 1378.68183
Oh, Eunjin; Son, Wanbin; Ahn, Hee-Kap
1
2016
Computing a geodesic two-center of points in a simple polygon. Zbl 06576702
Oh, Eunjin; Bae, Sang Won; Ahn, Hee-Kap
1
2016
A linear-time algorithm for the geodesic center of a simple polygon. Zbl 1379.68312
Ahn, Hee Kap; Barba, Luis; Bose, Prosenjit; De Carufel, Jean-Lou; Korman, Matias; Oh, Eunjin
4
2015
The 2-center problem in a simple polygon. Zbl 06528543
Oh, Eunjin; De Carufel, Jean-Lou; Ahn, Hee-Kap
1
2015

Citations by Year