Tải bản đầy đủ

Design and architecture of a portable and extensible multiplayer 3d game engine thesis


Introduction ........................................................................................................... 1


3D Computer game engines and graphics research
What this thesis is about
How this thesis is structured
Overview of implementation


PART I: Foundations and Related Work


Algorithms ............................................................................................................. 5


Hierarchical subdivision
Occlusion culling


High-performance Low-level Graphics APIs .................................................... 10


Geometry processing


Game Technology Evolution ............................................................................... 13


Seminal 3D computer games
Consumer 3D hardware





PART II: Design and Architecture of Parsec

Overview ............................................................................................................... 26


The engine
The game
The vision
How to build a game
How to build an engine
Chapters outline


Architecture Overview ........................................................................................ 33


The game code
The engine code
Engine core
Low-level subsystems


Architecture Details ............................................................................................. 41


Code structure and conventions
Dynamic vs. static subsystem binding
Abstract rendering and shaders
The game loop





Low-level Subsystem Specifications ................................................................... 50


Host system encapsulation
Graphics API encapsulation


Managing Objects ................................................................................................ 58


Object types and classes
The world
Generic graphical object
Object API


The ITER Interface ............................................................................................. 70


Specifying how primitives should be rendered
ITER rendering primitives
ITER rendering functions


Shaders .................................................................................................................. 90


Components of a shader
Shader definition
Shader implementation
Color animations
Texture animations
Attaching a shader
The art of writing a shader


The Particle System ........................................................................................... 100


Basic definition of a particle
Particle clusters
Particle appearance animation
Particle behavior animation
How the particle system uses particle clusters
Derived particle cluster types
Particle system API


Networking ......................................................................................................... 121


Game-code interface
Parsec protocol layer
Packet API layer


The Command Console ..................................................................................... 127


User command registration
Console API








PART III: Conclusion

Concluding Remarks ......................................................................................... 136


Bibliography ....................................................................................................... 138

Design and Architecture
of a Portable and Extensible
Multiplayer 3D Game Engine
Markus Hadwiger

Institute of Computer Graphics
Vienna University of Technology

I would like to dedicate this thesis and corresponding work to my parents,
Dr. Alois and Ingrid Hadwiger,
without whom nothing of this would have been possible.

This thesis is about the design and architecture of a 3D game engine – the technology behind
a computer game featuring three-dimensional graphics.
Over the last couple of years, the development of 3D computer games and graphics research
have come ever closer to each other and already merged in many respects. Game developers
are increasingly utilizing the scientific output of the research community, and graphics
researchers have discovered computer games to have become an important application area of
their scientific work.
As the technology employed by computer games becomes more and more involved, the
design and architecture of the underlying engines attains a crucial role. Increasingly,
extremely modular designs encapsulating system-dependencies are chosen in order to allow
for portability from one target platform to another. Extensibility has also become important,
since many game engines are used for more than one game. It also helps foster a community
of game players that develops extensions for their favorite game and keeps the game alive for
a much longer period of time.
The topic of this thesis is a particular game engine – the Parsec Engine –, focusing on
architectural and design aspects. This engine emphasizes and allows for portability by
employing a very modular architecture. It is also a multiplayer game engine, i.e., it contains a
powerful networking component through which multiple players can play together.
Extensibility is achieved in many respects, although the Parsec Engine is not a completely
general game engine aiming to be a framework for every kind of game imaginable, but rather
attempts to achieve high performance for a specific type of game. Since it has been developed
in close conjunction with an actual computer game – Parsec, a multiplayer 3D space combat
game – it favors outer space settings with spacecraft.
While the focus is on architecture and design, another goal has been to describe crucial
aspects at a level of detail that allows for using the engine to develop new game play features
and special effects, as well as extending the engine itself.

Diese Diplomarbeit handelt von Design und Architektur einer 3D Computerspiele-Engine –
jener Technologie, die hinter einem Computerspiel steht, das dreidimensionale Graphik
In den letzten Jahren haben sich die Entwicklung von 3D Computerspielen und die
Computergraphik-Forschung immer mehr angenähert und sind in vielerlei Hinsicht bereits
verschmolzen. Spieleentwickler nutzen in zunehmendem Ausmaß die wissenschaftlichen
Resultate der Forschergemeinschaft, und auch die Forscher in der Computergraphik haben
entdeckt, daß Computerspiele mittlerweile ein wichtiges Anwendungsgebiet ihrer Arbeit
geworden sind.
Da die Technologie die in Computerspielen eingesetzt wird immer komplexer wird, kommt
dem Design und der Architektur der zugrundeliegenden Engines eine immer bedeutendere
Rolle zu. Zusehends werden extrem modulare Designs gewählt, die Abhängigkeiten vom
eigentlichen Computersystem kapseln und so Portierbarkeit von einer Zielplattform zu einer
anderen ermöglichen. Erweiterbarkeit ist ebenso wichtig geworden, da viele Spiele-Engines
für mehr als nur ein Spiel eingesetzt werden. Diese Eigenschaft hilft ebenso beim Aufbau von
Spielergemeinschaften, in denen Spieler Erweiterungen für ihr Lieblingsspiel entwickeln und
es so für einen wesentlich längeren Zeitraum am Leben erhalten.
Das Thema dieser Diplomarbeit ist eine ganz bestimmte Spiele-Engine, die „Parsec Engine“,
wobei sie sich auf Architektur und Design konzentriert. Diese Engine betont und erlaubt
Portabilität, indem sie eine sehr modulare Architektur einsetzt. Weiters handelt es sich um
eine Mehrspieler-Engine, d.h. sie enthält eine leistungsfähige Netzwerkkomponente, durch die
mehrere Spieler miteinander spielen können.
Erweiterbarkeit wurde in vielerlei Hinsicht erreicht, obwohl die Parsec Engine keine komplett
allgemeine Engine mit dem Ziel, für alle möglichen Arten von Spielen verwendbar zu sein,
ist, sondern versucht, hohe Leistung bei einem bestimmten Spieltyp zu erzielen. Da sie eng
zusammen mit einem vollständigen Computerspiel entwickelt wurde – Parsec, ein
Mehrspieler-3D-Weltraumkampf-Spiel – bevorzugt sie Weltraum-Szenen mit Raumschiffen.
Obwohl das Hauptaugenmerk auf Architektur und Design liegt, war es ebenso ein Ziel die
wesentlichsten Aspekte in einem Detailgrad zu beschreiben, der es erlaubt, die Engine zur
Entwicklung neuer Spielfeatures und Spezialeffekte zu verwenden und auch die Engine selbst
zu erweitern.

I would like to express a very special thank you to my “coach” Dieter Schmalstieg for
supervising this thesis, supporting my vision and approach to it, many helpful comments and
remarks, and putting up with me as a student in general. And – I will not forget my promise of
an extended session of playing Parsec.

Since Parsec has become a real team effort over the years, I would like to express my thanks
and admiration to all the talented members of the Parsec team for their great work and
Andreas Varga, Clemens Beer, and Michael Wögerbauer, who are all great programmers and
have contributed a lot to the spirit of the Parsec project.
Alex Mastny, who has truly astounded me with his ability to create ever more impressive
artwork and designs.
Stefan Poiss, whose musical abilities are still a miracle to me after all those years, and the
resulting music always managed to cheer me up and motivate me.
Karin Baier, for giving voice to an entire universe.

