한국정밀공학회지 (Journal of the Korean Society for Precision Engineering)

  • 제25권3호
  • /
  • Pages.147-156
  • /
  • 2008
  • /
  • 1225-9071(pISSN)
  • /
  • 2287-8769(eISSN)
한국정밀공학회 (Korean Society for Precision Engineering)
권호 표지

셀 분할을 이용한 거리장의 효율적 계산

Efficient Calculation of Distance Fields Using Cell Subdivision

  • 유동진 (대진대학교 컴퓨터응용 기계설계공학과)
  • 발행 : 2008.03.01
PDF 다운로드
⟨ 이전 논문 다음 논문 ⟩

초록

A new approach based on cone prism intersection method combined with sorting algorithm is proposed for the fast and robust signed distance field computation. In the method, the space bounding the geometric model composed of triangular net is divided into multiple smaller cells. For the efficient calculation of distance fields, valid points among the triangular net which will generate minimum distances with current cell are selected by checking the intersection between current cell and cone prism generated at each point. The method is simple to implement and able to achieve an order of magnitude improvement in the computation time as compared to earlier approaches. Further the method is robust in handling the traditional sign problems. The validity of the suggested method was demonstrated by providing numerous examples including Boolean operation, shape deformation and morphing of complex geometric models.

키워드

참고문헌

  1. Mauch, S., "Efficient algorithms for solving static hamilton jacobi eguations," Ph. Dr. thesis, Caltech, 2003
  2. Sigg, C., Peikert, R. and Gross, M., "Signed distance transform using graphics hardware," In Proceedings of 14th IEEE Visualization, IEEE Computer Society Press , pp. 83-90, 2003
  3. Barentzen, J. A. and Aanas, H., "Signed distance computation using the angle weighted pseudo-normal," Transactions on Visualization and Computer Graphics, Vol. 11, No. 3, pp. 243-253, 2005 https://doi.org/10.1109/TVCG.2005.49
  4. Gueziec, A., "Meshsweeper : Dynamic point-to-polygonal mesh distance and applications," IEEE Transactions on Visualization and Computer Graphics, Vol. 7, No. 1, pp. 47-60, 2001 https://doi.org/10.1109/2945.910820
  5. Sud, A., Otaduy, M. A. and Manocha, D., "DiFi : Fast 3D distance field computation using graphics hardware," In Proc. of Euro-graphics, Vol. 23, No. 3, pp. 557-566, 2004 https://doi.org/10.1111/j.1467-8659.2004.00787.x
  6. Frisken, S. F., Perry, R. N., Rockwood, A. P. and Jones, T. R., "Adaptively sampled distance fields : a general representation of shape for computer graphics," In Proceedings of the 27th Annual Conference on Computer graphics and Interactive Techniques, pp. 249-254, 2000
  7. Huang, J., Li, Y., Crawfis, R., Lu, S.C. and Liou, S. Y., "A complete distance field representation," In Proceedings of Visualization, pp. 247-254, 2001
  8. Yoo, D. J., "Offsetting of triangular net using distance fields," Journal of the Korean Society for Precision Engineering, Vol. 24, No. 9, pp. 148-157, 2007
  9. Yoo, D. J., "A Study on Filling Holes of Large Polygon Model using Implicit Surface Scheme and Domain Decomposition Method," Journal of the Korean Society for Precision Engineering, Vol. 23, No. 1, pp. 174-184, 2006
  10. Yoo, D. J., "Shape Reconstruction from Unorganized Cloud of Point using Adaptive Domain Decomposition Method," Journal of the Korean Society for Precision Engineering, Vol. 23, No. 8, pp. 89-99, 2006