1

\documentclass[a4papre,12pt]{article}

     2

     3

\usepackage[utf8]{inputenc}

     4

\usepackage[english]{babel}

     5

\usepackage{listings} % For listing code

     6

     7

% Fancy headers

     8

\usepackage{fancyhdr}

     9

\fancypagestyle{plain} {

    10

    \fancyhf{}

    11

    \renewcommand{\headrulewidth}{0.4pt}

    12

    \lhead{\textbf{Group 66}}

    13

    \chead{\textbf{Kishna Glista - liero clone}}

    14

    \rhead{\textsl{AS-0.1102}}

    15

    \cfoot{\thepage}

    16

}

    17

\pagestyle{plain}

    18

    19

% Paragraph formatting

    20

\frenchspacing

    21

\setlength{\parindent}{0pt} 

    22

\setlength{\parskip}{1ex plus 0.5ex minus 0.2ex}

    23

    24

% Title information

    25

\title{Kishna Glista - Liero Clone}

    26

\author{\normalsize{\begin{tabular}{lll}

    27

Atle Kivelä & 79171V & atle.kivela@tkk.fi \\

    28

Eric Malmi & 80351A & eric.malmi@tkk.fi \\

    29

Tero Marttila & & \\

    30

Marko Rasa & & \\

    31

\end{tabular}}}

    32

    33

% The document begins

    34

\begin{document}

    35

\maketitle

    36

    37

\section{Instructions for compiling and use}

    38

    39

You can compile the program by going trough the following procedure:

    40

\begin{itemize}

    41

\item \textsl{cd build}

    42

\item \textsl{./mkcmake.sh}

    43

\item \textsl{make install}

    44

\end{itemize}

    45

    46

\subsection{Basic usage}

    47

Starting. Default Keys. Starting the server. Connecting. etc.

    48

    49

Controls are currently liero default controls.

    50

\begin{center}

    51

\begin{tabular}{l|l}

    52

\textbf{Action} & \textbf{Default key(s)} \\

    53

\hline

    54

Move left & Arrow left \\

    55

Move right & Arrow right \\

    56

Aim up & Arrow up \\

    57

Aim down & Arror down \\

    58

Shoot & Right CTRL \\

    59

Jump & Right shift \\

    60

Change weapon & Enter \\

    61

Shoot rope & Change weapon + jump \\

    62

Change rope length & Change weapon + aim up/down \\

    63

\end{tabular}

    64

\end{center}

    65

    66

\subsubsection*{Starting the game}

    67

Somekind of intstuctions on starting the server, connecting etc...

    68

    69

\subsection{Configuration}

    70

How to make configuration changes.

    71

    72

\section{Program architecture}

    73

A brief description of the program architecture.

    74

    75

\begin{itemize}

    76

\item Network

    77

\item Graphics

    78

\item Input etc.

    79

\item Physics

    80

\end{itemize}

    81

    82

\section{Data structures and algorithms}

    83

    84

\subsection{Basic data structures}

    85

    86

\begin{itemize}

    87

\item Vector

    88

\item List

    89

\end{itemize}

    90

    91

\subsection{World and Objects}

    92

    93

Usually, in side view 2D-games, the terrain is representated as a

    94

polygon. This allows us to implement collision detection and bouncing

    95

rather easily, and it is also a very compact way of storing the

    96

map. In our opinion Liero, however, is fundamentally a pixel based

    97

game and therefore we represent the terrain as a large array of

    98

pixels. These pixels are, however, abstract pixels, i.e. they are not

    99

necessarily in the same scale than the physical resolution. In other

   100

words, the server has an abstract resolution, which is the same for

   101

all clients, and the clients can visualize this abstract array of

   102

pixels in any resolution they wish.

   103

   104

On top of the terrain, the world also includes a list of all objects

   105

in it (players, projectiles and ropes). The objects have a polygon

   106

shape which is used in the collision detection between the objects and

   107

the terrain and the objects with each other.

   108

   109

\subsection{Collision Detection}

   110

   111

\begin{itemize}

   112

\item Polygon collision detection

   113

\item Pixel collision detection

   114

\end{itemize}

   115

   116

Collision detection takes care of the objects not moving inside the

   117

terrain nor inside each other. These two types of collision are

   118

different since the data structures are not the same. In the

   119

terrain-object collision the collision part is rather easy. When a

   120

object is about to move point A to point B we draw a line between

   121

those points. Then we iterate over that line and check that none of

   122

the vertices of the object's shape are inside the terrain. However, we

   123

have to be able to bounce the object from the terrain and in order to

   124

do that, a normal for the collision point needs to be calculated. For

   125

a polygon this would easy, but for a discrete array of pixels it's

   126

little bit different.

   127

   128

We come up with the following algorithm for calculating an

   129

approximation for the normal. Take the collision point and the point

   130

before the collision and consider a 3x3 array of pixels which has the

   131

collision point in the middle of it. Then, do sort of an bredth-first

   132

search from the previous point to get all the empty pixels. Take the

   133

vectors from the collision point to the empty point and sum these

   134

vectors. The resulting vector will point approximately along the

   135

normal. Picture explains this a lot.

   136

   137

\subsection{Physics}

   138

runge kutta, something network related?

   139

   140

\section{Known bugs}

   141

A lots of them (or maybe not).

   142

   143

\section{Tasks sharing and schedule}

   144

Hectic ass hell. Communication worked pretty well but we weren't as systematic

   145

as we should have been.

   146

   147

\section{Differences to the original plan}

   148

The plan was loose enough to let us make decisions during development. 

   149

   150

% References

   151

\begin{thebibliography}{99}

   152

\bibitem{foo} Foo reference

   153

\end{thebibliography}

   154

   155

\end{document}