개인구독
소속 기관이 없으신 경우, 개인 정기구독을 하시면 저렴하게
논문을 무제한 열람 이용할 수 있어요.
지원사업
학술연구/단체지원/교육 등 연구자 활동을 지속하도록 DBpia가 지원하고 있어요.
커뮤니티
연구자들이 자신의 연구와 전문성을 널리 알리고, 새로운 협력의 기회를 만들 수 있는 네트워킹 공간이에요.
논문 기본 정보
- 자료유형
- 학술저널
- 저자정보
- 저널정보
- 한국산업응용수학회 JOURNAL OF THE KOREAN SOCIETY FOR INDUSTRIAL AND APPLIED MATHEMATICS Journal of the Korean Society for Industrial and Applied Mathematics Vol.16 No.1
- 발행연도
- 2012.3
- 수록면
- 31 - 49 (19page)
이용수
초록· 키워드
오류제보하기
In this paper, we propose a very efficient method which reconstructs the high resolution surface from a set of unorganized points. Our method is based on the level set method using adaptive octree. We start with the surface reconstruction model proposed in [20]. In [20], they introduced a very fast and efficient method which is different from the previous methods using the level set method. Most existing methods[21, 22] employed the time evolving process from an initial surface to point cloud. But in [20], they considered the surface reconstruction process as an elliptic problem in the narrow band including point cloud. So they could obtain very speedy method because they didn’t have to limit the time evolution step by the finite speed of propagation.
However, they implemented that model just on the uniform grid. So they still have the weakness that it needs so much memories because of being fulfilled only on the uniform grid. Their algorithm basically solves a large linear system of which size is the same as the number of the grid in a narrow band. Besides, it is not easy to make the width of band narrow enough since the decision of band width depends on the distribution of point data. After all, as far as it is implemented on the uniform grid, it is almost impossible to generate the surface on the high resolution because the memory requirement increases geometrically.
We resolve it by adapting octree data structure[12, 11] to our problem and by introducing a new redistancing algorithm which is different from the existing one[19].
However, they implemented that model just on the uniform grid. So they still have the weakness that it needs so much memories because of being fulfilled only on the uniform grid. Their algorithm basically solves a large linear system of which size is the same as the number of the grid in a narrow band. Besides, it is not easy to make the width of band narrow enough since the decision of band width depends on the distribution of point data. After all, as far as it is implemented on the uniform grid, it is almost impossible to generate the surface on the high resolution because the memory requirement increases geometrically.
We resolve it by adapting octree data structure[12, 11] to our problem and by introducing a new redistancing algorithm which is different from the existing one[19].
목차
ABSTRACT
1. INTRODUCTION
2. MATHEMATICAL MODELS
3. NUMERICAL METHOD
4. EXPERIMENTAL RESULTS
5. CONCLUSION AND FUTURE WORK
ACKNOWLEDGMENTS
REFERENCES
참고문헌 (23)
참고문헌 신청
1. [학술대회논문] - M. Alexa / 2001 / Point Set Surfaces / Proceedings of the conference on Visualization ’01 : 21 ~ 28
2. [학술지(정기간행물)] - N. Amenta / 1998 / The crust and the -skeleton: combinatorial curve reconstruction / Graphical Models Image Process 60 : 125 ~ 135
3. [학술대회논문] - N. Amenta / 2001 / The power crust / Proc. ACM Solid Modeling : 249 ~ 260
4. [학술대회논문] - J. C. Carr / 2001 / Reconstruction and Representation of 3D Objecets with Radial Basis Functions / Proceedings of ACM SIGGRAPH : 67 ~ 76
5. [학술대회논문] - H. Edelsbrunner / 1992 / Three-dimensional alpha shapes / Workshop on Volume Visualization : 75 ~ 105
2. [학술지(정기간행물)] - N. Amenta / 1998 / The crust and the -skeleton: combinatorial curve reconstruction / Graphical Models Image Process 60 : 125 ~ 135
3. [학술대회논문] - N. Amenta / 2001 / The power crust / Proc. ACM Solid Modeling : 249 ~ 260
4. [학술대회논문] - J. C. Carr / 2001 / Reconstruction and Representation of 3D Objecets with Radial Basis Functions / Proceedings of ACM SIGGRAPH : 67 ~ 76
5. [학술대회논문] - H. Edelsbrunner / 1992 / Three-dimensional alpha shapes / Workshop on Volume Visualization : 75 ~ 105
이 논문의 저자 정보
최근 본 자료
댓글(0)
0
UCI(KEPA) : I410-ECN-0101-2013-410-001705323