International Journal of CAD/CAM

Society for Computational Design and Engineering (한국CDE학회)
권호 표지

Construction of Branching Surface from 2-D Contours

  • Jha, Kailash (Faculty-in-Charge, CAD/CAM Center Dept. of Mechanical Engineering & Mining Machinery Engineering Indian School of Mines University)
  • Published : 2009.12.31
Download PDF
⟨ Previous Next ⟩

Abstract

In the present work, an attempt has been made to construct branching surface from 2-D contours, which are given at different layers and may have branches. If a layer having more than one contour and corresponds to contour at adjacent layers, then it is termed as branching problem and approximated by adding additional points in between the layers. Firstly, the branching problem is converted to single contour case in which there is no branching at any layer and the final branching surface is obtained by skinning. Contours are constructed from the given input points at different layers by energy-based B-Spline approximation. 3-D curves are constructed after adding additional points into the contour points for all the layers having branching problem by using energy-based B-Spline formulation. Final 3-D surface is obtained by skinning 3-D curves and 2-D contours. There are three types of branching problems: (a) One-to-one, (b) One-to-many and (c) Many-to-many. Oneto-one problem has been done by plethora of researchers based on minimizations of twist and curvature and different tiling techniques. One-to-many problem is the one in which at least one plane must have more than one contour and have correspondence with the contour at adjacent layers. Many-to-many problem is stated as m contours at i-th layer and n contours at (i+1)th layer. This problem can be solved by combining one-to-many branching methodology. Branching problem is very important in CAD, medical imaging and geographical information system(GIS).

Keywords

References

  1. Christiansen, H N and Sederberg, T. W., (1978), Conversion of complex contour line definitions into polygonal element mosaics, Computer Graphics (SIGGRAPH'78 Proceedings), 12, 187-192 https://doi.org/10.1145/965139.807388
  2. D Meyers, S. Skinner and K. Sloan. (1992), Surfaces from contours. ACM Trans. On Graphics, 11, 228-259 https://doi.org/10.1145/130881.131213
  3. Y. Shinagawa and T. L. Kunii. (1991), The homotopy model: A generalized model for smooth surface generation from cross sectional data. Visual Computer. 7, 72-86 https://doi.org/10.1007/BF01901178
  4. A. B. Ekole, F. C. Pyrin and C. L. Odet. A. (1991) triangulation algorithm from arbitrary shaped multiple planner contours. ACM trans. on Graphics, 10, 182-199 https://doi.org/10.1145/108360.108363
  5. J. Jeong, K. Kim, H. Park, H. Cho, and M. Jung. (1999), B-Spline surface approximation to cross section using distance maps. Adv. Manuf. Techn, 15, 876-885 https://doi.org/10.1007/s001700050145
  6. C. L. Bajaj, E. J. Coyle, and K. N. Lin. (1996), Arbitrary topology shape reconstruction from planner cross sections. Graphical Models & Image Proc., 58, 524-543 https://doi.org/10.1006/gmip.1996.0044
  7. G. Barequet, D. Shapiro, and A. Tal. (2000), Multilevel sensitive reconstruction of polyhedral surfaces from parallel slices. Visual Computer, 16, 116-133 https://doi.org/10.1007/s003710050201
  8. G. Barequet and M. Sharir. (1996), Piecewise-linear interpolation between polygonal slices. Comp. Vision & Image Underst. 63, 251-272 https://doi.org/10.1006/cviu.1996.0018
  9. T. N. T. Goodman, B. H. Ong, and K. Unsworth. (1993), Reconstruction of $C^{1}$ closed surfaces with branching. In G. Farin, H. Hagen, and H. Noltemeier, editors, Geometric Modelling, pages 101-115. Springer, Vienna
  10. S. Bedi. (1992), Surface design using functional blending. CAD, 24, 505-511 https://doi.org/10.1016/0010-4485(92)90030-E
  11. M. S. Floater and G. Westguard. (1996), Smooth surface reconstruction from cross-sections using implict surfaces. Report STF42, Sintef
  12. Park, H., Kim, K., Lee, Sang-Chan. (2000) A method for approximate NURBS curve compatibility based on multiple curve refitting, Computer Aided Design. 32(20), 237-252 https://doi.org/10.1016/S0010-4485(99)00088-3
  13. Jha, Kailash. (2004) Minimum Energy Based Interpolation for Interactive Incremental Well-Path Design, Engineering Computations, 21(7), PP 67-69 https://doi.org/10.1108/02644400410548332
  14. Jha, Kailash. (2005), Energy based multiple refitting for skinning, International Journal of CAD/CAM, 5(1), 11-18
  15. Fang, L., Gossard, D. C. (1995), Multidimensional Curve Fitting to Unorganized Data Points by Non-linear Minimization, Computer Aided Design. 27(1), 45-58 https://doi.org/10.1016/0010-4485(95)90752-2
  16. Park, H., Kim, K. (1996), Smooth Surface Approximation to Serial Cross-Section, Computer Aided Design, 28(12), 995-1005 https://doi.org/10.1016/0010-4485(96)00019-X
  17. Gabrielides, N. C., Ginnis, A. I., Kaklis, P. D. (2006), Constructing Smooth Branching Surfaces from Cross Sections, ACM Symposium on Solid and Physical Modeling, Cardiff, Wales, UK, June 06-08, Pages 161-70 https://doi.org/10.1145/1128888.1128910