This is the long due fifth article in this series. If you aren’t comfortable with vectors, you might want to take a look at the first four articles in this series before: Introduction, Vectors 101, Geometrical Representation of Vectors, Operations on Vectors.

This cheat sheet will list several common geometrical problems found in games, and how to solve them with vector math.

## Complete list of basic vector operations

But first, a little review.

For this, I assume that you have a vector class readily available. This is mostly 2D-focused, but everything works the same for 3D, except for differences concerning vector product, which I will assume to return just a scalar in the 2D case, representing the “z” axis. Any case that only applies to 2D or 3D will be pointed out.

Strictly speaking, a point is not a vector – but a vector can be used to represent the distance from the origin (0, 0) to the point, and so, it is perfectly reasonable to just use vectors to represent positions as if they were points.

I expect the class to give you access to each of the components, and to the following operations (using C++ style notation, including operator overloading – but it should be easy to translate to any other language of your choice). If a given operation is not available, you can still do it manually, either by extending the class or creating a “VectorUtils” class. The examples below are usually for 2D vectors – but 3D is usually simply a matter of adding the z coordinate following the pattern of x and y.

Returns the sum of the two vectors. (In a language without operator overloading, this will probably be called add(). Similarly for the next few ones.)*Vector2f operator+(Vector2f vec):*

*a + b = Vector2f(a.x + b.x, a.y + b.y);*Returns the difference between the two vectors.*Vector2f operator-(Vector2f vec):Â*

*a – b = Vector2f(a.x – b.x, a.y – b.y);*Returns the component-wise multiplication of the vectors.*Vector2f operator*(Vector2f vec):Â*

*a * b = Vector2f(a.x * b.x, a.y * b.y);*Returns the component-wise division of the vectors.*Vector2f operator/(Vector2f vec):Â*

*a / b = Vector2f(a.x / b.x, a.y / b.y);*: Returns the vector with all components multiplied by the scalar parameter.*Vector2f operator*(float scalar)*

*a * s = Vector2f(a.x * s, a.y * s);*

s * a =*Vector2f(a.x * s, a.y * s);*Returns the vector with all components divided by the scalar parameter.:*Vector2f operator/(float scalar)*

*a / s = Vector2f(a.x / s, a.y / s);*: Returns the dot product between the two vectors.*float dot(Vector2f vec)*

*a.dot(b) = a.x * b.x + a.y * b.y;*: (2D case) Returns the z component of the cross product of the two vectors augmented to 3D.*float cross(Vector2f vec)*

*a.cross(b) = a.x * b.y – a.y * b.x;*: (3D case) Returns the cross product of the two vectors.*Vector3f cross(Vector3f vec)*

*a.cross(b) = Vector3f(a.y * b.z – a.z * b.y, a.z*b.x – a.x*b.z, a.x*b.y – a.y*b.x);*: Returns the length of the vector.*float length()*

*a.length() = sqrt(a.x * a.x + a.y * a.y);*Returns the square of the length of the vector. Useful when you just want to compare two vectors to see which is longest, as this avoids computing square roots**float squaredLength()**:

*a.squaredLength() = a.x * a.x + a.y * a.y;*: Returns a vector pointing on the same direction, but with a length of 1.*float unit()*

*a.unit() = a / a.length();*Returns the vector rotated 90 degrees left. Useful for computing normals. (Assumes that y axis points up, otherwise this is turnRight)**Vector2f turnLeft()**:

*a.turnLeft = Vector2f(-a.y, a.x);Â*Returns the vector rotated 90 degrees right. Useful for computing normals. (Assumes that y axis points up, otherwise this is turnLeft)**Vector2f turnRight()**:Â

*a.turnRight = Vector2f(a.y, -a.x);***Vector2f rotate(float angle)**: Rotates the vector by the specified angle. This is an extremely useful operation, though it is rarely found in Vector classes. Equivalent to multiplying by the 2×2 rotation matrix.

*a.rotate(angle) = Â Vector2f(a.x * cos(angle) – a.y * sin(angle), a.x * sin(angle) + a.y * cos(angle));*ReturnsÂ the angle that the vector points to.*float angle():Â*