Thanks to Thomas Bauer for support in numerous and invaluable ways, and Uli Haböck for
many insightful discussions on mathematics late at night.
Thanks to Thomas Theußl for tolerating the presence of gametech-talking nerds invading his
office, occupying his machine, and for always being there to share a cup of hot chocolate.
Thanks to Karin Kosina for a fine sense of humor, her spirit, and her outstanding tastes in
music – Kaos Keraunos Kybernetos!
Thanks to Helwig Hauser for prodding me to give numerous talks, CESCG, and the Computer
Graphics Group – la tante est morte, vive la tante !
Thanks to Gerd Hesina for a lot of help on numerous occasions.
Thanks to Anna Vilanova i Bartrolí and Zsolt Szalavári for being a lot of fun.

Last, but not least, I would like to thank all the Parsec fans out there, who are eagerly awaiting
the final release... we are working on it!

1 Introduction
1.1 3D Computer game engines and graphics research
About ten years ago computer graphics research and computer games development were two totally separate
areas with not much common ground. Computer games have always been almost exclusively targeted at the
consumer market, and the graphics capabilities of consumer hardware at that time were practically non-existent
from the point of view of computer graphics researchers. Thus, researchers were using expensive high-end
graphics workstations, and game developers were targeting entirely different platforms. This had the implication
that algorithms and techniques developed and used by the computer graphics research community could not
really be employed by game developers. Graphics researchers, on the other hand, also did not view computer
games as an application area of their scientific work.
However, the last decade, and the last couple of years in particular, have seen low-cost consumer graphics
hardware reach – and in many areas even surpass – the capabilities of extremely expensive high-end graphics
hardware from just a short time ago. This has led to computer game developers increasingly utilizing the
scientific output of the research community, with an ever diminishing delay between introduction of a new
technique and its actual use in a consumer product. Computer games research and development has thus become
a very important application area for graphics researchers.
The game engines driving today’s 3D computer games are indeed an incredibly interesting venue where
computer graphics research and engineering meet. However, although the graphics component of current game
engines is probably the most visible one, a game engine is not only graphics. One could say that the term game
engine subsumes all the technology behind a game, the framework which allows an actual game to be created,
but viewed separately from the game’s content. This also includes networking, AI, scripting languages, sound,
and other technologies.

Figure 1.1: Two highly successful game engines. Left: Quake. Right: Unreal

In addition to driving highly successful games in their own right, the most prominent game engines of the last
several years, like the Quake [Quake] and Unreal [Unreal] engines, have been remarkable licensing successes.
Although both were originally created for a particular game, these engines are ideal to be used for the creation of
other games with entirely new content like game play, graphics, sound, and so forth. In fact, the effort necessary
to create a top-notch game engine has become so tremendous, that it is also very sensible from a business point
of view to make one’s engine available for licensing to other companies, allowing them to focus more on actual
content creation than on the technology itself. This is even more important for companies that are simply not
able to develop an entire engine and a game from scratch at the same time, than for the company allowing
licensing of its engine.
In contrast to game engines that have been developed for a specific game or series of games, a small number of
companies focus on developing only an engine, without also creating a game at the same time. An example for
this approach of creating flexible game engine technology exclusively for licensing, is Numerical Design Ltd.’s
NetImmerse [NetImm]. Due to its flexibility such an engine could be called a generic game engine, whereas the
Quake engine, for instance, is definitely more bound to an actual type of game, or at least a specific gaming


genre. On the other hand, this flexibility is also one of the major problems inherent in generic engines. Since
they are not tightly focused on a rather narrowly defined type of game, they are not easily able to achieve the
levels of performance of engines specifically tailored to a certain genre. Another problem of generic engines is
that most game development houses prefer licensing an engine with already proven technology, i.e., a highly
successful game that has sold at least on the order of one million units.

1.2 What this thesis is about
This thesis contains a lot of material pertaining to the architecture of computer game engines in general, but most
of all it is about the design and architecture of a specific engine. This engine – the Parsec engine – is a highly
portable and extensible multiplayer game engine. The design of this engine was guided by certain key design
criteria like modularity, flexibility, extensibility, and – most of all – portability.
As opposed to generic game engines, the Parsec engine belongs to the class of game or genre-bound engines.
This is also to say that it has been developed in parallel with an actual computer game, not coincidentally called
Parsec – there is no safe distance [Parsec].

Figure 1.2: Parsec – there is no safe distance
Parsec is a multiplayer 3D space combat game, specifically targeted at Internet game play. Basically, players can
join game play sessions in solar systems, and also jump from solar system to solar system using so-called
stargates, interconnecting them. The emphasis is on fast-paced action, spectacular graphics, and background
sound and music supporting the mood of the vast outer space setting. Chapter 5 contains a detailed overview of
the game and its underlying concepts.
The Parsec engine offers high performance graphics utilizing an abstract rendering API, and a modular
subsystem architecture encapsulating system-dependencies in order to achieve high portability. The networking
subsystem is also independent from the underlying host system and transport protocol used. The current
implementation supports Win32, Linux, and the MacOS as host systems, OpenGL and Glide as graphics APIs,
and TCP/IP and IPX as networking protocols. Since one of the major goals in the development of the Parsec
engine was to achieve high portability, porting to additional host systems, graphics APIs, and networking
protocols is a rather straightforward process.
In the description of the Parsec engine we will emphasize architectural and design aspects. Nevertheless, we
have also tried to provide sufficient detail in order to support developers interested in using, extending, and
adding to Parsec, the game, as well as the Parsec engine itself.



1.3 How this thesis is structured
This thesis consists of three major parts.
Part One – Foundations and Related Work – covers fundamental issues like some very important graphics
algorithms used in many game engines. It also contains a short review and introduction to the most important
low-level graphics APIs used in 3D computer games, like OpenGL and Glide. The related work aspect is most
prevalent in an overview of the evolution of 3D computer games and consumer 3D hardware over the last
decade. In this part we will cover a lot of background material about computer games and the algorithms and
techniques they use or have used in the past.
Part Two – Design and Architecture of Parsec – covers the main topic of this thesis, the design and architecture
of the Parsec engine. Although the focus is on architectural and design aspects, many implementation issues are
covered in detail. The key design goal of portability is central to the entire architecture of the engine. We will
first review the game Parsec, then give an overview of its architecture and continue with more details about the
architecture and its implementation. After these more general parts we will be devoting a single chapter to each
of the major engine components.
Part Three – Conclusion – concludes with a comprehensive bibliography and offers some concluding remarks.

