1-D, 2-D and 3-D Interpolation Tools for Max/MSP/Jitter

نویسندگان

  • Todor Todoroff
  • Loïc Reboursière
چکیده

We propose new tools for interpolation in 1-D, 2-D and 3-D spaces. They were developed for the ”Dancing Viola” project within the Numediart program and will be freely downloadable from www.numediart.org. The 1-D and 2-D representations work in Max/MSP using the LCD or jit.window objects, while the 3-D one requires Jitter. They introduce new features specially designed for interactive performances with sensor data. This includes the definition of areas centered on the interpolation points where the weights stay constant and different input messages for mouse actions and sensor inputs that offer the possibility of moving interpolation points with the mouse while receiving sensor data. This allows to tune the setup while receiving performer’s data during rehearsals. But interpolation points may equally be moved and resized with Max messages, leading to a less usual way of increasing the input dimensionality by allowing sensors to move interpolation points, effectively modifying the interpolation space.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Developing Tools for Studying Musical gestures within the Max/MSP/jitter Environment

We present the Musical Gestures Toolbox, a collection of Max/MSP/Jitter modules to help in qualitative and quantitative analysis of musical gestures. Examples are shown of how the toolbox is used for studying musical mimicry, such as ”air piano” performance, and expressive gestures of musicians.

متن کامل

A Real-Time Human Body Skeletonization Algorithm For Max/Msp/Jitter

In this paper we present an algorithm for real–time fullbody skeletonization and visualization implemented as two external objects for Max/MSP/Jitter. These objects are intended to provide an accurate description of bodily motion as captured by a video camera, to be used as musical rhythm controller in interactive music systems.

متن کامل

Approximating Steiner Trees and Forests with Minimum Number of Steiner Points

Let R be a finite set of terminals in a metric space (M,d). We consider finding a minimum size set S ⊆ M of additional points such that the unit-disc graph G[R ∪ S] of R ∪ S satisfies some connectivity properties. In the Steiner Tree with Minimum Number of Steiner Points (ST-MSP) problem G[R ∪ S] should be connected. In the more general Steiner Forest with Minimum Number of Steiner Points (SF-M...

متن کامل

Partitioning a Polygon into Two Mirror Congruent Pieces

Polygon decomposition problems are well studied in the literature [6], yet many variants of these problems remain open. In this paper, we are interested in partitioning a polygon into mirror congruent pieces. Symmetry detection algorithms solve problems of the same flavor by detecting all kinds of isometries in a polygon, a set of points, a set of line segments and some classes of polyhedra [2]...

متن کامل

Optimal Choice of Random Variables in D-ITG Traffic Generating Tool using Evolutionary Algorithms

Impressive development of computer networks has been required precise evaluation of efficiency of these networks for users and especially internet service providers. Considering the extent of these networks, there has been numerous factors affecting their performance and thoroughly investigation of these networks needs evaluation of the effective parameters by using suitable tools. There are se...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2009