The KIPS Transactions:PartB (정보처리학회논문지B)

Korea Information Processing Society (한국정보처리학회)
권호 표지
DOI QR코드

DOI QR Code

A Surface Reconstruction Method from Contours Based on Dividing Virtual Belt

가상벨트 분할에 기반한 등고선으로부터의 표면재구성 방법

  • 최영규 (한국기술교육대학교 정보기술공학부) ;
  • 이승하 (단국대학교 의과대학 의공학교실)
  • Published : 2007.10.31
Download PDF
⟨ Previous Next ⟩

Abstract

This paper addresses a new technique for constructing surface model from a set of wire-frame contours. The most difficult problem of this technique, called contour triangulation, arises when there are many branches on the surface, and causes lots of ambiguities in surface definition process. In this paper, the branching problem is reduced as the surface reconstruction from a set of virtual belts and virtual canyons. To tile the virtual belts, a divide-and-conquer strategy based tiling technique, called the BPA algorithm, is adopted. The virtual canyons are covered naturally by an iterative convex removal algorithm with addition of a center vertex for each branching surface. Compared with most of the previous works reducing the multiple branching problem into a set of tiling problems between contours, our method can handle the problem more easily by transforming it into more simple topology, the virtual belt and the virtual canyon. Furthermore, the proposed method does not involve any set of complicated criteria, and provides a simple and robust algorithm for surface triangulation. The result shows that our method works well even though there are many complicated branches in the object.

등고선으로 표현된 물체의 볼륨정보에서부터 3차원 표면을 재구성하는 새로운 알고리즘을 제안한다. 등고선 삼각분할법이라고도 불리는 이 방법의 가장 어려운 문제가 인접 단층사이에서 표면이 다중으로 분기하는 경우에 발생하는데, 이것은 하나의 등고선이 인접한 층의 두 개 이상의 등고선과 연결되는 형태로 나타나며, 표면 생성시 많은 모호성을 발생시킨다. 본 논문에서는 이러한 다중분기문제를 여러 개의 가상벨트와 가상계곡으로 나누어 이들에 대한 표면생성문제로 단순화 시키는 방법을 제안한다. 가상벨트의 표면생성에는 띠분할 알고리즘을 채택하였으며, 가상계곡은 반복적인 볼록정점 제거와 중앙정점 추가로 보다 자연스러운 표면을 생성한다. 기존의 대부분의 알고리즘특이 다중분기문제를 한 쌍의 등고선간의 표면생성문제로 변환하는데 초점을 맞추는데 비해 제안된 방법은 더 작은 형태인 가상벨트와 가상계곡으로 단순화한다. 또한 제안된 방법은 표면정의에 복잡한 기준을 사용하지 않으며, 표면삼각분할을 위한 매우 명확하고 일관된 알고리즘을 제공한다. 실험을 통해 제안된 방법이 많은 분기가 발생하는 복잡한 데이터에서도 잘 동작하는 것을 알 수 있었다.

Keywords

