Table of Contents Author Guidelines Submit a Manuscript
International Journal of Computer Games Technology
Volume 2008 (2008), Article ID 316790, 5 pages
http://dx.doi.org/10.1155/2008/316790
Research Article

Efficient Terrain Triangulation and Modification Algorithms for Game Applications

School of Computer Engineering, Nanyang Technological University, Singapore 639798

Received 28 September 2007; Accepted 3 March 2008

Academic Editor: Kok Wai Wong

Copyright © 2008 Sundar Raman and Zheng Jianmin. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

Linked References

  1. Tread Marks, Longbow Digital Arts Incorporated, 1999, http://www.ldagames.com/treadmarks/.
  2. Colin McRae Rally 04, The Codemasters Software Company Limited, 2004, http://www.codemasters.com/games/?gameid=1361.
  3. M. J. Garland and P. S. Heckbert, “Fast polygonal approximation of terrains and height fields,” Tech. Rep. CMU-CS-95-181, School of Computer Science, Carnegie Mellon University, Pittsburgh, Pa, USA, 1995. View at Google Scholar
  4. S. Raman and J. Zheng, “Efficient terrain triangulation and merging of world objects for game applications,” in Proceedings of the 3rd International Conference on Games Research and Development (CyberGames '07), p. 46, Manchester, UK, September 2007.
  5. J. Steiner, “Questions proposées. Théorèmes sur l'hexagramum mysticum,” Annals of Mathematics, vol. 18, 339 pages, 1827. View at Google Scholar
  6. D. T. Lee and B. J. Schachter, “Two algorithms for constructing a Delaunay triangulation,” International Journal of Parallel Programming, vol. 9, no. 3, 219 pages, 1980. View at Publisher · View at Google Scholar
  7. S. Fortune, “A sweepline algorithm for Voronoi diagrams,” Algorithmica, vol. 2, no. 1, 153 pages, 1987. View at Publisher · View at Google Scholar
  8. C. L. Lawson, “Software for C1 Surface Interpolation,” in Mathematical Software III, p. 161, Academic Press, New York, NY, USA, 1977. View at Google Scholar
  9. L. Guibas and J. Stolfi, “Primitives for the manipulation of general subdivisions and the computation of Voronoi diagrams,” ACM Transactions on Graphics, vol. 4, no. 2, 74 pages, 1985. View at Publisher · View at Google Scholar
  10. P. Su and R. L. Scot Drysdale, “A comparison of sequential Delaunay triangulation algorithms,” in Proceedings of the 11th Annual ACM Symposium on Computational Geometry (SCG '95), p. 61, Vancouver, BC, Canada, June 1995. View at Publisher · View at Google Scholar
  11. J. R. Shewchuk, “Triangle: engineering a 2D quality mesh generator and Delaunay triangulator,” in Proceedings of the 1st ACM Workshop on Applied Computational Geometry (WACG '96), p. 124, Philadelphia, Pa, USA, May 1996.
  12. R. A. Dwyer, “A faster divide-and-conquer algorithm for constructing delaunay triangulations,” Algorithmica, vol. 2, no. 1, 137 pages, 1987. View at Publisher · View at Google Scholar
  13. H. Elgindy, H. Everett, and G. Toussaint, “Slicing an ear using prune-and-search,” Pattern Recognition, vol. 14, no. 9, 719 pages, 1993. View at Publisher · View at Google Scholar
  14. L. P. Chew, “Guaranteed-quality mesh generation for curved surfaces,” in Proceedings of the 9th Annual Symposium on Computational Geometry (SCG '93), p. 274, San Diego, Calif, USA, May 1993. View at Publisher · View at Google Scholar
  15. J. Ruppert, “A Delaunay refinement algorithm for quality 2-dimensional mesh generation,” Journal of Algorithms, vol. 18, no. 3, 548 pages, 1995. View at Publisher · View at Google Scholar