*a.angle() = atan2(a.y, a.x);*

## Simple cases – warming up

### Case #01 – Distance between two points

You probably know that this is done with the Pythagorean theorem, but the vectorial way is simpler. Given two vectors *a* and *b*:

float distance = (a-b).length();

### Case #02 – Alignment

Sometimes, you want to align an image by its center. Sometimes, by its top-left corner. Or sometimes, by its top-center point. More generally, you can do alignment using a vector whose two components go from 0 to 1 (or even beyond, if you’d like), giving you full control of alignment.

// imgPos, imgSize and align are all Vector2f Vector2f drawPosition = imgPos + imgSize * align

### Case #03 – Parametric Line Equation

Two points define a line, but it can be tricky to do much with this definition. A better way to work with a line is its parametric equation: one point (“*P0″*) and a direction vector (“*dir”*).

Vector2f p0 = point1; Vector2f dir = (point2 - point1).unit();

With this, you can, for example, get a point 10 units away by simply doing:

Vector2f p1 = p0 + dir * 10;

### Case #04 – Midpoint and interpolation between points

Say you have vectors *p0* and *p1*. The midpoint between them is simply *(p0+p1)/2*. More generally, the line segment defined by *p0* and *p1*Â can be generated by varying *t* between 0 and 1 in the following linear interpolation:

Vector2f p = (1-t) * p0 + t * p1;

At *t = 0*, you get *p0; *at *t = 1*, you get *p1*; at *t = 0.5*, you get the midpoint, etc.

### Case #05 – Finding the normal of a line segment