1.4 Overview of implementation
The implementation of the work described in this thesis is Parsec, the Parsec engine, and the Parsec SDK
(Software Development Kit).
Parsec is the space combat computer game employing the accordingly named engine in order to present an
interactive gaming experience to the player.
The Parsec SDK is a subset of the Parsec engine and game code, which will be made available on the Internet in
source code form, in order to allow development of user modifications and additions, like new weapons and
special effects, modes of game play, or even total conversions, i.e., an almost entirely different game.
This thesis is also intended for providing background and reference information to developers intending to work
with the Parsec SDK.
The implementation of all of these components currently consists of about 180,000 lines of code, written in a Clike subset of C++, contained in about 900 source files, which amount to about 7MB of code. Supported host
systems are Win32, MacOS, and Linux. Both OpenGL and Glide (3dfx) are supported as target graphics APIs on
all of these host systems. The available implementations of the networking component support the TCP/IP suite
of protocols and Novell’s IPX.
The code is very modular, especially with respect to portability between different host systems and graphics
APIs. It transparently supports both little-endian (e.g., Intel x86) and big-endian (e.g., PowerPC) systems, and
encapsulates many other details differing between target platforms.
It is contained in a hierarchically structured source tree, whose layout corresponds to the subsystem architecture,
and host system and graphics API targets, as will be described in the main part of the thesis (Part Two). Since the
system-dependent parts are cleanly separated and isolated, it is easily possible to extract only those source files
needed for a specific target platform and/or graphics API.
A more detailed overview of the implementation is contained in chapter 5, as well as the following chapters on
architecture, and the chapters devoted to specific subsystems.



Foundations and Related Work

2 Algorithms
This chapter covers some fundamental algorithms that can be found in almost every 3D game engine, most of all
focusing on occlusion culling algorithms and hierarchical subdivision.
Although the visibility determination problem at the lowest level is nowadays easily solved with hardware zbuffering in most systems, even the fastest hardware available cannot handle entire scenes consisting of, for
example, a million polygons at interactive rates. So, the naive approach of simply throwing all polygons in a
scene at the hardware just won’t work. It is not sufficient to employ visibility algorithms that need to check
every single primitive in the scene to resolve visibility. Overall scene complexity ought to have no significant
impact on the processing time for a single generated image. Rather, this processing time should depend solely on
the complexity of the part of the scene being actually visible. Algorithms with this property are called occlusion
culling algorithms or output sensitive visibility algorithms [Sud96].
In this overview, the distinction between objects and polygons in a scene is somewhat put aside, as we often
assume objects to consist of polygons and consider objects at either the object level or the polygon level, as
appropriate. Despite the emphasis on polygonal scenes, since they are simply the most important ones in
interactive systems, some of the concepts and algorithms we discuss are also applicable to other object
representations − e.g., implicit surfaces, constructive solid geometry (CSG), or objects modeled as collection of
spline surface patches − if only objects’ bounding volumes are considered.
Nevertheless, the most advanced and also most recent work mostly considers purely polygonal scenes. Of
course, all algorithms are trivially applicable if a non-polygonal scene is converted to an explicit polygonal
representation in a preprocessing step. Hence, we do not explicitly consider non-polygonal scene or object
representations in our discussion.
There are two large steps which need to be taken in order to prune a given scene to a manageable level of
The first step is to cull everything not intersecting the viewing frustum at all. Since that part of the scene cannot
contribute to the generated image in any way it should be eliminated from processing by the graphics pipeline as
early as possible. Additionally, those parts of the scene have to be culled in large chunks, because we do not
want to clip everything and conclude that nothing at all is visible afterwards. Thus, there has to be some scheme
to group polygons and objects together, ideally in a hierarchical fashion.
The second step, which needs to be taken after all polygons outside the viewing frustum have already been
culled, is the elimination of unnecessary overdraw. Especially in complex, heavily occluded scenes1 the number
of polygons contained in the viewing frustum will still be too high to be handled by z-buffering alone.
Everything still present at this step is potentially visible, but only with respect to the entire viewing frustum. A
large number of polygons, depending on the scene, will be drawn into the frame buffer only to be overdrawn by
polygons being nearer to the viewpoint later on. And, depending on drawing order, a large number of polygons
will be rasterized by the hardware only to be separately rejected at every single pixel as being invisible, because
a nearer polygon has already been drawn earlier on and filled the z-buffer accordingly. So, if those polygons
could be identified before they are submitted to the hardware, a huge gain in performance would be possible,
again, depending on the scene. In heavily occluded scenes the speedup gained can be enormous. Naturally, the
efficiency of this identification process is an important economical factor.
To summarize, polygons have to be culled in essentially two steps. First, everything not even partially contained
in the viewing frustum is identified and culled. Second, everything that is entirely occluded by other objects or
polygons is culled. The remaining polygons can be submitted to the hardware z-buffer to resolve the visibility
problem at the pixel level, or any other algorithm capable of determining exact visibility can be used.
Alternatives to z-buffering for resolving exact visibility are mostly important in software-only rendering
systems, though.


These are scenes with a high depth complexity. I.e., if all polygons comprising such a scene are rendered into the graphics
hardware’s frame buffer as seen from any given viewpoint, pixels are drawn many times over, instead of only once. If no
occlusion culling is employed each pixel is contained in the projection of many polygons and they all have to be rendered in
order to, say, have a z buffer determine which single polygon is really visible at that particular pixel. Hence a major goal of
occlusion culling is to reduce a given scene’s depth complexity as perceived by most levels of the graphics pipeline.



2.1 Hierarchical Subdivision
An important scheme employed by virtually every occlusion culling algorithm is hierarchical partitioning of
space. If a partition high up in such a spatial hierarchy can be classified as being wholly invisible, the hierarchy
need not be descended any further at that point and therefore anything subdividing that particular partition to a
finer level need not be checked at all. If a significant part of a scene can be culled at coarse levels of subdivision,
the number of primitives needing to be clipped against the viewing frustum can be greatly reduced.
Hierarchical subdivision is the most important approach to exploiting spatial coherence in a synthetic scene.
We are now going to look at some of the most common spatial partitioning schemes employing some sort of
hierarchy and their corresponding data structures.

Hierarchical Bounding Boxes
A simple scheme to impose some sort of hierarchy onto a scene is to first construct a bounding box for each
object and then successively merge nearby bounding boxes into bigger ones until the entire scene is contained in
a single huge bounding box. This yields a tree of ever smaller bounding boxes which can be used to discard
many invisible objects at once, provided their encompassing bounding box is not visible [Möl99].
However, this simple approach is not very structured and systematic and therefore useful heuristics as to which
bounding boxes to merge at each level are difficult to develop. The resulting hierarchy also tends to perform well
for certain viewpoints and extremely bad for other locations of a synthetic observer.
To summarize, the achievable speedup for rendering complex scenes by using such a scheme alone for occlusion
culling is highly dependent on the given scene and, worse, on the actual viewpoint, generally rather
unpredictable and therefore simple hierarchical bounding boxes are very often not sufficient as sole approach to
occlusion culling, especially if observer motion is desired. That said, some variant of this idea can nevertheless
be very useful when used to provide auxiliary information or setup data.

