Browse "School of Computing(전산학부)" by Subject Computational geometry
Showing results 1 to 16 of 16
| A fast algorithm for data collection along a fixed track Cheong, Otfried; El Shawi, R.; Gudmundsson, J., THEORETICAL COMPUTER SCIENCE, v.554, pp.254 - 262, 2014-10 |
| A Generalization of the Convex Kakeya Problem Ahn, Hee-Kap; Bae, Sang Won; Cheong, Otfried; Gudmundsson, Joachim; Tokuyama, Takeshi; Vigneron, Antoine, ALGORITHMICA, v.70, no.2, pp.152 - 170, 2014-10 |
| Aligning Two Convex Figures to Minimize Area or Perimeter Ahn, Hee-Kap; Cheong, Otfried, ALGORITHMICA, v.62, pp.464 - 479, 2012-02 |
| 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 |
| Data storage in sensor networks for multi-dimensional range queries Lee, Ji Yeon; Lim, Yong Hun; Chung, Yon Dohn; Kim, Myoung Ho, Lecture notes in computer science, v.3820, pp.420-429, 2005-12 |
| Exact Algorithms for the Bottleneck Steiner Tree Problem Bae, SW; Choi, Sunghee; Lee, C; Tanigawa, S, ALGORITHMICA, v.61, no.4, pp.924 - 948, 2011-12 |
| Fast collision detection among multiple moving spheres = 움직이는 많은 구들 사이의 빠른 충돌검사link Kim, Dong-Jin; 김동진; et al, 한국과학기술원, 1999 |
| Geometric matching problems = 기하학적 매칭에 관한 연구link Yon, Juyoung; 연주영; et al, 한국과학기술원, 2015 |
| On determining 3D manufacturability using gaussian sphere = 가우시안구를 이용한 삼차원 제조성의 결정에 관하여link Ha, Jong-Sung; 하종성; et al, 한국과학기술원, 1996 |
| 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 |
| Reverse Nearest Neighbor Queries in Fixed Dimension Cheong, Otfried; Vigneron, Antoine; Yon, Juyoung, INTERNATIONAL JOURNAL OF COMPUTATIONAL GEOMETRY APPLICATIONS, v.21, no.2, pp.179 - 188, 2011-04 |
| Tree drawing using partition-and-merge strategy in two and three dimensions = 분할-합병 전략을 이용한 이차원과 삼차원에서 트리 그리기link Shin, Chan-Su; 신찬수; et al, 한국과학기술원, 1998 |
| 변형된 선분 센터를 구하는 선형 알고리즘 = Linear algorithms for computing a variant segment centerlink 김범준; Kim, Bom-Jun; et al, 한국과학기술원, 1999 |
| 볼록다각형 경계선에서의 κ-센터 문제 = κ-center problem on the convex polygon boundarylink 김영일; Kim, Young-Il; et al, 한국과학기술원, 1999 |
| 볼록다각형에서의 2-센터 문제 = 2-center problem for convex polygonslink 김정현; Kim, Jung-Hyun; et al, 한국과학기술원, 1998 |
| 제한된 직교 단조 다각형의 근사 최단 경로를 구하는 알고리즘 = An algorithm for competitive shortest path of restricted rectilinear monotone polygonlink 이민규; Yi, Min-Kyu; et al, 한국과학기술원, 1998 |
Discover
Open Access
- 187 OA Article
Date issued
- 1,893 2020 - 2024
- 5,392 2010 - 2019
- 4,587 2000 - 2009
- 2,927 1990 - 1999
- 839 1980 - 1989