Showing results 1 to 6 of 6
Best and worst-case coverage problems for arbitrary paths in wireless sensor networks Lee, Chun-Seok; Shin, Dong-Hoon; Bae, Sang-Won; Choi, Sung-Hee, AD HOC NETWORKS, v.11, no.6, pp.1699 - 1714, 2013-08 |
Computing minimum-area rectilinear convex hull and L-shape Bae, Sang-Won; Lee, Chun-Seok; Ahn, Hee-Kap; Choi, Sung-Hee; Chwa, Kyung-Yong, COMPUTATIONAL GEOMETRY-THEORY AND APPLICATIONS, v.42, no.9, pp.903 - 912, 2009 |
On exact solutions to the Euclidean bottleneck Steiner tree problem Bae, Sang-Won; Lee, Chun-Seok; Choi, Sung-Hee, INFORMATION PROCESSING LETTERS, v.110, no.16, pp.672 - 678, 2010-07 |
OPTIMAL CONSTRUCTION OF THE CITY VORONOI DIAGRAM Bae, Sang-Won; Kim, Jae-Hoon; Chwa, Kyung-Yong, INTERNATIONAL JOURNAL OF COMPUTATIONAL GEOMETRY & APPLICATIONS, v.19, pp.95 - 117, 2009-04 |
Proximity and location problems on transportation networks = 트랜스포테이션 네트워크에서 발생하는 근접성 및 배치 문제에 대한 연구link Bae, Sang-Won; 배상원; et al, 한국과학기술원, 2008 |
Voronoi diagrams with transportation on the euclidean plane = 트랜스포테이션 모델에서의 보로노이 다이어그램link Bae, Sang-Won; 배상원; et al, 한국과학기술원, 2004 |
Discover