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

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

A Constrained Triangulation Technique for Visualization on Mobile Devices

모바일 장치에서의 가시화를 위한 경계기반 삼각화

  • 양상욱 (중앙대학교 기계공학부) ;
  • 최영 (중앙대학교 기계공학부)
  • Published : 2007.12.31
Download PDF
⟨ Previous Next ⟩

Abstract

3D rendering is becoming a common feature of mobile application programs with the rapid advance of mobile devices. Since the existing rendering engines do not provide triangulation functions, mobile 3D programs have focused on an efficient handling with pre-tessellated geometry. In addition, triangulation is comparatively expensive in computation, so it seems that the triangulation cannot be easily implemented on mobile devices with limited resources. Triangulation of 3D geometry is the essential process of visualization of 3D model data and many different triangulation methods have been reported. We developed a light and fast visualization process that involves constrained triangulation based on Voronoi diagram and applied it to a mobile computer application. In this paper, we applied kd-tree to the original incremental construction algorithm and produced new O(nlogn) incremental construction algorithm. And we show a simple and efficient constrained triangulation method based on Voronoi diagram. This paper also describes an implementation of mobile STEP data viewer as an application of our proposed algorithms.

Keywords

References

  1. Woodward, C., Valli, S., Honkamaa, P. and Hakkarainen, M., 'Wireless 3D CAD Viewing on a PDA Device', Proceedings of the 2nd Asian International Mobile Computing Conference, 14-17 May, 2002, Longkawi, Malaysia
  2. Su, X., Prabhu, B. S., Chu, C. C. and Gadh, R., 'Middleware for Multimedia Mobile Collaborative System', Proceedings of $3^{rd}$ Annual Wireless Telecommunications Symposium, May 14-15, 2004, CalPoly Pomona, Pomona, California, USA
  3. Khronos Group, 'OpenGL ES Overview', http://www.khronos.org/opengles/
  4. Direct3D Mobile for Windows Mobile-based Devices, http://msdn.microsoft.com/library/default.asp?url=/library/en-us/mobilesdk5/html/mob5oriDirect3DMobile. asp
  5. Mesh Generation: Software, http://www-users.infor-matik. rwth-aachen.de/~roberts/software.html
  6. Zienkiewicz, O. C. and Phillips, D. V., 'An Automatic Mesh Generation Scheme for Plane and Curved Surfaces by Isoparametric Coordinates', International Journal for Numerical Methods in Engineering, Vol. 3, pp. 519-528, 1971 https://doi.org/10.1002/nme.1620030407
  7. Ghassemi, F., 'Automatic Mesh Generation Scheme for a Two or Three Dimensional Triangular Curved Surface', Computers Struct, Vol. 15, pp. 613-626, 1982 https://doi.org/10.1016/S0045-7949(82)80002-3
  8. Anastasiou, K. and Chan, C. T., 'Automatic Triangular Mesh Generation Scheme for Curved Surfaces', Communications in Numerical Methods in Engineering, John Wiley & Sons, Ltd., Vol. 12, pp. 197-208, 1996 https://doi.org/10.1002/(SICI)1099-0887(199603)12:3<197::AID-CNM972>3.0.CO;2-Q
  9. Zunino, C., Lamberti, F. and Sanna, A., 'A 3D Multiresolution Rendering Engine for PDA Devices', SCI 2003 Proceedings, Vol. 5, pp. 538-542
  10. Cavendish, J. C., Field, D. A. and Frey, W. H., 'An Approach to Automatic Three Dimensional Finite Element Mesh Generation', International Journal for Numerical Methods in Engineering, John Wiley and Sons, Ltd., No. 21, pp. 329-347, 1985
  11. Lo, S. H., 'Mesh Generation Over Curved Surfaces', Asian-Pacific Conference on Computational Mechanics, pp. 2345-50, Seoul, Korea 1996
  12. Fortune, S., 'A Sweeping Algorithm for Voronoi Diagrams', Algorithmica 2, Springer-Verlag Inc., pp. 153-174, 1987 https://doi.org/10.1007/BF01840357
  13. Green, P. and Sibson, R, 'Computing Dirichlet Tessellation in the Plane', The Computer Journal, Vol. 21, pp. 168-173, 1977
  14. Field, D. A., 'Implementing Watson's Algorithm in Three Dimensions', Proceedings of the 2nd Annu. ACM Symposium of Computer Geometry, pp. 246-259, 1986
  15. O'Rourke, J., Computational Geometry in C 2nd Ed., Cambridge University Press, pp. 162-163, 1998
  16. Kd-tree: Wikipedia, http://en.wikipedia.org/wiki/Kd-tree
  17. Bentley, J. L., 'Multidimensional Binary Search Trees Used for Associative Searching', Communications of ACM Vol. 18, No. 9, pp. 509-517, 1975 https://doi.org/10.1145/361002.361007
  18. Musser, D. R., Derge, G. J. and Saini, A., STL Tutorial and Reference Guide, 2nd Edition, Addson Wesley, 2001
  19. Hybrid Graphics Hompage, http://www.hybrid.fi/
  20. Sugihara, K., Iri, M., Inagaki, H. and Imai, T., 'Topology-oriented Implementation-An Approach to Robust Geometric Algorithms', Algorithmica, Vol. 27, No. 1, pp. 5-20, May, 2000 https://doi.org/10.1007/s004530010002
  21. Ohya, T., Iri, M. and Murota, K., 'A Fast Voronoi-diagram Algorithm with Quaternary Tree Bucketing', Information Processing Letters, Vol. 8, Issue 5, pp. 227-231, May, 1984