The octree is a well known spatial data structure that can be used to represent a hierarchical subdivision of threedimensional space. At the highest level, a single cube represents the entire space of interest. A cube for which a
certain subdivision criterion is not yet reached is further subdivided into eight equal-sized cubes − their parent
cube’s octants. This process can be naturally represented by a recursive data structure commonly called octree.
Each node of an octree has from one to eight children if it is an internal node; otherwise it is a leaf node.
In the context of occlusion culling, octrees are usually used to hierarchically partition object or world space,
respectively. For example, each object could be associated with the smallest fully enclosing octree node. Culling
against the viewing frustum can then be done by intersecting frustum and octree, culling everything contained in
non-intersecting nodes. This intersection operation can also easily exploit the hierarchy inherent in the octree.
First, the root node is checked for intersection. If it intersects the viewing frustum, its children are checked and
this process is repeated recursively for each node. A node not intersecting the viewing frustum at all can be
culled together with its entire suboctree.
This scheme can also be employed to cull entire suboctrees occluded by other objects, provided such an
occlusion check for octree cubes is possible and can be done effectively.
One of the most important efficiency problems with using octrees for spatial subdivision of polygonal scenes is
caused by the strictly regular subdivision at each level. Since the possible location of octree nodes is rather
inflexible, certain problem cases can occur. Imagine, for instance, a subdivision where each polygon is
associated with the smallest enclosing octree cube. This process is very dependent on the location of each of the
polygons. If a polygon is located about the center of an octree cube it has to be associated with that particular
cube, even if its size is very small compared to the size of the cube itself. Even though schemes to alleviate this
problem have been proposed, this and similar problems are inherent shortcomings of a regular subdivision, even
if it is hierarchical.



The two-dimensional version of an octree is called quadtree and can be used to hierarchically subdivide image
space, for instance. Incidentally, image space pyramids and image space quadtrees, although very similar, are not
the same. A pyramid always subdivides to the same resolution in all paths, i.e. it cannot adapt to different input
data as easily; in particular, it is not possible to use different resolutions for different areas of an image.
For an in-depth explanation of octrees and quadtrees, their properties and corresponding algorithms, as well as
detailed descriptions of other hierarchical data structures, see [Sam90a] and [Sam90b].

K-D Trees
K-D trees [Ben75] can generally be used to hierarchically subdivide n-dimensional space. A k-D tree is a binary
tree, partitioning space into two halfspaces at each level. Subdivision is always done axial, but it is not necessary
to subdivide into two equal-sized partitions. So, − in contrast to octrees, where subdivision at each level is
always regular − the selection of a separating hyperplane can depend more on the actual data. Usually one
halfspace contains the same number of objects as the other halfspace, or exactly one more. This also ensures that
the corresponding binary tree is balanced. Additionally, subdivision is not only axial, but also progresses in a
fixed order. First, space is subdivided along the first dimension, then the second, and so on, until all k
dimensions have been used up. Then the subdivision proceeds using the first dimension once again, as long as a
certain termination criterion for further partitioning has not yet been reached.
K-D trees have a number of applications − e.g., n-dimensional range queries; see [Ber97], for instance −, but the
most important areas of application as pertaining to occlusion culling are three dimensional k-D trees to
hierarchically group objects in object and world space, respectively, and two dimensional k-D trees for image
space subdivision.

BSP Trees
Binary Space Partitioning or BSP trees, as detailed in [Fuc80], can be seen as a generalization of k-D trees.
Space is subdivided along arbitrarily oriented hyperplanes (planes in 3-D, lines in 2-D, for instance) as long as a
certain termination criterion is not yet reached. The recursive subdivision of space into two halfspaces at each
step produces a binary tree where each node corresponds to the partitioning hyperplane. Normally, a scene
consisting of polygons is subdivided along the planes of these polygons until every polygon is contained in its
own node and the children of leaf nodes are empty halfspaces. Every time space is subdivided, polygons
straddling the separating plane need to be split in two. The newly created halves are assigned to the positive and
negative halfspaces, respectively. This leads to the problem that the construction of a BSP tree may introduce
O(n2) new polygons into a scene, although this normally only occurs for extremely unfortunate subdivisions.
Primarily, a BSP tree is not used to merely partition space in a hierarchical fashion; it’s a very versatile data
structure that can be used in a number of ways. The most important thereof is exact visibility determination for
arbitrary viewpoints. For entirely static polygonal scenes a BSP tree can be precalculated once and its traversal at
run time with respect to an arbitrary viewpoint yields a correct back-to-front or front-to-back drawing order in
linear time.
At each node it must be determined if the viewpoint lies in the node’s positive or negative halfspace,
respectively. If the viewpoint is contained in the node’s positive halfspace everything in the negative halfspace
has to be drawn first. Then, polygons2 attached to the node itself may be drawn. Last, everything in the positive
halfspace is drawn. This process is repeated recursively for each node and yields a correct drawing order for all
polygons contained in the tree.
An important observation to make is that each node implicitly defines a convex polytope, namely the intersection
of all the halfspaces induced by those hyperplanes encountered when traversing the BSP tree down to the node
of interest. This property is very useful with respect to the subdivision of space into convex cells, an operation
often needed by occlusion culling algorithms. If you have, for instance, a polygonal architectural model, a BSP
tree can be used to subdivide the entire model into a set of convex polytopes − the cells − which, in the 3-D case,
are convex polyhedrons. For such an application it might be sensible to not attach single polygons to the BSP

A BSP tree node may contain one or more polygons as long as they are all contained in the node’s plane. It’s often useful to
maintain two lists of polygons for each node. One list contains polygons facing in the same direction as the separating plane,
whereas polygons contained in the other list are all backfacing with respect to the separating plane. With such a scheme,
backface culling can be applied to entire lists of polygons at the same time.



tree’s nodes, but to only attach separating planes to internal nodes and entire convex cells together with their
constituting polygons to leaf nodes. The model’s polygons would then be contained in the boundaries of those
convex cells (their ‘walls’). Such a modified BSP tree approach yields explicitly described convex polytopes
instead of their implicit counterparts in an ordinary BSP tree.
During the walkthrough phase, a BSP tree may be used to easily locate the convex cell containing the synthetic
observer, cull entire subtrees against the viewing frustum, and obtain a correct drawing order for whole cells
[Nay97]. The walls of those cells themselves may be drawn in any order, since they correspond to the boundaries
of convex polyhedrons and thus cannot obscure one another.
For purposes of occlusion culling it can be extremely useful to attach probably axial bounding boxes to each of
the BSP tree’s nodes, encompassing all children of both subtrees and the node itself. During tree traversal each
node’s bounding box is checked against the viewing frustum and − provided that no intersection is detected − the
entire subtree can be culled.
Also, BSP trees can be effectively combined with the notion of potentially visible sets, see below, to obtain a
correct drawing order for the set of potentially visible cells.

2.2 Occlusion Culling
This section reviews several key ideas and data structures used in occlusion culling.

Potentially Visible Sets
Many occlusion culling algorithms use the notion of potentially visible sets (PVS), first mentioned by [Air90].
This term denotes the set of polygons or cells in a scene which is potentially visible to a synthetic observer. A
polygon or cell contained in the PVS is only potentially visible, which is to say it is not entirely sure that it really
can be seen from the exact viewpoint at any specific instant. The reason for this is that most algorithms trade the
exact determination of visibility for improvements in computation time and an overall reduction of complexity of
the algorithm. The result of a visibility query is not the exact set of visible polygons or cells, but a reasonably
tight conservative3 estimate. For instance, in approaches that precalculate potentially visible sets for each cell of
a scene subdivided into convex cells, the viewing frustum cannot be taken into account, since the orientation of
the observer at run time is not known beforehand. But, the set of all polygons that can be seen from any
viewpoint with any orientation in the convex cell is a conservative estimate for the actual set of visible polygons
once the exact position and orientation of the observer are known. Moreover, due to algorithm complexity and
processing time considerations, maybe not even the former set is calculated exactly but rather estimated in a
conservative manner.
If, as mentioned before, cell-to-cell visibility information is precomputed and attached to each cell, it can be
retrieved at run time very quickly to establish a first conservatively estimated PVS. This PVS can subsequently
be further pruned by using the then known exact location and orientation of the synthetic observer in a specific
cell [Tel91, Tel92b]. This can be done by simply culling the PVS against the actual viewing frustum, for

