Sang Won Bae
Cited by
Cited by
3D medial axis point approximation using nearest neighbors and the normal field
J Ma, SW Bae, S Choi
The Visual Computer 28, 7-19, 2012
Geometric stable roommates
EM Arkin, SW Bae, A Efrat, K Okamoto, JSB Mitchell, V Polishchuk
Information Processing Letters 109 (4), 219-224, 2009
On exact solutions to the Euclidean bottleneck Steiner tree problem
SW Bae, C Lee, S Choi
Information Processing Letters 110 (16), 672-678, 2010
Gap-planar graphs
SW Bae, JF Baffier, J Chun, P Eades, K Eickmeyer, L Grilli, SH Hong, ...
Theoretical Computer Science 745, 36-52, 2018
Best and worst-case coverage problems for arbitrary paths in wireless sensor networks
C Lee, D Shin, SW Bae, S Choi
Ad Hoc Networks 11 (6), 1699-1714, 2013
Shortest paths and Voronoi diagrams with transportation networks under general distances
SW Bae, KY Chwa
Algorithms and Computation: 16th International Symposium, ISAAC 2005, Sanya …, 2005
Covering points by disjoint boxes with outliers
HK Ahn, SW Bae, ED Demaine, ML Demaine, SS Kim, M Korman, ...
Computational Geometry 44 (3), 178-190, 2011
Computing minimum-area rectilinear convex hull and L-shape
SW Bae, C Lee, HK Ahn, S Choi, KY Chwa
Computational Geometry 42 (9), 903-912, 2009
Constructing optimal highways
HK Ahn, H Alt, T Asano, SW Bae, P Brass, O Cheong, C Knauer, HS Na, ...
International Journal of Foundations of Computer Science 20 (01), 3-23, 2009
The geodesic diameter of polygonal domains
SW Bae, M Korman, Y Okamoto
Discrete & Computational Geometry 50, 306-329, 2013
Voronoi diagrams with a transportation network on the Euclidean plane
SW Bae, KY Chwa
Algorithms and Computation: 15th International Symposium, ISAAC 2004, Hong …, 2005
Computing a minimum-width square annulus in arbitrary orientation
SW Bae
Theoretical Computer Science 718, 2-13, 2018
Voronoi diagrams for a transportation network on the Euclidean plane
SW Bae, KY Chwa
International Journal of Computational Geometry & Applications 16 (02n03 …, 2006
Optimal construction of the city Voronoi diagram
SW Bae, JH Kim, KY Chwa
Algorithms and Computation: 17th International Symposium, ISAAC 2006 …, 2006
Computing the geodesic centers of a polygonal domain
SW Bae, M Korman, Y Okamoto
Computational Geometry 77, 3-9, 2019
Computing the L1 geodesic diameter and center of a simple polygon in linear time
SW Bae, M Korman, Y Okamoto, H Wang
Computational Geometry 48 (6), 495-505, 2015
Theta-3 is connected
O Aichholzer, SW Bae, L Barba, P Bose, M Korman, A Van Renssen, ...
Computational geometry 47 (9), 910-917, 2014
Exact algorithms for the bottleneck Steiner tree problem
SW Bae, S Choi, C Lee, S Tanigawa
Algorithmica 61, 924-948, 2011
All farthest neighbors in the presence of highways and obstacles
SW Bae, M Korman, T Tokuyama
WALCOM: Algorithms and Computation: Third International Workshop, WALCOM …, 2009
Tight bounds for beacon-based coverage in simple rectilinear polygons
SW Bae, CS Shin, A Vigneron
Computational Geometry 80, 40-52, 2019
The system can't perform the operation now. Try again later.
Articles 1–20