Korean Journal of Computational Design and Engineering (한국CDE학회논문집)

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

DOI QR Code

Automatic Calculation of Interior Volume of Refrigerator by Hole Filling Algorithm

분해모델과 구멍 메움 알고리즘을 이용한 냉장고 내부 용적의 자동 계산

  • Park, Raesung (School of Mechanical Engineering, Pusan National University) ;
  • Fu, Jianhui (School of Mechanical Engineering, Pusan National University) ;
  • Jung, Yoongho (School of Mechanical Engineering/ERC/NSDM, Pusan National University) ;
  • Park, Mingeun (T&I Group, Samsung Heavy Industries)
  • 박래성 (부산대학교 기계공학부) ;
  • ;
  • 정융호 (부산대학교 기계공학부/정밀정형 및 금형가공 연구소) ;
  • 박민근 (삼성중공업 T&I 그룹)
  • Received : 2016.09.06
  • Accepted : 2016.11.22
  • Published : 2017.03.01
Download PDF
⟨ Previous Next ⟩

Abstract

Internal capacity of a refrigerator is an important indicator for design and purchasing criteria. The components facing the internal space may have holes or gaps between parts. In traditional way, design engineers manually remodeled the parts to fill the holes and the gaps for enclosed boundary of the internal space. Then they calculated internal volume by subtracting the assembly of parts from its enclosing volume. However, filling holes and gaps is not an automated process requiring a plenty of labor and time. In this research, we have developed a voxel-based method to estimate the internal volume of a refrigerator automatically. It starts transforming all components facing the interior space into voxels and fills all holes and gaps automatically by the developed hole-filling algorithm to form a completely closed boundary of the assembly. Then, it identifies the boundary voxels that are facing to the internal voxels with any part of the component. After getting the intersection points between the boundary voxels and the surfaces of components, it generates the boundary surface of triangular facets with the intersection points. Finally, it estimates the internal volume by adding volume of each tetrahedron composed of a triangle of boundary surface and an arbitrary point.

Keywords

References

  1. Kim, J.Y., Lee, K.W. and Jung, Y.H., 1998, Efficient Calculation of Trapped Volumes in Layered Manufacturing Process, Journal of the Korean Society of Precision Engineering, 15(2), pp.154-161.
  2. Jun, Y.T., 2005, A Piecewise Hole Filling Algorithm in Reverse Engineering, Computer-Aided Design, 32(2), pp.263-270.
  3. Zhao, W., Gao, S. and Lin, H., 2007, A Robust Hole-filling Algorithm for Triangular Mesh, The Visual Computer, 23(12), pp.987-997. https://doi.org/10.1007/s00371-007-0167-y
  4. Attene, M., Campen, M. and Kobbelt, L., 2013, Polygon Mesh Repairing: An Application Perspective, ACM Computting Surveys, 45(2), pp.1-33.
  5. Ju, T., 2009, Fixing Geometric Errors on Polygonal Models: A Survey, Journal of Computer Science and Technology, 24(1), pp.19-29. https://doi.org/10.1007/s11390-009-9206-7
  6. Aktouf, Z., Bertrand, G. and Perroton, L., 2002, A Three-dimensional Holes Closing Algorithm, Pattern Recognition Letters, 23(5), pp.523-531. https://doi.org/10.1016/S0167-8655(01)00152-0
  7. Qu, X. and Stucker, B., 2005, Circular Hole Recognition for STL-based Toolpath Generation, Rapid Prototyping Journal, 11(3), pp.132-139. https://doi.org/10.1108/13552540510601255
  8. Kela, A., 1989, Hierarchical Octree Approximation for Boundary Representation-based Geometric Models, Computer-Aided Design, 21(6), pp.355-362. https://doi.org/10.1016/0010-4485(89)90002-X
  9. Jense, G.J., 1989, Voxel-based Methods for CAD, Computer Aided Design, 21(8), pp.528-533. https://doi.org/10.1016/0010-4485(89)90061-4
  10. Dong, Z., Chen, W., Bao, H., Zhang, H. and Peng, Q., 2004, Real-time Voxelization for Complex Polygonal Models in Computer Graphics and Applications, Proceedings of IEEE 12th Pacific Conference, pp.43-50.
  11. Borgefors, G., 1984, Distance Transformations in Arbitrary Dimensions, Computer Vision, Graphics, and Image Processing, 27(3), pp.321-345. https://doi.org/10.1016/0734-189X(84)90035-5
  12. Kong, T.Y. and Rosenfeld, A., 1989, Digital Topology: Introduction and Survey, Computer Vision, Graphics, and Image Processing, 48(3), pp.357-393. https://doi.org/10.1016/0734-189X(89)90147-3
  13. Gibson, S.F., 1999, Constrained Elastic Surface Nets: Generating Smooth Surface from Binary Segmented Data, proceedings of MICCAI 1st International Conference, pp.888-898.
  14. Mark, W.J., 1996, The Production of Volume Data from Triangular Meshes using Voxelisation, Computer Graphics Forum, 15(5), pp.311-318. https://doi.org/10.1111/1467-8659.1550311