Home    General Programming    Artificial Intelligence    Math    Physics    Graphics    Networking    Audio Programming    
Audio/Visual Design    Game Design    Production    Business of Games    Game Studies    Conferences    Schools    Contact   
Particle Systems
2D / Billboards
Lighting
Shadows
Texturing
Shaders
Terrain
Camera
Animation / Skinning
Facial Animation
Visibility / Occlusion
Surfaces
Polygonal Math
Collision Detection
Level of Detail
Screenshots
Scene Management
GPU Computation
Direct3D
OpenGL
Effects: Weather
Effects: Lens Flare
Effects: Destruction
Effects: Pyrotechnics
Effects: Adv Materials
Effects: HDR
Effects: Post Process
Effects: Depth of Field
Effects: Refraction
All Articles
Game Programming Gems
Game Programming Gems 2
Game Programming Gems 3
Game Programming Gems 4
Game Programming Gems 5
Game Programming Gems 6
Game Programming Gems 7
AI Game Programming Wisdom
AI Game Programming Wisdom 2
AI Game Programming Wisdom 3
AI Game Programming Wisdom 4
GPU Gems
2004

GPU Gems 2
2005

GPU Gems 3
2007

ShaderX
2002

ShaderX2
2003

ShaderX3
2004

ShaderX4
2006

ShaderX5
2006

ShaderX6
2008

ShaderX7
2009

GPU Pro
2010

GPU Pro 2
2011

GPU Pro 3
2012

Massively Multiplayer Game Development
Massively Multiplayer Game Development 2
Secrets of the Game Business
Introduction to Game Development
GDC Proceedings
Game Developer Magazine
Gamasutra


Graphics Programming: Visibility


Temporal Screen-Space Ambient Occlusion

Oliver Mattausch, Daniel Scherzer and Michael Wimmer
GPU Pro 2

Practical, Dynamic Visibility for Games

Stephen Hill and Daniel Collin
GPU Pro 2

Screen-Space Directional Occlusion

Thorsten Grosch and Tobias Ritschel
GPU Pro"

Hierarchical Item Buffers for Granular Occlusion Culling,

Thomas Engelhardt and Carsten Dachsbacher
GPU Pro"

Game Engine Friendly Occlusion Culling

Jiri Bittner, Oliver Mattausch, Michael Wimmer
ShaderX7

Practical Parallax Occlusion Mapping with Approximate Soft Shadows for Detailed Surface Rendering

Natalya Tatarchuk
ShaderX5

BSP Techniques

Octavian Marius Chincisan
Game Programming Gems 6

Spatial Partitioning Using an Adaptive Binary Tree

Martin Fleisz
Game Programming Gems 6

Enhanced Object Culling with (Almost) Oriented Bounding Boxes

Ben St. John (Siemens)
Game Programming Gems 6

Hardware-Based Ambient Occlusion

Dustin Franklin
ShaderX4

Ambient Occlusion Fields

Janne Kontkanen and Samuli Laine
ShaderX4

Efficient Occlusion Culling

Dean Sekulic (Croteam)
GPU Gems

Terrain Occlusion Culling with Horizons

Glenn Fiedler (Irrational Games)
Game Programming Gems 4

Applications of Explicit Early-Z Culling

Pedro V. Sander, Jason L. Mitchell (ATI Research)
ATI Technology Papers & Presentations (SIGGRAPH 2004).

Illumination-Based Occlusion Culling

Ian Ashdown (byHeart Consultants Limited)
Graphics Programming Methods

Simple and Efficient Line-of-Sight for 3D Landscapes

Tom Vykruta (Surreal Software)
AI Game Programming Wisdom

Fast and Simple Occlusion Culling

Wagner Corrêa (Princeton University), James Klosowski (IBM Research), Cláudio Silva (AT&T Labs-Research)
Game Programming Gems 3
Abstract: This article describes two occlusion culling algorithms that are practical, effective, and require little preprocessing. The first one is the prioritized-layered projection (PLP) algorithm, which is an approximate algorithm that determines, for a given budget, a set of primitives that is likely to be visible. The second algorithm, cPLP, is a conservative version of PLP that guarantees finding all visible primitives.

A High-Performance Tile-based Line-of-Sight and Search System

Matt Pritchard (Ensemble Studios)
Game Programming Gems 2

Sphere Trees for Fast Visibility Culling, Ray Tracing, and Range Searching

John W. Ratcliff (Sony Online Entertainment)
Game Programming Gems 2
Abstract: The article presents an algorithm and demonstration application that manages thousands of objects in motion that are continuously maintained as a collection of hierarchical bounding spheres in a SphereTree. The design goal for this algorithm has been to make the 99-percentile case spend almost no CPU time updating an object in motion within the tree structure. Queries against the SphereTree perform more tests than other data structures, but this is mitigated by the fact that the tree can be maintained using very little CPU time. This data structure is ideally suited for gross culling of massive numbers of moving objects in a large world space. It doesn't matter if the objects are moving at widely disparate speeds, or even if many of them are not in motion at all. It also has a very low cost when objects are inserted and removed from the tree with great frequency.

Object Occlusion Culling

Tim Round
Game Programming Gems
Abstract: This article introduces both frustum culling and occlusion culling, along with example code for a simple occlusion culling algorithm.

13% off discount
"Latest from a must have series"
Game
Programming
Gems 7



"Cutting-edge graphics techniques"
GPU Pro 3


"Newest AI techniques from commercial games"
AI Game
Programming
Wisdom 4






Home