Browse > Article

Efficient Calculation of Distance Fields Using Cell Subdivision  

Yoo, Dong-Jin (대진대학교 컴퓨터응용 기계설계공학과)
Publication Information
Journal of the Korean Society for Precision Engineering / v.25, no.3, 2008 , pp. 147-156 More about this Journal
Abstract
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.
Keywords
Distance fields; Triangular net; Boolean operation; Shape deformation; Morphing;
Citations & Related Records
Times Cited By KSCI : 3  (Citation Analysis)
연도 인용수 순위
1 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   과학기술학회마을
2 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   과학기술학회마을
3 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   DOI   ScienceOn
4 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   과학기술학회마을
5 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
6 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   DOI   ScienceOn
7 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
8 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
9 Mauch, S., "Efficient algorithms for solving static hamilton jacobi eguations," Ph. Dr. thesis, Caltech, 2003
10 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   DOI   ScienceOn