You already know how to find the direction vector of a line segment (case #03). The normal vector is a 90 degree rotation of that, so just call *turnLeft()* or *turnRight()* on it!

## Projections using the Dot Product

The dot product has the incredibly useful property of being able to compute the length of a vector’s projection along the axis of another. To do this, you need the vector that you’ll project (“*a*“) and a unit vector (so make sure that you call *unit()* on it first!) representing the direction (“*dir*“). The length is then simply *a.dot(dir)*. For example, if you have *a = (3, 4)* and *dir = (1, 0)*, thenÂ *a.dot(dir) = 3*, and you can tell that this is correct, because (1, 0) is the direction vector of the x axis. In fact, *a.x* is always equivalent to *a.dot(Vector2f(1, 0))*, and *a.y* is equivalent to *a.dot(Vector2f(0, 1))*.

Because the dot product between *a*Â and *b*Â is also defined as *|a||b|cos(alpha)* (where alpha is the angle between the two), the result will be 0 if the two vectors are perpendicular, positive if the angle between them is less than 90, and negative if greater. This can be used to tell if two vectors point in the same general direction.

If you multiply the result of that dot product by the direction vector itself, you get the vector projected along that axis – let’s call that “*at*” (t for tangent). If you now do *a – at*, you get the part of the vector that is perpendicular to the *dir* vector – let’s call that “*an*” (n for normal). *at + an = a*.

### Case #06 – Determining direction closest to dir

Say that you have a list of directions represented as unit vectors, and you want to find which of them is the closest to *dir*. Simply find the largest dot product between *dir* and a vector in the list. Likewise, the smallest dot product will be the direction farthest away.

### Case #07 – Determining if the angle between two vectors is less than alpha

Using the equation above, we know that the angle between two vectors *a *and* b *will be less than alpha if the dot product between their unit vectors is less than cosine of alpha.

bool isLessThanAlpha(Vector2f a, Vector2f b, float alpha) { return a.unit().dot(b.unit()) < cos(alpha); }

### Case #08 – Determining which side of a half-plane a point is on

Say that you have an arbitrary point in space, *p0*, and a direction (unit) vector, *dir*. Imagine that an infinite line goes by *p0*, perpendicular to *dir*, dividing the plane in two, the half-plane that *dir*Â points to, and the half-plane that it does not point to. How do I tell whether a point *p* is in the side pointed to by *dir*? Remember that dot product is positive when the angle between vectors is less than 90 degrees, so just project and check against that:

bool isInsideHalfPlane(Vector2f p, Vector2f p0, Vector dir) { return (p - p0).dot(dir) >= 0; }

### Case #09 – Forcing a point to be inside a half-plane

Similar to the case above, but instead of just checking, we’ll grab the projection and, if less than 0, use it to move the object -projection along dir, so it’s on the edge of the half-plane.

Vector2f makeInsideHalfPlane(Vector2f p, Vector2f p0, Vector dir) { float proj = (p - p0).dot(dir); if (proj >= 0)Â return p; else return p - proj * dir; }

### Case #10 – Checking~~/forcing~~ a point inside a convex polygon

A convex polygon can be defined to be the intersection of several half-planes, one for each edge of the polygon. Their *p0* is either vertex of the edge, and their *dir* is the edge’s inner-facing normal vector (e.g., if you wind clockwise, that’d be the *turnRight()* normal). A point is inside the polygon if and only if it’s inside all the half-planes. ~~Likewise, you can force it to be inside the polygon (by moving to the closest edge) by applying the ~~Â [ops, this actually only works if all angles are >= 90 degrees]*makeInsideHalfPlane* algorithm with every half-plane.

### Case #11 – Reflecting a vector with a given normal

Pong-like game. Ball hits a sloped wall. You know the ball’s velocity vector and the wall’s normal vector (see case #05). How do you reflect it realistically? Simple! Just reflect the ball’s normal velocity, and preserve its tangential velocity.

Vector2f vel = getVel(); Vector2f dir = getWallNormal(); // Make sure this is a unit vector Vector2f velN = dir * vel.dot(dir); // Normal component Vector2f velT = vel - velN; // Tangential component Vector2f reflectedVel = velT - velN;

For more realism, you can multiply velT and velN by constants representing friction and restitution, respectively.

### Case #12 – Cancelling movement along an axis

Sometimes, you want to restrict movement in a given axis. The idea is the same as above: decompose in a normal and tangential speed, and just keep tangential speed. This can be useful, for example, if the character is following a rail.

## Rotations

### Case #13 – Rotating a point around a pivot

If used to represent a point in space, the *rotate()* method will rotate that point around the origin. That might be interesting, but is limiting. Rotating around an arbitrary *pivot* vector is simple and much more useful – simply subtract the *pivot* from it, as if translating so the origin IS the *pivot*, then rotate, then add the *pivot* back:

Vector2f rotateAroundPivot(Vector2f p, Vector2f pivot) { return (pos - pivot).rotate(angle) + pivot; }

### Case #14 – Determining which direction to turn towards

Say that you have a character that wants to rotate to face an enemy. He knows his direction, and the direction that he should be facing to be looking straight at the enemy. But should he turn left or right? The *cross* product provides a simple answer: *curDir.cross(targetDir)* will return positive if you should turn left, and negative if you should turn right (and 0 if you’re either facing it already, or 180 degrees from it).

## Other Geometric Cases

Here are a few other useful cases that aren’t that heavily vector-based, but useful:

### Case #15 – Isometric world to screen coordinates

Isometric game. You know where the (0, 0) of world is on the screen (let’s call that point *origin* and represent it with a vector), but how do you know where a given world (x, y) is on the screen? First, you need two vectors determining the coordinate base, a new x and y axes. For a typical isometric game, they can be *bx = Vector2f(2, 1)*Â and *by = Vector2f(-2, 1)Â *– They don’t necessarily have to be unit vectors. From now, it’s straightforward:

Vector2f p = getWorldPoint(); Vector2f screenPos = bx * p.x + by * p.y + origin;

Yes, it’s that simple.

### Case #16 – Isometric screen to world coordinates

Same case, but now you want to know which tile the mouse is over. This is more complicated. Since we know that *(x’, y’) = (x * bx.x + y * by.x, x * bx.y + y * by.y) + origin*, we can first subtract origin, and then solve the linear equation. Using Cramer’s Rule,Â except that we’ll be a little clever and use our 2D cross-product (see definition at the beginning of the article) to simplify things:

Vector2f pos = getMousePos() - origin; float demDet = bx.cross(by); float xDet = pos.cross(by); float yDet = bx.cross(pos); Vector2f worldPos = Vector2f(xDet / demDet, yDet / demDet);

And now you don’t need to do that ugly find-rectangle-then-lookup-on-bitmap trick that I’ve seen done several times before.

## Darcieethed

/ 2016-08-17ÐÑƒÐ¼ÐµÑ€Ð¾Ð»Ð¾Ð³Ð¸Ñ Ð¸Ð¼ÐµÐ½Ð¸ Ð¸ Ñ„Ð°Ð¼Ð¸Ð»Ð¸Ð¸ . Ð¡Ð¾Ð¾Ñ‚Ð²ÐµÑ‚ÑÑ‚Ð²ÑƒÐµÑ‚ Ð»Ð¸ Ð¼Ð¾Ñ‘ Ð¸Ð¼Ñ Ð¼Ð½Ðµ, Ð¼Ð¾ÐµÐ¼Ñƒ Ñ…Ð°Ñ€Ð°ÐºÑ‚ÐµÑ€Ñƒ? Ð“Ð°Ñ€Ð¼Ð¾Ð½Ð¸Ñ‡Ð½Ð° Ð»Ð¸

## GerardoseP

/ 2016-08-17Ð¡ÐµÐ·Ð¾Ð½ 14 , Ð²Ñ‹Ð¿ÑƒÑÐº 3, Ð¸ÑÐ¿Ñ‹Ñ‚Ð°Ð½Ð¸Ðµ 1. ÐŸÐµÑ€Ð²Ñ‹Ð¼ Ñ€Ð°ÑÐºÑ€Ñ‹Ñ‚ÑŒ Ð¸Ð½Ñ‚Ð¸Ð¼Ð½Ñ‹Ðµ Ñ‚Ð°Ð¹Ð½Ñ‹ ÑÑ‚Ð¸Ñ… ÑÐµÐ¼ÐµÐ¹ Ð¿Ð¾Ð¿Ñ€Ð¾Ð±ÑƒÐµÑ‚ 26-Ð»ÐµÑ‚Ð½Ð¸Ð¹

## Rachellor

/ 2016-08-17ÐšÐ°Ðº Ð¼Ð¾Ð¶Ð½Ð¾ Ðº Ð²Ð°Ð¼ Ð¿Ð¾Ð¿Ð°ÑÑ‚ÑŒ Ð² war z? imp21 Offline # 1. Ð”Ð°Ñ‚Ð°: Ð§Ñ‚, 29.11.2012, 22:12 :

## AyanaGape

/ 2016-08-17ÐŸÐ°ÑƒÑ‚Ð¸Ð½Ð° – 6. ÐÐµÐ²Ð¸Ð´Ð¸Ð¼Ñ‹Ðµ Ð½Ð¸Ñ‚Ð¸ 1 ÑÐµÑ€Ð¸Ñ ( 5 ÑÐµÑ€Ð¸Ñ) ÑÐ¼Ð¾Ñ‚Ñ€ÐµÑ‚ÑŒ Ð¾Ð½Ð»Ð°Ð¹Ð½ ÐŸÐ°ÑƒÑ‚Ð¸Ð½Ð° – 6. Ð¡Ð¾Ð½ Ñ€Ð°Ð·ÑƒÐ¼Ð° 2 ÑÐµÑ€Ð¸Ñ (10 ÑÐµÑ€Ð¸Ñ) ÑÐ¼Ð¾Ñ‚Ñ€ÐµÑ‚ÑŒ Ð¾Ð½Ð»Ð°Ð¹Ð½

## CharisseO

/ 2016-08-1701.06. 2014 Ð°Ð²Ñ‚Ð¾Ð¼Ð¾Ð±Ð¸Ð»ÑŒÐ½Ñ‹Ð¹ Ð³Ð¾Ñ€Ð¾ÑÐºÐ¾Ð¿ Ð°Ð²Ñ‚Ð¾ Ð¿Ð¾ Ð·Ð½Ð°ÐºÑƒ Ð·Ð¾Ð´Ð¸Ð°ÐºÐ° Ð¶ÐµÐ»Ñ‚Ð¾Ðµ Ñ‚Ð°ÐºÑÐ¸ Ð°Ð²Ñ‚Ð¾ Ð¼Ð°Ð·Ð´Ð° Ð³Ð¾Ñ€Ð¾ÑÐºÐ¾Ð¿ Ð´Ð»Ñ Ð²Ð¾Ð´Ð¸Ñ‚ÐµÐ»ÐµÐ¹ Ð¶ÐµÐ»Ñ‚Ð°Ñ Ð¼Ð°ÑˆÐ¸Ð½Ð° Ñ‚Ð°ÐºÑÐ¸ ÐžÐ²ÐµÐ½. . Ð§Ñ‚Ð¾ Ð·Ð° Ñ€ÑƒÐ»ÐµÐ¼ Ð²ÐµÑÑ‹ â€“ Ð½Ð°ÑÑ‚Ð¾ÑÑ‰Ð¸Ðµ Ð°ÑÑÑ‹, Ð° Ð¿Ð¾Ñ‚Ð¾Ð¼Ñƒ ÑÐ¾Ð·Ð´Ð°Ð²Ð°Ñ Ð°Ð²Ð°Ñ€Ð¸Ð¹Ð½Ñ‹Ðµ

## Saminpurse

/ 2016-08-17Previous Entry · Ð’ Ð¸Ð·Ð±Ñ€Ð°Ð½Ð½Ð¾Ðµ · ÐŸÐ¾Ð´ÐµÐ»Ð¸Ñ‚ÑŒÑÑ Ñ‡Ð°ÑÐ° Ð·Ð° Ñ‚Ñ€Ð¸ Ð´Ð¾ Ð¼ÐµÐ½Ñ Ð´Ð°Ð¼Ð¾Ñ‡ÐºÐ° Ð¿Ð¾ÑÑ‚Ð±Ð°Ð»ÑŒÐ·Ð°ÐºÐ¾Ð²ÑÐºÐ¾Ð³Ð¾ Ð²Ð¾Ð·Ñ€Ð°ÑÑ‚Ð° . . Ð¢Ð°Ñ€Ð¾ Ð¡Ñ‡Ð°ÑÑ‚ÑŒÐµ Ð¢Ð°Ñ€Ð¾ Ð£Ð”ÐÐ§Ð Ð£Ð¿Ñ€Ð°Ð²Ð»ÐµÐ½Ð¸Ðµ Ð»ÑŽÐ´ÑŒÐ¼Ð¸ Ð¥Ð¸Ñ€Ð¾Ð¼Ð°Ð½Ñ‚Ð¸Ñ Ð°Ð¼ÑƒÐ»ÐµÑ‚Ñ‹ Ð°Ñ€Ð¾Ð¼Ð°Ñ‚Ñ‹ Ð±ÐµÐ»ÑŒÐµ Ð±Ð»Ð°Ð³Ð¾Ð²Ð¾Ð½Ð¸Ðµ Ð±Ð¾Ð³Ð°Ñ‚ÑÑ‚Ð²Ð¾ Ð±Ð¾Ð»ÐµÐ·Ð½Ð¸ Ð±Ñ€Ð°Ðº Ð±Ñ€Ð¸Ð»Ð»Ð¸Ð°Ð½Ñ‚ Ð²Ð¾Ð·Ð´ÐµÐ¹ÑÑ‚Ð²Ð¸Ñ Ð³Ð°Ð´Ð°Ð½Ð¸Ðµ Ð´ÐµÐ²ÑƒÑˆÐºÐ° Ð¶ÐµÐ»Ð°Ð½Ð¸Ðµ Ð¶ÐµÐ½Ñ‰Ð¸Ð½Ñ‹

## KathleenP

/ 2016-08-1718 Ñ‡. Ð½Ð°Ð·Ð°Ð´ Ð¦Ð¸Ñ„Ñ€Ð¾Ð²Ð¾Ð¹ Ð¼Ð°Ð³Ð°Ð·Ð¸Ð½: â€” epic.kanobu.ru; ÐžÐ½Ð»Ð°Ð¹Ð½ -Ð¸Ð³Ñ€Ñ‹: â€” games.kanobu.ru; AG. ru Ð¡Ñ‚Ð°Ñ€Ñ‹Ð¹ ÐºÐ¾Ð½Ñ‚Ñ€Ð°Ð±Ð°Ð½Ð´Ð¸ÑÑ‚ Ð”Ð¶Ð¾ÑÐ» Ð²ÐµÐ´ÐµÑ‚ Ð¶Ð¸Ð·Ð½ÑŒ Ð¾Ñ‚ÑˆÐµÐ»ÑŒÐ½Ð¸ÐºÐ°, Ñ€Ð°Ð´ÑƒÑÑÑŒ ÐºÐ°Ð¶Ð´Ð¾Ð¹ Ryse: Son of Rome Ð²Ð¾ÑˆÐµÐ» Ð² ÑÑ‚Ð°Ñ€Ñ‚Ð¾Ð²ÑƒÑŽ Ð»Ð¸Ð½ÐµÐ¹ÐºÑƒ Ð¸Ð³Ñ€ Ð´Ð»Ñ Xbox One, Ð²ÑÑ‚Ð°Ð² . Watch Dogs ÑÐ²ÑÐ·Ð°Ð½Ð° Ñ Assassin’s Creed ÑÐ¸Ð»ÑŒÐ½ÐµÐµ, Ñ‡ÐµÐ¼ ÐºÐ°Ð¶ÐµÑ‚ÑÑ

## Wanequatte

/ 2016-08-20Ð”Ð¾Ð²Ð¾Ð»ÑŒÐ½Ð¾ Ñ‡Ð°ÑÑ‚Ð¾ Ð¼Ñ‹ Ð²Ð¸Ð´Ð¸Ð¼ Ð²Ð¾ ÑÐ½Ðµ Ð¿Ñ€ÐµÐ´ÑÑ‚Ð°Ð²Ð¸Ñ‚ÐµÐ»ÐµÐ¹ Ð²Ð¾Ð´Ð½Ð¾Ð¹ ÑÑ€ÐµÐ´Ñ‹, Ñ€Ð°Ð·Ð½Ð¾Ð³Ð¾ Ñ€Ð¾Ð´Ð° Ñ€Ñ‹Ð±. Ð¡Ð¸Ñ‚ÑƒÐ°Ñ†Ð¸Ð¸ Ð¼Ð¾Ð³ÑƒÑ‚ Ð±Ñ‹Ñ‚ÑŒ Ñ€Ð°Ð·Ð½Ñ‹Ðµ, Ð¼Ñ‹ Ð¼Ð¾Ð¶ÐµÐ¼ Ð»Ð¾Ð²Ð¸Ñ‚ÑŒ

## central govt jobs

/ 2016-08-23Good post

## IraMyncgync

/ 2016-08-24ÐžÐ½ Ð²Ð¸Ð´Ð¸Ñ‚, Ñ‡Ñ‚Ð¾ Ð¼Ð¾Ð¸ Ð¿Ð¾Ð»Ð¸Ñ‚Ð¸Ñ‡ÐµÑÐºÐ¸Ðµ Ð¿Ñ€Ð¸ÑÑ‚Ñ€Ð°ÑÑ‚Ð¸Ñ Ð½Ðµ Ð¾Ñ‚Ñ€Ð°Ð¶Ð°ÑŽÑ‚ÑÑ Ð½Ð° Ñ€Ð°Ð±Ð¾Ñ‚Ðµ ÐºÐ¾Ð»Ð»ÐµÐºÑ‚Ð¸Ð²Ð° , Ð° Ñ Ð·Ð½Ð°ÑŽ, Ñ‡Ñ‚Ð¾ Ð¾Ð½ Ð½Ðµ Ð¸Ð· Ñ‚ÐµÑ…, ÐºÑ‚Ð¾ Ð¶Ð¸Ð²Ñ‘Ñ‚ Ð½Ð° Ð´ÐµÐ½ÑŒÐ³Ð¸

## Examhelpline

/ 2016-08-30Nice information . Thank for sharing article …

Examhelpline

## Keishafug

/ 2016-08-31Ð›ÐµÐ¾Ð½Ð¸Ð´ Ð—Ð²Ð°Ð²Ð¸Ñ‡ , Ð•Ð²Ð³ÐµÐ½Ð¸Ð¹ ÐŸÐ¾Ñ‚Ð¾ÑÐºÑƒÐµÐ² – Ð“ÐµÐ¾Ð¼ÐµÑ‚Ñ€Ð¸Ñ . 10 ÐºÐ»Ð°ÑÑ . ÐœÐµÑ‚Ð¾Ð´Ð¸Ñ‡ÐµÑÐºÐ¾Ðµ Ð¿Ð¾ÑÐ¾Ð±Ð¸Ðµ Ð¿Ñ€Ð¸Ð·Ð²Ð°Ð½Ð¾ Ð¿Ð¾Ð¼Ð¾Ñ‡ÑŒ ÑƒÑ‡Ð¸Ñ‚ÐµÐ»ÑŽ Ð² Ñ€Ð°Ð±Ð¾Ñ‚Ðµ Ð¿Ð¾ ÐºÐ¾Ð¼Ð¿Ð»ÐµÐºÑÑƒ, ÑÐ¾ÑÑ‚Ð¾ÑÑ‰ÐµÐ¼Ñƒ Ð¸Ð·

## Free Job Alert

/ 2016-09-02Nice information of this post.

## sarkari result

/ 2016-09-02Good Stuff, Very Useful….

## Kasandrakek

/ 2016-09-03ÑÐºÐ°Ñ‡Ð°Ñ‚ÑŒ Ð±ÐµÑÐ¿Ð»Ð°Ñ‚Ð½Ð¾ ÐºÐ½Ð¸Ð³Ð¸, Ð§Ð°ÑÑ‚ÑŒ i – cÐ¾Ð´ÐµÑ€Ð¶Ð¸Ñ‚ Ð”ÐŸÐ – 2014 . 11 ÐºÐ»Ð°ÑÑ .

## HAPPY DIWALI RANGOLI

/ 2016-09-10Thatâ€™s the reason we have come up with a separate post on Diwali Wallpapers 2016 HD so that you can easily download the wallpapers for Diwali without any hassles. Do check them out now!

## Saddam

/ 2016-09-26Awesome Post..

Free Download Source Code Web development and Web Designing!!

Source Code Downlad Nw

## gujarat vanrakshak merit list

/ 2016-11-24Awesome Post..

## ojas

/ 2016-11-24Nice Post And All Are Right Thanks for giveing this information

## railway recruitment 2017

/ 2016-12-16hi, i was used to read your articles thanks for all details.

## NormanSow

/ 2017-01-13My brother suggested I would possibly like this blog. He used to be entirely right. This submit actually made my day. You cann’t believe just how a lot time I had spent for this info! Thank you!

## suresh

/ 2017-01-25The information from this post is very helpful for me and good work. Thank you for the information.

ntruhs results

## ntruhs results

/ 2017-01-25The information from this post is very helpful for me and good work. Thank you for the information.

ntruhs results

## Digital Marketing course in Janakpuri

/ 2017-01-31Are you looking for Digital Marketing Institute in Janakpuri East? Digital Paanda providing SEO, SMO, PPC, blogging with affordable prices. Book a demo now.

## Sunny Leone HD Wallpapers

/ 2017-02-02sunny leone hd wallpapers sunny leone bikini pics images photos and upcoming pictures in bollywood.

## ojasbhartiresult

/ 2017-02-10nice information sir.

## Jamesthisy

/ 2017-02-15ÐŸÐ¾Ñ€ÑÐ´Ð¾Ñ‡Ð½Ñ‹Ðµ Ð¶ÐµÐ½Ñ‰Ð¸Ð½Ñ‹ Ð¸Ð·Ð¼ÐµÐ½ÑÑŽÑ‚ Ð½Ðµ Ð¼ÑƒÐ¶Ñƒ, Ð° ÐµÐ³Ð¾ Ð¿Ñ€ÐµÐ´ÑÑ‚Ð°Ð²Ð»ÐµÐ½Ð¸ÑÐ¼ Ð¾ Ð¿Ð¾Ñ€ÑÐ´Ð¾Ñ‡Ð½Ð¾ÑÑ‚Ð¸.

## RobertQG

/ 2017-02-15Ð’ Ð¿ÐµÑ€ÐµÐ»Ð¾Ð¼Ð½Ñ‹Ðµ Ð²Ñ€ÐµÐ¼ÐµÐ½Ð° Ð¶Ð¸Ð·Ð½ÑŒ ÑÑ‚Ð°Ð½Ð¾Ð²Ð¸Ñ‚ÑÑ Ñ‚Ñ€Ð°Ð²Ð¼Ð¿ÑƒÐ½ÐºÑ‚Ð¾Ð¼.

## SXGary

/ 2017-02-15ÐžÐ´Ð½Ð¾Ð¹ Ð¿Ð¾Ð´Ð¼Ð¾Ñ‡ÐµÐ½Ð½Ð¾Ð¹ Ñ€ÐµÐ¿ÑƒÑ‚Ð°Ñ†Ð¸ÐµÐ¹ Ð½Ðµ ÑƒÑ‚Ð¾Ð»Ð¸Ñ‚ÑŒ Ð²ÑÐµÐ¹ Ð¶Ð°Ð¶Ð´Ñ‹ Ð²Ð»Ð°ÑÑ‚Ð¸.

## CBSE 10th Result

/ 2017-02-23I posted this article to my favorites and intend to return to for more outstanding articles.

## OJAS

/ 2017-03-03Nice Sire

## Ojas

/ 2017-03-04Very nice article read some more information

## GovtJobs2017

/ 2017-03-24This post was filled with good information.

## Abcya Games

/ 2017-04-02Thanks for your post. I hope you will update the article regularly

## ojas bharti

/ 2017-04-03super and energetic stuff you have provided here. I am really impressed

## abcya

/ 2017-04-24Thanks for your article, it gave me a lot of new and useful information. Hope you have more posts to share with everyone!

## usps tracking

/ 2017-05-22Thank you for sharing this article with us! I believe there will be more people like me, they can find many interesting things in this article of you!

## Fihjksrblp

/ 2017-05-28Ð”Ð¶ÐµÐ½ÐµÑ€Ð¸ÐºÐ¸ Ð¸Ð·Ð²ÐµÑÑ‚Ð½Ñ‹Ñ… ÑÐµÐºÑ ÑÑ‚Ð¸Ð¼ÑƒÐ»ÑÑ‚Ð¾Ñ€Ð¾Ð² Ð¿Ð¾ ÑÐ°Ð¼Ñ‹Ð¼ Ð½Ð¸Ð·ÐºÐ¸Ð¼ Ñ†ÐµÐ½Ð°Ð¼

## Latest Private Jobs

/ 2017-05-29Thank You so much for sharing this information with it’s really very useful for me.

## Government Jobs Updates

/ 2017-07-01Great information.

## Latest Govt Jobs

/ 2017-07-01Very nice article that is mentioned on this page.

## usps tracking

/ 2017-07-12A great blog, I will share it with my friends, thanks for your valuable posts

## twitter search

/ 2017-07-22Thank your site! information your share is useful to me!

## achika

/ 2017-07-22this is grate information

## RPSC Mock Test

/ 2017-08-05Awesome post thanks for it.

## usps tracking

/ 2017-08-07I found a lot of interesting information here. A really good post, very thankful and hopeful that you will write many more posts like this one.

## vex 3

/ 2017-08-09Thanks for your post! Through your pen I found the problem up interesting! I believe there are many other people who are interested in them just like me! Thanks your shared!… I hope you will continue to have similar posts to share with everyone! I believe a lot of people will be surprised to read this article!

## RPSC Mock Test

/ 2017-08-18Such an amazing post.

## Govt Jobs Point

/ 2017-10-05Really nice tips & formulas for programming students.

## Ashu

/ 2017-10-11You Can Check Here All University Time Table 2018