Intuitively, a portal [Lue95] is a non-opaque part of a cell’s boundary, e.g. a section of a wall where one can see
through to the neighboring cell. If the entire scene is subdivided into cells, the only possibility for a sightline to
exist between two arbitrary cells is the existence of a portal sequence that can be stabbed with a single line
segment. So, if a synthetic observer in cell A is able to see anything in cell B there must exist a sequence of
portals Pi where a single line pierces all of these portals to connect a point in A with a point in B.
Rephrased, if we want to determine if anything located in a given cell (including the cell’s walls) is visible,
through any portals, from the cell the current viewpoint is contained in, we need to calculate if such a sightline
exists [Fun96].
A conservative estimate is an overestimation of the set of actually visible polygons. Although this estimate may be
unnecessarily large, it is guaranteed to be a superset of the set of all visible polygons, i.e. no visible polygons can be
misclassified as being invisible.



Another way to tackle the concept of portals is to imagine a portal as an area light source where one wants to
determine if any of the portal’s emitted light is able to reach any point in a given cell. If this is the case, a
sightline between those two portals exists and therefore an observer in cell A is possibly able to see some part or
all of cell B [Tel92a].
One use of portals is the offline determination of the PVS for a given cell, namely the set of all cells for which a
stabbing sequence from a portal of the source cell to a portal of the destination cell exists, regardless of the exact
location of the viewpoint within the source cell. This information can be precomputed for each cell in a model
and used at run time to instantly retrieve a PVS for any cell of interest.
Alternatively, the concept of portals can be used to dynamically determine a PVS for any given cell entirely at
run time, without the use of any precomputed information. The next section conceptually compares both of these

Static vs. Dynamic Visibility Queries
A very important property of an algorithm dealing with the determination of potentially visible sets is its ability
or inability to handle dynamic changes in a scene efficiently. This depends on whether the algorithm computes
the PVS offline or dynamically at run time.
If dynamic scene changes need to be accommodated quickly − i.e., without a lengthy preprocessing step − the
algorithm has to support dynamic visibility queries.
Naturally, dynamic visibility queries suffer from a performance penalty as opposed to static visibility queries.
First, PVS information cannot simply be retrieved from a precomputed table but has to be computed on the fly.
To alleviate this problem some algorithms try to exploit temporal coherence (see next section).
Second, due to processing time constraints, the PVS generated by dynamic visibility queries may be not as tight
as the PVS generated by table lookups and pruned to the viewing frustum at run time. This incurs a performance
penalty at the rasterization level, as the low level visibility determination − in most cases a z-buffer − has to deal
with additional invisible polygons.
One promising approach employed by more recent algorithms is to combine both static and dynamic information
to determine a PVS. Some amount of a priori information is precomputed and used to speed dynamic visibility
queries and enhance their effectiveness, respectively.

Spatial and Temporal Coherence
In the attempt to make occlusion culling algorithms more effective, it is important to take advantage of any
potential coherence as much as possible.
The term spatial coherence subsumes both object space and image space coherence. Object space coherence
describes the fact that nearby objects and polygons in object space very often belong to the same ‘class’, say,
with respect to their visibility. A hierarchical subdivision of object space can directly take advantage of this
coherence. The hierarchy is used to ensure that nearby objects are considered together first − to be only
considered at a finer level if their invisibility cannot be proved at the coarser level.
Image space coherence is the analog to object space coherence in the two dimensional, already projected, image
of a scene. It can be exploited by a subdivision of image space using, e.g., an image space BSP tree.
Alternatively, coherence at the pixel level might also be used to advantage by, say, using the fact that adjacent zbuffer entries normally do not have greatly differing depth values.
Temporal coherence can, for example, be exploited by caching some of the information calculated by an
algorithm from one frame to subsequent frames, and using this cached information to make an educated guess as
to what parts of the scene will actually be visible in the next frame. Such information can be used directly, or to
generate some sort of setup information to enhance the performance of a particular algorithm.



3 High-performance Low-level Graphics APIs
Over the last few years, the focus of graphics development in the area of entertainment software has clearly
shifted from exclusive software rendering to the support of consumer-level 3D hardware accelerators. Very
prominent examples of such accelerators are boards featuring a chipset of the Voodoo Graphics family by 3dfx
Interactive. Although powerful graphics boards are already widespread throughout the potential customer base
for computer games, most companies still offer optional software rendering in their products. The most
important reason for this is that the majority of desktop computers is still not equipped with special-purpose 3D
hardware. Nevertheless, this situation is changing rapidly and many future releases will require hardware
A very important issue in the development of contemporary computer games is the choice of the underlying
graphics API that is used to access the facilities offered by the graphics hardware. One criterion for this decision
is whether to support only a single family of accelerators through a proprietary API like 3dfx’s Glide, or a
multitude of different hardware vendors’ products through an industry-standard API like OpenGL or Direct3D.
From a marketing point of view, this decision might seem to be easy. Clearly, the bigger the customer base, the
better. A very important issue, however, is support and quality of an API − in particular, the availability and
quality of the drivers necessary to access the target hardware. The choice of API has always been far from clearcut and is still crucial. For this reason, many developers adopt the approach of supporting more than one API,
letting the user select at installation or startup time, maybe even on-the-fly from within the program.
If one decides to support more than one graphics API, maybe in addition to proprietary software rendering, the
issue of how to effectively develop in such a scenario becomes critically important. Since the Parsec engine
supports OpenGL and Glide transparently, this issue is of special interest in the context of this thesis.
In order to support several graphics APIs in the Parsec engine, we have designed an abstract interface layer
comprised of several subsystems. This abstract interface is implemented for all supported APIs. However, all
other graphics code resides entirely above this interface layer and is therefore independent from the graphics API
actually used at any one time. Supporting additional graphics APIs is possible by simply implementing the
functionality required by the interface for the new target. Thus, the vast majority of the code does not need to be
This chapter briefly reviews some issues regarding the most important graphics APIs in the current desktop