References

  1. K. Hohne and R. Bernstein, 'Shading 3d-images from CT using gray-level gradients,' IEEE Trans. Medical Imaging, pp. 45-47, 1986 https://doi.org/10.1109/TMI.1986.4307738
  2. M. Levoy, 'Display of surfaces from volume data,' IEEE Computer Graphics and Applications, vol. 8, no. 3, pp. 29-37, 1988 https://doi.org/10.1109/38.511
  3. C. H. Chien and J. K. Aggarwal, 'Volume/surface octrees for the representation of three-dimensional objects,' Computer Vision, Graphics, and Image Processing, vol. 36, pp. 100-113, 1986 https://doi.org/10.1016/S0734-189X(86)80031-7
  4. G. Herman and H. Liu, 'Three-dimensional display of human organs from computed tomograms,' Computer Graphics and Image Processing, vol. 9, pp. 1-21, 1979 https://doi.org/10.1016/0146-664X(79)90079-0
  5. W. E. Lorensen and H. E. Cline, 'Marching cubes: a high resolution 3-d surface construction algorithm,' Comput. Graph, vol. 21, no. 4, pp. 163-169, 1987 https://doi.org/10.1145/37402.37422
  6. 최영규, 이의택, ,' 정보과학회논문지 27권, 3호, pp. 235-244, 2000년 3월
  7. D. Meyers, S. Skinner, and K. Sloan, 'Surfaces from contours,' ACM Transactions of Graphics, vol. 11, no. 3, pp. 228-258, July 1992 https://doi.org/10.1145/130881.131213
  8. L. G. Nonato, A. J Cuadros-Vargas, R. Minghim, and M. C. Oliveira, 'Beta-Connection: Generating a family of models from planar cross sections,' ACM Trans. on Graphics, Vol.24, No.4, pp. 1239-1258, Oct. 2005 https://doi.org/10.1145/1095878.1095879
  9. A. B. Ekoule, F. Peyrin, and C. L. Odet, 'A triangulation algorithm from arbitrary shaped multiple planar contours,' ACM Transactions of Graphics, vol. 10, no. 2, pp. 182-199, Apr. 1991 https://doi.org/10.1145/108360.108363
  10. H. N. Christiansen and T. W. Sederberg, 'Conversion of complex contour line definition into polygonal element mosaics,' Comput. Graph, vol. 20, pp. 693-702, 1978 https://doi.org/10.1016/S0097-8493(96)00043-X
  11. J. D. Boissonnat, 'Shape reconstruction from planar cross sections,' Computer Vision, Graphics, and Image Processing, vol. 44, pp. 1-29, 1988 https://doi.org/10.1016/S0734-189X(88)80028-8
  12. 최영규, '이중분기 확장을 통한 등치선 삼각화의 다중분기 알고리즘,' 정보과학회논문지 제 27권, 2호, pp. 123-134, 2000년 2월
  13. C. Bajaj, E. Coyle, and K. Lin, 'Arbitrary topology shape reconstruction from planar cross sections,' Graph. Models Image Process. vol. 58, no. 6, pp. 524-543, 1996 https://doi.org/10.1006/gmip.1996.0044
  14. Y.K. Choi, 'Band partitioning algorithm for surface reconstruction from planar contours,' Electronics Letters, Vol. 35, No. 20, pp. 1713-1714, Sep. 1999 https://doi.org/10.1049/el:19991216
  15. H. Fuchs, F. Peyrin, and C. L. Odet, 'A triangulation algorithm from arbitrary shaped multiple planar contours,' Communication of the ACM, vol. 20, no. 10, pp. 693-702, Oct. 1977 https://doi.org/10.1145/359842.359846
  16. E. Keppel. 'Approximating complex surfaces by triangulation of contour lines,' IBM J. Res. Develop., vol. 19 pp. 2-11, 1975 https://doi.org/10.1147/rd.191.0002
  17. Ganapathy and T. G. Dennehy, 'A new general triangulation method for planar contours,' Comput. Graph., vol. 16, no. 3, pp. 69-75, July 1982 https://doi.org/10.1145/965145.801264
  18. P. N. Cook and S. Batnitsky, 'Three dimensional reconstruction from serial sections for medical applications,' 14'th International Conference on System Science, pp. 358-389, 1981
  19. 최영규, 조태훈, '등치선 삼각분할을 위한 띠 분할 알고리즘,' 한국정보처리학회 논문지 제 7권, 3호, pp. 943-952, 2000년 3월
  20. U. Ramer, 'An iterative procedure for the polygonal approximation of plane curves,' Computer Graphics and Image Processing, vol. 1, pp. 244-256, 1972 https://doi.org/10.1016/S0146-664X(72)80017-0
  21. F. P. Preparata and M. I. Shamos, Computational Geometry, An Introduction. Springer-Verlag, 1987
  22. G. Toussaint, 'Efficient triangulation of simple polygons,' The Visual Computer, vol. 7, no. 5-6, pp. 280-295, Sep. 1991 https://doi.org/10.1007/BF01905693
  23. D. T. Lee, 'Medial axis transformation of a planar shape,' IEEE Transactions on Pattern Analysis and Machine Intelligence, vol.4, no.4, pp. 363-369, July 1982 https://doi.org/10.1109/TPAMI.1982.4767267