1 / 20

GURKHA ARMY (A 3D Indoor Game)

GURKHA ARMY (A 3D Indoor Game). Kiran Timsina (064/BCT/515) Krishna Pd. Panthi (064/BCT/516) Suraj Niroula (064/BCT/546). Introduction. About FPS(First Person Shooter) The screen displays only the arm carried in the hand of first person(i.e. end user). About Game Scenario

eavan
Télécharger la présentation

GURKHA ARMY (A 3D Indoor Game)

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript


  1. GURKHA ARMY(A 3D Indoor Game) KiranTimsina(064/BCT/515) Krishna Pd. Panthi(064/BCT/516) SurajNiroula(064/BCT/546)

  2. Introduction • About FPS(First Person Shooter) The screen displays only the arm carried in the hand of first person(i.e. end user). • About Game Scenario • First Person view • 3D game • Indoor Environment • Mission in each level • Health, Ammo • Clear all the enemies saving your health & ammo • Navigatearound for destination

  3. Objectives • To build game engine • To build 3d engine • To design program in multithreaded structure • To build a 3d modeler that can generate necessary polygons by processing 2D image. • To implement the concept of BSP(Binary Space Partitioning) tree for assisting efficient rendering of scene, collision detection between objects(3d characters, bullet) and walls. • To load 3d characters as players of the game. • To assign game mission for each level.

  4. SYSTEM DESIGN

  5. THREADS

  6. PATH • Information about path is found by processing top view of each floor. • Convention in designing top view • White line represent walls • Red line represent stairs • Blue point indicates the starting point of level • Green point/s indicate the floor( 1 dot for ground, 2 dots for first floor,& so on)

  7. Sample path

  8. PATH (contd..) • Steps in top view image processing • Find 2D edge points • Derive normal vectors • Find 3D coordinates of planes that shall represent wall • Normalise 3D plane coordinates • Scale plane coordinates • Export plane coordinates to text file

  9. PATH(contd..) • Polygons of path are structured in BSP(Binary Space Partitioning) tree • BSP tree • A binary tree that selects a splitting polygon at the root node • All other polygons at the up side or left side of root are placed in left subtree • All other polygons at the bottom side or right side of root are placed in right subtree

  10. PATH(BSP Tree Creation )

  11. PATH(BSP Tree Creation contd..)

  12. CHARACTERS • Frames are edited in 3DsMAX • Individual frames are exported in 3ds file format • Frames for first person • A single frame consisting of hand & rifle for first person to represent idle state • Several frames to represent the animation while firing

  13. CHARACTERS(contd..) • Frames for enemy • Several frames to represent the animation for different states • Stand • Die • Chase • Fire

  14. CULLING • A path can consists of thousands of polygons • Rendering becomes slow if all such polygons are rendered • Some sort algorithm is needed to eliminate unwanted set of polygons

  15. CULLING(contd..) • Culling Algorithm • Get the position of first person • Traverse along the BSP tree to find the current leaf containing the first person • Find other leaf that are potentially visible from the current leafusing PVS(Potentially Visible Set) adjacency matrix • Render only those leaves found in above two steps.

  16. COLLISION DETECTION • Testing for collision with all the polygons of path can be inefficient and in fact not necessary • An algorithm is needed to reduce the number of polygons that needs testing • Algorithm • Get the position of first person • Traverse along the BSP tree to find the current leaf containing the first person • Test for collision with only those polygons that form the current leaf.

  17. STATE MACHINE • Definition- State machine is a system that has finite number of states and predefined procedures for changing the states. • Set of possible states for an enemy • Stand • Chase • Fire • Die

  18. STATE MACHINE(contd…transition diagram) Stand (default) FPS not in sight & out of range Hit by bullet FPS in sight &out of range FPS in sight & in range Hit by bullet Die chasing FPSout of sight Hit by bullet Firing FPSin sight & in range

  19. FUTURE ENHANCEMENT • A 3d modeler that can show complete house for assisting civil engineers to make general people understand how their house would look like • Networking • Multiple levels

  20. Thank you!

More Related