This thesis covers the development process of implementation, and evaluation of a softbody physics engine for convex polygon objects. The main feature is implementation of adynamic polygon collider that represents a polygons shape correctly, while still being ableto collide with other objects in the simulation. Objects are able to deform both temporarily and permanently using springs with distance constraints. Pressure simulation is alsoimplemented to simulate inflated polygons. The physics bodies does not feature frictionbetween objects, only friction against a static boundary of the simulation. The engine isthen evaluated in order to determine if it can run in real-time which is one of the goals.When it comes to the simulation, Verlet-integration will be used for updating the positions of particles, and every polygon will be built using these particles, and combinedusing certain constraints to make the particles act as one combined object. The main problem that will be solved is the interpenetration solver, which ensures that polygons do notoverlap, and two formulas will be combined to solve this problem. The collision detectionmethod uses line intersections to determine if objects are overlapping, this method endedup being quite expensive for polygons with a lot of vertices. One optimization techniqueis implemented which is axis-aligned bounding boxes around objects which improvedperformance significantly, which also makes the engine more viable for real-time simulations. The physics engine in this report is deterministic using a fixed time-step, dynamictime-step is not tested. The engine also only supports discrete collision detection.

This MSc Thesis focuses on the collision detection between scene objects and consequent resolution of such collisions on the basis of physical model. The implementation of all the applications and algorithms is achieved in Win32 environment in Visual Studio using the programming language C++; it also employs the graphical library Open Inventor based on OpenGL. The work also includes additional application for the calculation of physical values. The demo applications involve algorithms for detection and resolution of explosive collision by the use of a simple and physical reflection on the basis of physical formulas and relationships. The main demo application called "tunnel transit" incorporates a simple game engine. The thesis also includes a discussion over the aroused problems with collision solving and some suggestions how to overcome them.

Over the past few decades, wireless local area networks (WLANs) have been widely deployed for data communication in indoor environments such as offices, houses, and airports. In order to fairly and efficiently use the unlicensed frequency band that Wi-Fi devices share, the devices follow a set of channel access rules, which is called a wireless medium access control (MAC) protocol. It is known that wireless devices following the 802.11 standard MAC protocol, i.e. the distributed coordination function (DCF), suffer from packet collisions when multiple nodes simultaneously transmit. This significantly degrades the throughput performance. Recently, several studies have reported access techniques to reduce the number of packet collisions and to achieve a collision free WLAN. Although these studies have shown that the number of collisions can be reduced to zero in a simple way, there have been a couple of remaining issues to solve, such as dynamic parameter adjustment and fairness to legacy DCF nodes in terms of channel access opportunity. Recently, In-Band Full Duplex (IBFD) communication has received much attention, because it has significant potential to improve the communication capacity of a radio band. IBFD means that a node can simultaneously transmit one signal and receive another signal in the same band at the same time. In order to maximize the performance of IBFD communication capability and to fairly share access to the wireless medium among distributed devices in WLANs, a number of IBFD MAC protocols have been proposed. However, little attention has been paid to fairness issues between half duplex nodes (i.e. nodes that can either transmit or receive but not both simultaneously in one time-frequency resource block) and IBFD capable nodes in the presence of the hidden node problem.