Interactive character posing with efficient collision handling

2020 ◽  
Vol 31 (3) ◽  
Author(s):  
Jongmin Kim ◽  
Yeongho Seol ◽  
Hoemin Kim ◽  
Taesoo Kwon
Keyword(s):  
2011 ◽  
Vol 5 (4) ◽  
pp. 341 ◽  
Author(s):  
S. Jung ◽  
M. Hong ◽  
M.-H. Choi

Author(s):  
Manas Ranjan Lenka ◽  
Amulya Ratna Swain ◽  
Biraja Prasad Nayak

In Wireless Sensor Networks(WSNs), collision handling during transmission of data is an important challenge. MAC protocol plays a vital role in handling those collisions. Among different types of MAC protocols, schedule based MAC protocol is one where a valid schedule is prepared to handle the collision. The existing schedule based MAC protocols focus on preparing either a feasible schedule or an optimal schedule. In order to satisfy both feasibility as well as optimality feature, in this paper, we proposed a hybrid approach for slot scheduling that prepares a feasible schedule in a distributed manner and at the same time reduces the number of feasible schedule to achieve optimality. In this paper, we named this algorithm as Distributed hybrid Slot Scheduling(DHSS) algorithm. The proposed DHSS algorithm initially prepares a feasible schedule which is furthertuned in quick time to prepare a valid schedule with a reducednumber of slots. The reduction of the number of slots in theschedule improves the efficiency of data transmission in termsof latency. The simulation results show that the DHSS algorithmoutperforms RD-TDMA with respect to both the number of slotsallotted for a feasible schedule as well as the data transmissionlatency.


2015 ◽  
Vol 34 (4) ◽  
pp. 1-9 ◽  
Author(s):  
Matthias Müller ◽  
Nuttapong Chentanez ◽  
Tae-Yong Kim ◽  
Miles Macklin
Keyword(s):  

Symmetry ◽  
2020 ◽  
Vol 12 (8) ◽  
pp. 1302
Author(s):  
Min Gyu Choi

This paper presents two practical methods for computing the closest approach distance of two ellipsoids in their inter-center direction. The closest approach distance is crucial for collision handling in the dynamic simulation of rigid and deformable bodies approximated with ellipsoids. To find the closest approach distance, we formulate a set of equations for two ellipsoids contacting each other externally in terms of the inter-center distance, contact point, and normal vector. The equations are solved robustly and efficiently using a hybrid of the fixed-point iteration method and bisection method with root bracketing, and a hybrid of Newton’s method and the bisection method. In addition to a stopping criterion expressed with the progress of the solution, we introduce a novel criterion expressed in terms of the error in distance. This criterion can be effectively employed in real-time applications such as computer games by allowing an unnoticeable error. Experimental results demonstrate the robustness and efficiency of the proposed methods in various experiments.


2009 ◽  
Vol 13 (4) ◽  
pp. 451-457 ◽  
Author(s):  
V. Garcia-Perez ◽  
E. Munoz-Moreno ◽  
S. Aja-Fernandez ◽  
C. Alberola-Lopez

Sign in / Sign up

Export Citation Format

Share Document