1 November 2014 in PRESENCE: Virtual and Augmented Reality
Manipulation is one of the most important tasks required in virtual environments and thus it has been thoroughly studied for widespread input devices such as mice or multi-touch screens. Nowadays, the Kinect sensor has turned mid-air interaction into another affordable and popular way of interacting. Mid-air interaction enables the possibility of interacting remotely without any physical contact and in a more natural manner. Nonetheless, although some scattered manipulation techniques have been proposed for mid-air interaction, there is a lack of evaluations and comparisons that hinders the selection and development of these techniques. To solve this issue, we gathered four design choices that can be used to classify mid-air manipulation techniques. Namely, choices are based on the required number of hands, separation of translation–rotation, decomposition of rotation, and interaction metaphors. Furthermore, we developed, adapted, and compared three manipulation techniques selected for studying the implications of the design choices. These implications are useful to select among already existing techniques as well as to inform technique developers.
1 January 1995 in IEEE Transactions on Parallel and Distributed Systems
Many parallel algorithms use hypercubes as the communication topology among their processes. When such algorithms are executed on hypercube multicomputers the communication cost is kept minimum since processes can be allocated to processors in such a way that only communication between neighbor processors is required. However, the scalability of hypercube multicomputers is constrained by the fact that the interconnection cost-per-node increases with the total number of nodes. From scalability point of view, meshes and toruses are more interesting classes of interconnection topologies. This paper focuses on the execution of algorithms with hypercube communication topology on multicomputers with mesh or torus interconnection topologies. The proposed approach is based on looking at different embeddings of hypercube graphs onto mesh or torus graphs. The paper concentrates on toruses since an already known embedding, which is called standard embedding, is optimal for meshes. In this paper, an embedding of hypercubes onto toruses of any given dimension is proposed. This novel embedding is called xor embedding. The paper presents a set of performance figures for both the standard and the xor embeddings and shows that the latter outperforms the former for any torus. In addition, it is proven that for a one-dimensional torus (a ring) the xor embedding is optimal in the sense that it minimizes the execution time of a class of parallel algorithms with hypercube topology. This class of algorithms is frequently found in real applications, such as FFT and some class of sorting algorithms.
1 January 2004 in Lecture Notes in Computer Science
1 February 1998 in Parallel Computing
1 January 2004 in Lecture Notes in Computer Science