Data Structures and Algorithms for Game Developers

Author:   Allen Sherrod
Publisher:   Cengage Learning, Inc
ISBN:  

9781584504955


Pages:   576
Publication Date:   04 May 2007
Format:   Mixed media product
Availability:   Awaiting stock   Availability explained


Our Price $145.17 Quantity:  
Add to Cart

Share |

Data Structures and Algorithms for Game Developers


Add your own review!

Overview

Data structures and algorithms are used in every application written, and with the complexity of 3D virtual worlds and game environments growing every year, the need to manage this data efficiently is critical for programmers of all levels. For game development, the way data is managed, stored, and manipulated is critical to a games performance effectiveness and efficiency. So to be successful as a game programmer, you have to know how to create data structures and write algorithms for maximum performance. Data Structures and Algorithms for Game Developers teaches the fundamentals of the data structures and algorithms used in game development. This book provides programmers with a detailed reference to what data structures and algorithms are, and why they are so critical in game development. It teaches new game programmers, students, and aspiring game developers how to create data structures and write algorithms using C++. All key features of C++ are also covered, especially those related to game development. The book also presents practical alternative options in C++ where applicable, such as using C++s STL in professional applications instead of implementing custom routines. Additionally, a demo application is included in each chapter focusing on the data structure and/or algorithms presented in that chapter. The book covers many modern topics that game and graphics programmers must know to be successful, including geometry management techniques, and data structures and algorithms such as KD-Trees, Binary Space Partitioning Trees, Sphere Trees, etc The code written in this book is not dependent on any specific hardware or operating system so it will be useful across different systems, and every chapter ends with questions, exercises, and challenges for the reader to complete in order to help them better understand and apply what they learn.

Full Product Details

Author:   Allen Sherrod
Publisher:   Cengage Learning, Inc
Imprint:   Charles River Media
Dimensions:   Width: 18.50cm , Height: 3.80cm , Length: 23.10cm
Weight:   1.135kg
ISBN:  

9781584504955


ISBN 10:   1584504951
Pages:   576
Publication Date:   04 May 2007
Audience:   General/trade ,  Adult education ,  General ,  Further / Higher Education
Format:   Mixed media product
Publisher's Status:   Out of Print
Availability:   Awaiting stock   Availability explained

Table of Contents

Introduction. 1. Overview. 2. Arrays. 3. Recursion. 4. Simple Sorting. 5. Link Lists. 6. Stacks and Queues. 7. Hash Tables. 8. Advanced Sorting. 9. Binary Trees. 10. Red-Black Trees. 11. Minimax Trees. 12. Quad Trees. 13. Octrees. 14. Binary Space. 15. K-D Trees. 16. Sphere Trees. 17. Heaps. 18. Graphs. 19. Data Compression and Encryption. Appendix A Resources. Appendix B Answers to Questions. Appendix C Compiling Sample Code. Appendix D OpenGL and GLUT. Appendix E About the CD. Index.

Reviews

Author Information

Tab Content 6

Author Website:  

Customer Reviews

Recent Reviews

No review item found!

Add your own review!

Countries Available

All regions
Latest Reading Guide

MRG2025CC

 

Shopping Cart
Your cart is empty
Shopping cart
Mailing List