3.1 Glide
Glide [Glide] is the low-level, hardware-oriented graphics API introduced by 3dfx Interactive along with its first
Voodoo Graphics accelerator in 1996. It is a proprietary API, so it is only supported by 3dfx’s hardware. In
1996, however, these accelerators were the de-facto standard, so Glide has been used as primary or at least
alternative graphics API by many computer games for several years.
Glide has several key advantages, foremost of all its high performance and ease of use. In fact, the API is so
hardware-oriented that it practically does not support anything the hardware itself does not support. So, since
Voodoo Graphics accelerators are basically fast rasterizers, i.e. operating in two-dimensional screen space and
rasterizing polygons already transformed, lit, clipped, and projected by the application, Glide is also only a
rasterization API. It does not perform any clipping, 3D transformations, and other operations at a higher level
than pure graphics primitive rasterization. Texture memory management is also the sole responsibility of the
application programmer. Of course, all this means a lot more work for the programmer, but also a lot more
flexibility, like all trade-offs between high-level and low-level programming.
In addition to being very high performance, Glide is also very ease to use. It offers an easy to understand C
application programming interface, and – definitely a crucial factor for its tremendous success with game
developers – a very good SDK containing all necessary documentation that is available for free to anyone
interested. There is no special registration or fee necessary to get at the SDK, 3dfx made it freely available for
download almost right from the beginning [Glide].
By and large, the Glide rasterization API was definitely a huge factor in 3dfx’s market dominance in 1996,
which stayed almost untouched by competitors until 1998. 3dfx’s Voodoo Graphics hardware was the prevalent

High-performance Low-level Graphics APIs


hardware accelerator platform, and Glide was the prevalent high-performance, low-level, consumer 3D graphics
However, starting with NVIDIA’s Riva TNT in 1998, many new low-cost graphics accelerators offering very
high performance have become available, and the driver situation has also improved tremendously. Thus, a
migration from using Glide to APIs like OpenGL or Direct3D, that support a multitude of different hardware
accelerators, can be observed.

3.2 OpenGL
OpenGL [Seg98] is a very powerful and widely used graphics API that evolved from Silicon Graphics’ IrisGL.
Originally meant for programming workstation-class 3-D hardware, high-quality OpenGL drivers are available
for the most important consumer products of today. This is also due to the fact that workstation and consumer
hardware are in the process of converging in many respects. A very important property of OpenGL is that it is
supported on many platforms. Graphics code written for OpenGL can easily be ported to a PC, a Macintosh, and
− of course − an SGI workstation, among others. OpenGL offers an easy to use C application programming
interface, and is also an extremely well documented API.
For more information about OpenGL see [Seg98, Woo99, OGL]. The SIGGRAPH course on advanced graphics
programming techniques using OpenGL [McR00], that has been held over several consecutive years, also offers
a wealth of information on OpenGL and graphics programming on contemporary graphics hardware in general.

3.3 Direct3D
Direct3D, which is part of [DirectX], also supports a multitude of graphics hardware, although it is exclusively
restricted to Microsoft Windows platforms. Nevertheless, these comprise the most important segment of the
computer games market for the desktop, and Direct3D is widely supported by game developers.
A very important difference between OpenGL and Direct3D is that an OpenGL implementation is required to
support the entire feature set as defined by the standard, whereas Direct3D exports the functionality of the
hardware in the form of capability bits. This implies that OpenGL must emulate missing hardware functionality
in software. With Direct3D, the programmer has to explicitly determine what to do should desired features be
found missing.

3.4 Geometry Processing
A crucial issue is whether an API supports geometry processing, or is rasterization-only. Since Glide exports
only the features of the actual hardware and all Voodoo Graphics accelerators to date do not support geometry
acceleration, the API does not support three-dimensional operations like transformation, clipping, and projection.
All coordinates in Glide are screen-coordinates together with additional attributes that the hardware interpolates
over a triangle, e.g., texture coordinates (U,V,W) and color (R,G,B,A). That is, coordinates are already in postperspective space. As soon as accelerators supporting geometry processing in hardware become widespread, this
poses a problem to the API. There are already two major versions of Glide − 2.x and 3.x, the latter already
supporting a homogeneous clipping space −, and the API will probably continue to evolve with the capabilities
of 3dfx hardware.
Both OpenGL and Direct3D support geometry processing, allowing to exploit geometry processors if available.
Current consumer hardware is still restricted to rasterization, but this will probably change in the not-too-distant
future. There is also another issue related to whether an API supports geometry processing; if it does, and there is
no geometry processing hardware, the driver has to do all geometry calculations. This has important
implications. First, the performance of a program will depend even more on the quality of the driver. However,
driver-quality is already quite high and developers are hard-pressed to outperform them with their own code.
This is particularly true when special purpose features of the host CPU are leveraged. The MMX extensions to
the instruction set of the Pentium processor are not really well suited to geometry code due to their integer
nature, but AMD’s 3DNow! [AMD] and Intel’s Streaming SIMD Extensions [Intel], introduced with the
Pentium III, feature SIMD floating point instructions that can be put to good use in 3-D graphics drivers.
Supporting all of these extensions directly in a program requires a lot of development effort that might not be

High-performance Low-level Graphics APIs


justified. The most important reason, however, to use the geometry support of a graphics API is to be prepared
for the future widespread availability of hardware with dedicated geometry processing support.
That said, Parsec currently does most geometry calculations before submitting primitives to the driver. OpenGL
has to be configured to use an orthogonal projection to only use it for rasterization [Woo99].

High-performance Low-level Graphics APIs


4 Game Technology Evolution
This chapter provides an overview of the technology employed in 3D computer games over the last decade.
Technology in this context means both software technology, e.g., the algorithms and techniques employed, as
well as hardware technology, which has become important with the advent of powerful low-cost consumer
graphics hardware in 1996.
Section 4.1 covers seminal computer games, and section 4.2 is devoted to 3D hardware accelerators.

4.1 Seminal 3D Computer Games
In this section, we illustrate the evolution of 3D computer games over the last eight years by looking at several
seminal games of that period. Prior to 1992, computer games were either not three-dimensional at all, or used
simple wireframe rendering, or maybe flat-shaded polygons. In some cases, 3D information was pre-rendered or
drawn into bitmaps, and used at run-time to produce a three-dimensional impression, although there was no
actual 3D rendering code used in the game itself.

Ultima Underworld (Looking Glass Technologies, 1992)
In Ultima Underworld, a role-playing game set in the famous Ultima universe created by Origin Systems,
players were able to walk around in a fully texture-mapped [Hec89, Hec91] 3D world for the very first time.
Most role-playing games prior to Ultima Underworld were not three-dimensional at all, e.g., using a top-down or
isometric perspective and tile-based 2D graphics like the earlier Ultima games. One could not walk around in
these worlds in the first-person perspective, so the feeling of “actually being there” was rather limited.
Another earlier approach was to combine hand-drawn graphics tiles with a very restricted first-person view,
which was originally made popular in the 1980s by the game Dungeon Master, by FTL. However, the world in
Dungeon Master was not actually 3D; player positions were constrained to a predefined grid and the only
allowed rotation of the view was in steps of 90 degree angles, so one could only look straight ahead, straight to
the left or right, or to the back. This approach creates a limited three-dimensional impression without using any
actual 3D calculations at run-time.
The world in Ultima Underworld, however, contained basically no technological viewpoint restrictions and was
– at least to a certain extent – fully 3D. The player position was not constrained to a simple grid anymore,
players were able to seamlessly walk over actual texture-mapped floor polygons. Rotations about the principal
axes were also allowed, most notably looking to the left or right with arbitrary rotation angles, and looking up or
down with proper perspective fore-shortening of polygons. This is especially remarkable since it wasn’t until
several years later that most 3D games were using an actual rotation about the horizontal axis for this purpose,
instead of not allowing the player to look up or down at all, or faking the rotation by using a shear
However, the flexibility allowed for by Ultima Underworld’s 3D engine had its price in terms of performance.
Since the whole world was texture-mapped and polygons could be viewed at arbitrary oblique angles, the
texture-mapper was simply not able to texture the entire screen in real-time, at least not on most consumer
hardware available in 1992. For this reason, the game used a smaller window for rendering the 3D view of the
world, and used the remaining area of the screen for user interface elements like icons, the player character’s
inventory, an area for text output, and the like.
For a role-playing game like Ultima Underworld its rather slow speed was no problem, however, since it wasn’t
a fast-paced action game after all, emphasizing game play and design much more than many 3D action games of
the following years.
Characters and objects in Ultima Underworld were not rendered as actual 3D objects, but as simple twodimensional sprites (billboards) instead. That is, they consisted of bitmaps that were scaled in size according to
the viewing distance, and animation was done using a sequence of pre-drawn frames, like in traditional 2D

