Difference between revisions of "10th Floor/programming"
Corey Angus (talk | contribs) (→Collision: sphere to rectangle collision) |
Corey Angus (talk | contribs) (map) |
||
| Line 1: | Line 1: | ||
| + | {{GAM666/DPS901 Index | 20103}} | ||
| + | |||
=Collision= | =Collision= | ||
'''Sphere to Sphere Collision ''' | '''Sphere to Sphere Collision ''' | ||
| Line 29: | Line 31: | ||
</pre> | </pre> | ||
**that's the basic idea. Depending on the direction the sphere is moving you'll have to add or subtract the radius from the comparision, otherwise collision will only be true when half or more of the sphere is within the rectangle. | **that's the basic idea. Depending on the direction the sphere is moving you'll have to add or subtract the radius from the comparision, otherwise collision will only be true when half or more of the sphere is within the rectangle. | ||
| + | ==Map== | ||
| + | *Will be stored as a 2D array as there is currently no plans for vertical movement. | ||
| + | **Each index will refer to the type of tile to be places. | ||
| + | ***eg 1 = wall, 0 = floor, 2 = hole | ||
| + | **Can easily be edited in notepad | ||
| + | **Example, a room with a south-east entrance, a hallway, and a north exit | ||
| + | <pre style="display: inline-block;"> | ||
| + | 111111111111100000000000111111111111 | ||
| + | 111111111111100000000000111111111111 | ||
| + | 111111111111100000000000111111111111 | ||
| + | 111111111111100000000000111111111111 | ||
| + | 111111111111100000000000111111111111 | ||
| + | 111111111111100000000000111111111111 | ||
| + | 111111111111100000000000111111111111 | ||
| + | 111111111111100000000000111111111111 | ||
| + | 111111111000000000000000000011111111 | ||
| + | 100000000000000000000000000000000001 | ||
| + | 100000000000000000000000000000000001 | ||
| + | 100000000000000000000000000000000001 | ||
| + | 111111111111111111111100000000000001 | ||
| + | 111111111111111111111100000000000001 | ||
| + | </pre> | ||
Latest revision as of 16:10, 8 October 2010
GAM666/DPS901 | Weekly Schedule | Student List | Project Requirements | Teams and their Projects | Student Resources
Collision
Sphere to Sphere Collision
- Each sphere is described by an x and y co-ordinate located in the very center, as well as a radius.
- If the distance between each sphere is less than the sum of their radius's, then a collision has occurred.
int collision_sphere (x_sphere1, y_sphere1, r_sphere1, x_sphere2, y_sphere2, r_sphere2){
int collision = 0;
double distance = √(x_sphere1 - x_sphere2)² + (y_sphere1 - y_sphere2)²; // calculate distance
if ((r_sphere1 + r_sphere2) > distance){ // compare to sum of radius
collsion = 1;
}
return collsion;
}
Sphere to Rectangle Collision
- Sphere is still describes as above. x, y, and radius.
- Rectangles described as x, y from bottom left corner. As well as width and height.
- If the value of the sphere's x and y is between the rectangles borders + the radius of the sphere, collision has occurred.
int collision_sphere_rect (x_sphere, y_sphere, r_sphere, x_rect, y_rect, w_rect, h_rect){
int collision = 0;
if ( (x_sphere > x_rect) && (x_sphere < (x_rect + w_rect) ){ //potential collision, sphere between rectangle borders on x axis
if ( (y_sphere > y_rect) && (y_sphere < (y_rect + h_rect) ){ //confirmed collision, sphere also between rectangle borders on y axis
collision = true;
}
}
return collsion;
}
- that's the basic idea. Depending on the direction the sphere is moving you'll have to add or subtract the radius from the comparision, otherwise collision will only be true when half or more of the sphere is within the rectangle.
Map
- Will be stored as a 2D array as there is currently no plans for vertical movement.
- Each index will refer to the type of tile to be places.
- eg 1 = wall, 0 = floor, 2 = hole
- Can easily be edited in notepad
- Example, a room with a south-east entrance, a hallway, and a north exit
- Each index will refer to the type of tile to be places.
111111111111100000000000111111111111 111111111111100000000000111111111111 111111111111100000000000111111111111 111111111111100000000000111111111111 111111111111100000000000111111111111 111111111111100000000000111111111111 111111111111100000000000111111111111 111111111111100000000000111111111111 111111111000000000000000000011111111 100000000000000000000000000000000001 100000000000000000000000000000000001 100000000000000000000000000000000001 111111111111111111111100000000000001 111111111111111111111100000000000001
