http://chineseinput.net/에서 pinyin(병음)방식으로 중국어를 변환할 수 있습니다.
변환된 중국어를 복사하여 사용하시면 됩니다.
Quad-Subdivision을 이용한 Delaunay 삼각화 알고리즘 개발
박시형,이성수 한국공작기계학회 2000 한국공작기계학회 추계학술대회논문집 Vol.2000 No.-
Delaunay triangulation is well balanced in the sense that the triangles tend toward equiangularity. And so, Delaunay triangulation hasn't some slivers triangle. It's commonly used in various field of CAD applications, such as shape reconstruction, solid modeling and volume rendering. In this paper, an improved Delaunay triangulation is proposed in 2-dimensions. The suggested algorithm subdivides a uniform grids into sub-quad grids, and so efficient where points are non-uniform distribution. To get the mate from quad-subdivision algorithm, the area where triangulation-patch will be most likely created should be searched first.
GPU Library CUDA를 이용한 효율적인 Delaunay 격자 생성에 관한 연구
송지홍(J.H. SONG),강상현(S.H KANG),김경민(G.M. KIM),김병수(B.S. KIM) 한국전산유체공학회 2011 한국전산유체공학회 학술대회논문집 Vol.2011 No.5
In this study, an efficient algorithm for Delaunay triangulation of a number of points which can be used on a GPU-based parallel computation is studied. The developed algorithm is programmed using CUDA library, and the program takes full advantage of parallel computation which are concurrently performed on each of the threads on GPU. The results of partitioned triangulation collected from the GPU computation requires proper stitching between neighboring partitions and calculation of connectivities among triangular cells on CPU. In this study, the effect of number of threads on the efficiency and total duration for Delaunay grid generation is studied. And it is also shown that GPU computing using CUDA for Delaunay grid generation is feasible and it saves total time required for the triangulation of the large number points compared to the sequential CPU-based triangulation programs.