Game Technology Evolution


See figure 4.1 for a screenshot of Ultima Underworld.

Figure 4.1: Ultima Underworld (1992)

Wolfenstein 3D (id Software, 1992)
Shortly after Ultima Underworld, a small game developer named id Software released what would eventually
found a new computer game genre: the first-person shooter, commonly abbreviated as FPS. This game,
Wolfenstein 3D, emphasized fast-paced action above all, where the player was able to run around in first-person
perspective with high frame rates, and the goal of the game was primarily to shoot everything in sight. However,
this simple formula was easy to grasp and the fast action game play combined with equally fast frame rates
contributed to a remarkable success.
The most important contribution of Wolfenstein 3D, however, was that it was to become the prototype for
graphically and technologically much more sophisticated first-person shooters in the following years, like Doom
and Quake. So, the questionable game content notwithstanding, Wolfenstein had a much higher impact on games
in the following years in terms of technology than Ultima Underworld.
In contrast to Ultima Underworld, the game world in Wolfenstein was highly restricted. The player had only
three degrees of freedom (DOF); two degrees for translation, and one degree for rotation. That is, movement was
constrained to a single plane and the view point could only be rotated about the vertical axis. So, it was possible
to look to the left and right with arbitrary viewing angles, but nothing else.
In order to avoid the negative performance impact of texturing the entire screen, only wall polygons were
texture-mapped. The floors and ceilings were simply filled with a solid color.
See figure 4.2 for a screenshot of Wolfenstein 3D.

Figure 4.2: Wolfenstein 3D (1992)
Game Technology Evolution


In addition to texturing only the walls, the placement of these walls was restricted in a way that all of them were
placed in 90 degree angles to each other, and all walls were of the same height. This restriction of the world
geometry, combined with the restriction on the allowed motion of the player, also made use of an extremely
simplified texture-mapper possible. Walls could be rendered as a series of pixel columns, where the depth
coordinate was constant for each column. So, the perspective correction had to be performed just once for each
column, leading to an extremely optimized (and equally restricted) texture-mapper.
The visibility determination in a world like Wolfenstein’s also profited tremendously from the simplicity of the
game world. The game used a simple ray-casting algorithm, where a single ray was cast to determine the entire
visibility (and horizontal texture coordinate) of an entire screen column. Since all walls were of the same height,
there was always exactly one wall visible per screen column, or none at all. Thus, as soon as the cast ray hit the
nearest wall, the visibility determination for the corresponding column was done.
Similar to Ultima Underworld, all characters and objects in Wolfenstein 3D were two-dimensional sprites.

Doom (id Software, 1993)
When Doom first appeared in 1993, it managed to lift many of the restrictions that made its direct predecessor
Wolfenstein 3D a very simple and tremendously restricted game. It is still one of the most successful computer
games of all time.
Doom combined fast game play and high frame rates with a fully texture-mapped world like in Ultima
Underworld, although the world geometry was still much more constrained. The basic premise was similar to
Wolfenstein, but the complexity of Doom’s levels was truly remarkable for a game running on consumer
hardware at the time.
Doom’s levels were represented as a single large 2D BSP tree, which was most of all used for visibility
determination purposes. Levels could be constructed using some kind of two-dimensional floor plan, i.e., a topdown view, where each line segment corresponds to a wall and is displayed as a polygon in 3D by the game
engine at run-time. Of course, this underlying 2D nature of Doom’s levels led to a lot of necessary restrictions
like “no rooms above rooms,” where it was impossible to model multi-storied buildings or anything else where
there are two floor or ceiling heights at the same position of a top-down view. Sometimes, such a combination of
2D geometry actually used to define some sort of restricted 3D geometry via lofting or extrusion is called 2.5D.
Doom was able to texture-map the entire screen at really high frame rates by once again cleverly exploiting the
combination of a constrained world geometry with restrictions on the allowed rotation of the view point. Since
all wall polygons were extruded orthogonally to the floor from the level representation at run-time, all visible
polygons were either parallel to the floor plane, or orthogonal to it. Combined with the fact that view point
rotation was only possible about the vertical axis, this yields the observation that the depth coordinate is always
constant for an entire horizontal or vertical polygon span; for floor/ceiling and wall polygons, respectively.
Sometimes, such an approach to texture-mapping is called “constant z texture-mapping.”
See figure 4.3 for a screenshot of Doom.

Figure 4.3: Doom (1993)
Game Technology Evolution


When using a BSP tree for visibility determination there are two basic approaches in which order the tree can be
traversed in order to obtain correct visibility. The simplest is back-to-front rendering, in which the polygons are
simply drawn from farthest to closest, in essence using a painter’s algorithm [Fol90]. Since the BSP tree yields a
correct visibility order for an arbitrary viewpoint, it is easy to let nearer polygons overdraw polygons farther
away and thus obtain a correct image.
The problem with back-to-front rendering, however, is that it draws a lot of unnecessary polygons, since it starts
with the polygons that are most likely to not be visible at all. Most polygons of a level are invisible most of the
time, because they are overdrawn by nearer polygons completely overlapping them.
A much better, but also more sophisticated, approach is to use front-to-back rendering instead. With this order of
traversal, drawing starts with the nearest polygon and progresses to the farthest polygon. The major difference is
that as soon as the entire screen has been filled by polygons drawn up to a certain position in the BSP tree,
further traversal is completely unnecessary, since all visible polygons have already been drawn at that time.
Thus, Doom used front-to-back traversal of the 2D BSP tree representing the entire level, and kept track of
covered pixel spans – which was necessary to prevent occluded parts of polygons farther away from
overdrawing visible parts of polygons nearer to the view point – and stopped traversal as soon as it knew that the
entire screen had been covered. This tracking of already covered screen areas/spans was much simpler in
Doom’s 2.5D case than it would have been in the general 3D case.
Doom’s use of a BSP tree for level representation had the consequence that dynamically moving geometry was
not really possible. Doors, for instance, were actually modeled as very small rooms, where the ceiling height was
modified on-the-fly. It wouldn’t have been possible to model swinging doors, or the like. This was due to the
fact that BSP trees are not really suited to handling dynamic geometry, especially not in real-time. Also, the
building process of a BSP tree – the so-called BSP tree compilation – is very time-consuming, so there was a
significant delay between designing a level and actually being able to try it out in the game.
Similarly to Ultima Underworld and Wolfenstein 3D, Doom still used simple sprites for characters and objects.
Another important aspect of Doom, albeit not graphics-related, was that it supported Novell’s IPX protocol for
network game play on local area networks. Thus, it became the first multiplayer game with sophisticated 3D
graphics that was played by a staggering number of people all over the world.
Another trend that started with Doom and had an extremely wide impact on computer games being developed
after it, was that it was also highly user-extensible. Players could easily substitute graphics, sound effects, and
the like, and even create their own levels with a wide variety of level editors that were developed by community
members and made available for free in most cases. Today, many games come with a level editor out of the box
and a thriving community is working on new content, as well as game modifications using source code released
by the game developers themselves.

