hapticdata/toxiclibsjs Peter Boyle Reviews Yasuhiro Yotsumoto and Shuntaro Tanikawa | Cordite Poetry Review Family Room by Yasuhiro Yotsumoto Vagabond Press, 2009Watashi by Shuntaro Tanikawa Vagabond Press, 2010 At the outset I will say that, though my own latest book Apocrypha was published by Vagabond Press, I hold no financial interest in the press nor any motivation to promote these two books other than the merits I find in them. The first collection under review, Yotsumoto’s Family Room, masterfully transcends the opposition between tradition and experiment; and Watashi, Tanikawa’s 20th collection to be published in English translation, certainly confirms this reviewer’s impression of being in the presence of a major poet. Born in 1959, Yasuhiro Yotsumoto has published eight collections of poetry in Japanese, each like Family Room (his first collection to appear in English translation) grouped around a single theme. Family Room is divided into five sections: ‘Kids’; ‘Dad’; ‘Mom’; ‘Wife’ and ‘Husband’; and ‘Family’. Many of the poems in Family Room are marked by a quirky sense of humour.
Nature by numbers. The theory behind this movie We can find interactive sites on the internet (like this) to draw points, move them, and check how the structure becomes updated in real time. In fact, if we have a series of random dots scattered in the plane, the best way of finding the correct Voronoi Telesación for this set is using the Delaunay triangulation. And in fact, this is precisely the idea shown on the animation: first the Delaunay Triangulation and then, subsequently, the Voronoi Tessellation. But to draw a correct Delaunay Triangulation is necessary to meet the so-called “Delaunay Condition”. This means that: a network of triangles could be considered Delaunay Triangulation if all circumcircles of all triangles of the network are “empty”. Notice that actually, given a certain number of points in the plane there is no single way to draw triangles, there are many. You see that in the graph below, extracted from Wikipedia: Podéis verlo en la siguiente gráfica, extraída de la Wikipedia:
Hemesh : a 3D mesh library for Processing | W:Blut Coded, recoded, lost, recoded and recoded … hemesh , the half-edge mesh library for Processing has slowly accreted to a state that warrants a release. A release in more than one way. In retrospect, the current functionality looks depressingly small, especially compared to the hundreds of hours that already went into coding it. But like a broke home-owner with a basement and a half-finished first floor, I comfort myself with the thought that at least it holds potential for growth. What is hemesh ? hemesh is an implementation of a half-edge datastructure for manipulating 3D meshes in Processing. Generating and displaying a mesh requires nothing more than a list of vertices and a list of faces connecting them. What can hemesh do? The library is currently focused on the stuff I coded it for: 3D voronoi and random plane divisions. Creating meshes is cool (for a given amount of cool) but destroying them is cooler. What hemesh can’t do… Getting hemesh Future
GMU:Self-Organization by Design - Medien Wiki Werkmodul/FachmodulLecturer: Martin SchneiderCredits: 6 ECTS, 4 SWSDate: Block-Workshops Venue: Marienstraße 7b, Room 204First meeting: 2013-11-29 Description Since this is a block workshop please make sure to sign up on the official list at the secretary with Daniela Dembowski until October 18th. In addition please send an application email to Martin Schneider to tell him a bit about you and what you expect from this course. This course tackles several forms of self-organisation. The three subject areas are: Pattern Formation (Cellular Automata and Turing Patterns) Dynamic Self-Organisation (Swarm-Art) Self-Assembly (Geometric Physics and Chemistry) Beschreibung Dieser Kurs setzt sich mit verschiedenen Formen der Selbst-Organisation auseinander. Die drei Themengebiete sind: Muster-Bildung (Zelluläre Automaten und Turing Patterns) Dynamische Selbst-Organisation (Swarm-Art) Selbst-Konfiguration (Geometrische Physik und Chemie) Language Eligible Participants Requirements Application Syllabus Links
gifAnimation processing library GifAnimation is a Processing library to play and export GIF animations. The GIFEncoder & GIFDecoder classes were written by Kevin Weiner. Please see the separate copyright notice in the headers of the GifDecoder & GifEncoder classes. gifAnimation.zip (compatible with Processing 1.x and 2.x) Processing 1.x Download and unzip the gifAnimation.zip and copy the gifAnimation-folder into your processing libraries folder. Processing 2.x Same as Processing 1.x OR use the built-in library-browser in the IDE Besides this reference, there are basic examples included in the download. The class to access/display GIF animations is called Gif. Extract all frames of an animated Gif into a PImage array using the static method "getPImages()". you need to pass a reference to the PApplet and a filename to it. PImage allFrames = Gif.getPImages(this, "lavalamp.gif"); The second way to acces the animation is to play it like a video. Create a new Gif object In a sketch this would look like this: The 'Gif' Class