Search results for " Graphics"

An efficient distributed algorithm for generating and updating multicast trees

2006

As group applications are becoming widespread, efficient network utilization becomes a growing concern. Multicast transmission represents a necessary lower network service for the wide diffusion of new multimedia network applications. Multicast transmission may use network resources more efficiently than multiple point-to-point messages; however, creating optimal multicast trees (Steiner Tree Problem in networks) is prohibitively expensive. This paper proposes a distributed algorithm for the heuristic solution of the Steiner Tree Problem, allowing the construction of effective distribution trees using a coordination protocol among the network nodes. Furthermore, we propose a novel distribut…

Extended constrained deformations: a new sculpturing tool

1999

Modelling tools tend to virtual sculpturing, in which a basic object is deformed by user supplied actions. The model we present aims to be generic: whatever the geometric description of the object, we can deform it to satisfy location constraints. Our model deforms the whole space, the image of a point is a blend of deformation functions with a projection matrix which allows the satisfaction of the constraints. The user can define the extent of the deformation (i.e. the part of the object to be deformed), the shape of the deformation function to create profiles and the displacement of the constraint points to be satisfied.

V I G — A Visual and Dynamic Decision Support System for Multiple Objective Linear Programming

1989

In this paper we describe the principles of VIG (Visual Interactive Goal Programming), a Multiple Criteria Decision Support System, recently developed by Korhonen. PARETO RACE is a corner-stone of this system, which is designed to support both the modelling and solving of a multiple objective linear programming problem. The interface is based on one main menu, spreadsheets, and interactive use of computer graphics. VIG provides the decision-maker with the possibility to approach his/her decision problem by using an “evolutionary approach”. This means that the decision-maker does not have to specify the model precisely prior to solving the problem. In fact, the model evolves progressively. W…

Dynamic graphics in Excel for teaching statistics: understanding the probability density function

2011

In this article, we show a dynamic graphic in Excel that is used to introduce an important concept in our subject, Statistics I: the probability density function. This interactive graphic seeks to facilitate conceptual understanding of the main aspects analysed by the learners.

Performance improvements of real-time crowd simulations

2010

The current challenge for crowd simulations is the design and development of a scalable system that is capable of simulating the individual behavior of millions of complex agents populating large scale virtual worlds with a good frame rate. In order to overcome this challenge, this thesis proposes different improvements for crowd simulations. Concretely, we propose a distributed software architecture that can take advantage of the existing distributed and multi-core architectures. In turn, the use of these distributed architectures requires partitioning strategies and workload balancing techniques for distributed crowd simulations. Also, these architectures allow the use of GPUs not only fo…

Interaction with Information Graphics: A Content-Based Approach

2009

Understanding information graphics rely on thought process of graphics' reader, and thinking has the most important role in interpretation and exploitation. We are interested in the cognitive mechanisms underlying interaction with information graphics. In this study, we studied those cognitive processes which are employed when interacting with information graphics. Based on these experiments, we have separated four different types of thought processes which occur during the interactions with information graphics. We propose that these thought processes are apperception, restructuring, reflection and construction.

Computer graphics for quantum computation

2008

Stereopsis assessment at multiple distances with an iPad application

2017

[EN] We present a new application for iPad for screening stereopsis at multiple distances that allows testing up to ten levels of stereoacuity at each distance. Our approach is based on a random dot stereogram viewable with anaglyph spectacles. Sixty-five subjects with no ocular diseases, wearing their habitual correction were measured at 3 m and 0.5 m. Results were compared with a standard stereoscopic test (TNO). We found not statistically significant differences between both tests, but our method achieved higher reproducibility. Applications in visual screening programs and to design and use of 3D displays, are suggested. (C) 2017 Elsevier B.V. All rights reserved.

Representation of NURBS surfaces by Controlled Iterated Functions System automata

2019

Iterated Function Systems (IFS) are a standard tool to generate fractal shapes. In a more general way, they can represent most of standard surfaces like Bézier or B-Spline surfaces known as self-similar surfaces. Controlled Iterated Function Systems (CIFS) are an extension of IFS based on automata. CIFS are basically multi-states IFS, they can handle all IFS shapes but can also manage multi self-similar shapes. For example CIFS can describe subdivision surfaces around extraordinary vertices whereas IFS cannot. Having a common CIFS formalism facilitates the development of generic methods to manage interactions (junctions, differences...) between objects of different natures.This work focuses…

Parallelizing Epistasis Detection in GWAS on FPGA and GPU-Accelerated Computing Systems

2015

This is a post-peer-review, pre-copyedit version of an article published in IEEE - ACM Transactions on Computational Biology and Bioinformatics. The final authenticated version is available online at: http://dx.doi.org/10.1109/TCBB.2015.2389958 [Abstract] High-throughput genotyping technologies (such as SNP-arrays) allow the rapid collection of up to a few million genetic markers of an individual. Detecting epistasis (based on 2-SNP interactions) in Genome-Wide Association Studies is an important but time consuming operation since statistical computations have to be performed for each pair of measured markers. Computational methods to detect epistasis therefore suffer from prohibitively lon…