Descent (Parallax Software, 1994)
In 1994, a previously unknown company called Parallax Software released a game that featured a fully 3D, 360degree, six degrees of freedom action game – Descent.
Descent was the first computer game that was able to render arbitrarily oriented polygons with perspective
correct texture mapping at frame rates high enough for an action game. Most astoundingly, Descent featured a
true three-dimensional world where the player could navigate a small spaceship through texture-mapped
underground mines. It was a first-person game, but the fact that the player was controlling a spacecraft, instead
of a character walking on foot, allowed all axes to be basically equal.
The visibility determination in Descent was not done with a variant of the BSP tree approach, but instead with a
subdivision of the entire world into convex cells interconnected via portals. A cell in Descent consisted of a solid
“six-face,” a cube that could be distorted arbitrarily, as long as it stayed a convex solid. Thus, each cell had
exactly six walls, which could be either solid (mapped with a texture and impassable), or a portal, where the
player could see through and fly to the neighboring cell.

Game Technology Evolution


See figure 4.4 for a screenshot of Descent.

Figure 4.4: Descent (1994)
In order for a cell structure connected via portals to be traversed effectively, some kind of adjacency graph is
usually used. Each node in the graph corresponds to a cell of the subdivision, and each edge describes a
connection between two adjacent portals. Using this information it is very easy to start in a specific cell and
jump from cell to cell by passing through interconnecting portals.
In such a system, traversal starts with the cell that contains the view point and some kind of depth-first algorithm
is employed to recursively render the entire world. After rendering all solid walls of the cell containing the view
point, all portals of this cell are touched and for each one of them everything is rendered that is visible through
that particular portal.
Cells as building blocks of a world can also be used to store additional attributes, like lighting information, or
whether that area (volume) is poisonous, has different gravity, etc. In Descent, the level designers could assign
an ambient light intensity for each of the eight cell vertices. At run-time, vertices could be lit dynamically by
moving light-sources like lasers, and the like, combining the dynamic lighting value with the static ambient light
intensity on-the-fly. Lit polygons were rendered by applying Gouraud-shading [Rog98] to the textures of a cell’s
One of the major properties of Descent’s world representation was that the cell subdivision was not built during
a post-process after designing a level, as would be done in a BSP-based structure. Instead, the cell subdivision
was an intrinsic part of the representation and the design process itself. The data structure used at run-time was
basically constructed in its entirety while a level was being built. That is, since the level designers used the exact
same geometric building blocks the engine itself used, and designated cell walls manually as either being solid
(by assigning a texture), or being a portal (by not assigning a texture), no post-process subdivision and portalextraction was necessary. The adjacency information of cells was also manually created while constructing a
level, since new cells had to be explicitly attached to already existing cells when it should be possible to pass
from one cell to another. There were also no problems with t-junctions [McR00], say, an edge of one cell
touching a face of another cell in its middle. This was achieved by requiring that neighboring cells always share
exactly four vertices, so the connection would be created from one face to another face, over the entire surface of
each of these faces.
Many of these constraints on the design process could be viewed as a liability, but in the case of Descent it was
very much tailored to the type of game. With such a “distorted-cube”-based approach to level-building it was
actually very easy to build the interior of mines, mostly consisting of rather long tunnels with many twists and
bends. All in all, Descent was a unique combination of game-design and technology, where each of these crucial
parts was ideally tailored to its counterpart.
The characters in Descent, mostly hostile robots, were also not restricted to two-dimensional sprites anymore,
like in nearly all texture-mapped 3D games that preceded it. Instead, the robots prowling Descent’s sprawling
underground mines consisted of texture-mapped and diffusely lit polygons. In addition to these polygonal 3D
objects, however, Descent still used billboards for some objects, like power-ups floating in its tunnels, and
weapons projectiles, for instance.
Game Technology Evolution


Descent used also many other clever restrictions in order to achieve its high performance. For example, all cell
walls were textured using textures of a single size, namely 64x64. This allowed the use of texture-mapping
routines hard-wired for this size, and made a lot of other administrational tasks with respect to textures easier.
Texture-mapping was done using a linear interpolation of texture-coordinates for sub-spans of the horizontal
spans of each polygon [Wol90], usually performing the perspective division only every 32 pixels. There were
also a lot of highly specific assembly routines for texture-mapping, like one texture-mapper using a texture
without any lighting, one for texture-mapping with lookup into a global ambient light or fading table, one for
texturing and Gouraud-shading at the same time, and so on.
Descent still used fixed point and integer arithmetic for all of its geometrical computations like transformations,
as did practically all of its predecessors.

Quake (id Software, 1996)
Quake was the first first-person shooter that used true three-dimensional environments. It was also able to render
geometry that was several orders of magnitude more complex than what Descent had been able to use. In order
to achieve this, its developers had to use quite a lot of 3D graphics techniques that had previously never been
used in a computer game.
See figure 4.5 for a screenshot of Quake.

Figure 4.5: Quake (1996)

The basic level structure in Quake used one huge 3D BSP tree representing the entire level. In some ways this
could be viewed as being simply an extension from using a 2D BSP tree in Doom for 2.5D geometry, to using
the 3D variant for arbitrary 3D geometry. In reality, however, 3D BSP trees are much more complicated to use
for real-time rendering of complex environments than their 2D counterparts. This is true for many aspects of the
transition from a rather restricted 2D-like environment to full 3D.
First, all polygons can basically be oriented arbitrarily, which mandates a texture-mapper that is able to map such
polygons in real-time. Quake achieved this by performing the necessary perspective division only every 16
pixels and linearly interpolating in between. The difference between this approximation and the true perspective
hyperbola was virtually not noticeable, since the length of these subspans was chosen accordingly.
Prior to Quake, not many games requiring extremely high frame rates were using floating point arithmetic
instead of fixed point arithmetic, since the FPU of the processors at the time was simply not fast enough. In
1996, however, it became feasible to use floating point operations heavily even in computer games, and Quake
did so, all the way down to the subspan-level of its texture-mapper. The perspective division for texture mapping
was still done using the FPU, linear interpolation and pixel-arithmetic was then done in fixed point or integer
arithmetic. Nearly all higher-level operations like transformation, clipping, projection, were done entirely in
floating point.
Game Technology Evolution


Tài liệu bạn tìm kiếm đã sẵn sàng tải về

Tải bản đầy đủ ngay